John Bostanci
@johnbostanci.bsky.social
📤 84
📥 52
📝 6
I think about quantum computers.
https://johnbostanci.com
reposted by
John Bostanci
John Preskill
13 days ago
Dominik Hangleiter weighs in with an informative post about a much debated question: Has quantum advantage been achieved? This is the first post in a three-part series.
quantumfrontiers.com/2026/01/06/h...
loading . . .
Has quantum advantage been achieved?
Recently, I gave a couple of perspective talks on quantum advantage, one at the annual retreat of the CIQC and one at a recent KITP programme. I started off by polling the audience on who believed …
https://quantumfrontiers.com/2026/01/06/has-quantum-advantage-been-achieved/
0
22
6
reposted by
John Bostanci
Henry Yuen
2 months ago
My student
@johnbostanci.bsky.social
, Chinmay Nirkhe, Jonas Haferkamp, and Mark Zhandry have put out a tour-de-force paper that shows, relative to a classical oracle, QMA is stronger than QCMA -- i.e., quantum proofs >> classical proofs. Congratulations to the authors!
arxiv.org/abs/2511.09551
loading . . .
Separating QMA from QCMA with a classical oracle
We construct a classical oracle proving that, in a relativized setting, the set of languages decidable by an efficient quantum verifier with a quantum witness (QMA) is strictly bigger than those decid...
https://arxiv.org/abs/2511.09551
1
46
5
reposted by
John Bostanci
Anupam Gupta
8 months ago
It's a thrill to announce names of the amazing set of theory people joining NYU CS+CSE this year:
@aineshbakshi.bsky.social
, Allen Liu,
@fermima.bsky.social
, Sanjeev Khanna, Tony Metger, and Juan Perdomo.
@nyucourant.bsky.social
@nyutandon.bsky.social
5
47
8
reposted by
John Bostanci
Steve Flammia
9 months ago
I'm hiring a postdoc! If you'd like to work with me on quantum learning, error correction, quantum algorithms, and FTQC at Virginia Tech in the Washington, DC metro area, please apply here:
careers.pageuppeople.com/968/cw/en-us...
loading . . .
Details | Postdoctoral Associate - Computer Science | Careers | Division of Human Resources | Virginia Tech
https://careers.pageuppeople.com/968/cw/en-us/job/532991/postdoctoral-associate-computer-science
0
34
13
reposted by
John Bostanci
Craig Gidney
10 months ago
For sigbovik, I factored all 8 bit ints (up to 255) with a quantum computer
github.com/strilanc/fal...
I did it as legit as I possibly could. I ran a correct circuit with no optimization shenanigans. I did correct pre/postprocessing. It took 121 quantum samples to finish the entire task. But...
2
63
12
reposted by
John Bostanci
Dulwich Quantum Computing
10 months ago
Congrats to Jeongwan Haah and Ewin Tang on being awarded the 2025 New Horizons in Physics and Maryam Mirzakhani New Frontiers Prizes respectively!
breakthroughprize.org/News/91
loading . . .
Breakthrough Prize – Breakthrough Prize Announces 2025 Laureates in Life Sciences, Fundamental Physics, and Mathematics
https://breakthroughprize.org/News/91
1
57
9
reposted by
John Bostanci
QIP 2025 Conference
11 months ago
Our third tutorial of QIP 2025 is “Quantum error correction: a guided tour" by Victor Albert (
@vva.bsky.social
) from NIST and QuICS, who will gently introduce and visit increasingly important corners of the mega-field of QEC (Sun Feb 23, 9am-12:30pm, Room 302ABC). Overview below:
0
11
5
reposted by
John Bostanci
QIP 2025 Conference
11 months ago
Our second tutorial of QIP 2025 is by Hsin-Yuan (Robert) Huang from
#Google
Quantum AI on Quantum Learning and Certification (Feb 22 Sat, 2-5:30pm, Room 302ABC). Overview below:
0
9
4
reposted by
John Bostanci
QIP 2025 Conference
11 months ago
QIP 2025 is fast approaching! And we have exciting tutorials lined up on Feb 22-23 (Sat-Sun) right before the conference! First in line, we have Cambyse Rouzé from
#inria
, whose tutorial will cover Quantum Gibbs Sampling (9am-12:30pm, Room 302ABC).
0
12
5
reposted by
John Bostanci
QIP 2025 Conference
11 months ago
Our fourth and final tutorial of QIP 2025 is by Dakshita Khurana from UIUC about Quantum Cryptography and TCS (Sun Feb 23, 2-5:30pm, Room 302ABC). Overview below!
0
7
4
Can't wait to see everyone in NYC for ITCS! :D
about 1 year ago
0
0
0
reposted by
John Bostanci
about 1 year ago
Good news for the new year: if you want a more streamlined proof of the landmark result MIP* = RE, then a new paper does that (and much more):
arxiv.org/abs/2501.00173
(207 pages, though)
loading . . .
The Aldous--Lyons Conjecture II: Undecidability
This paper, and its companion [BCLV24], are devoted to a negative resolution of the Aldous--Lyons Conjecture [AL07, Ald07]. In this part we study tailored non-local games. This is a subclass of non-...
https://arxiv.org/abs/2501.00173
0
26
10
Finally finished my 9+1, super excited to run the NY marathon next year! 😃 Time to start training 😅
about 1 year ago
0
4
0
reposted by
John Bostanci
Jiahui Liu
about 1 year ago
Peer reviews of the quantum cryptography community have been making me very depressed and nihilistic recently..... Wrote this just to vent....
gardenofforkingpath.blogspot.com/2024/12/some...
loading . . .
Some thoughts after QIP reviews....
Peer reviews of the quantum cryptography community at the moment: Reviewers from other areas: "Not my area, not interested so reject" Revi...
https://gardenofforkingpath.blogspot.com/2024/12/some-thoughts-after-qip-reviews.html
4
27
3
reposted by
John Bostanci
Lance Fortnow
about 1 year ago
Now in one place, my sixty favorite theorems covering the six decades of computational complexity.
blog.computationalco...
loading . . .
Favorite Theorems: The Complete List
Now in one place all of my sixty favorite theorems from the six decades of computational complexity (1965-2024). 2015-2024 Graph Isomorphism...
https://blog.computationalcomplexity.org/2024/12/favorite-theorems-complete-list.html
1
67
15
reposted by
John Bostanci
John Watrous
about 1 year ago
I just set the maximum possible bounty on a Quantum Computing Stack Exchange problem. I could answer myself, but I know many others could too, and this seemed like fun.
quantumcomputing.stackexchange.com/questions/40...
loading . . .
What is the complexity of modulo order-finding problem on classical computer?
It doesn't seem to be NP-complete. But has it been proved to be NP-hard?
https://quantumcomputing.stackexchange.com/questions/40537/what-is-the-complexity-of-modulo-order-finding-problem-on-classical-computer
3
31
3
reposted by
John Bostanci
Clément Canonne
about 1 year ago
Meanwhile, it's been 5 months since told at
#STOC24
, and SIGACT still hasn't made an official announcement about the recipient of the 2024 ACM SIGACT Distinguished Service Award (Sanjeev Arora) and why (commendation). You'd start to think that they don't really give a damn about service after all.
2
4
1
you reached the end!!
feeds!
log in