John Bostanci
banner
johnbostanci.bsky.social
John Bostanci
@johnbostanci.bsky.social
I think about quantum computers.

https://johnbostanci.com
Reposted by John Bostanci
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
June 3, 2025 at 9:20 PM
Reposted by John Bostanci
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...
Details | Postdoctoral Associate - Computer Science | Careers | Division of Human Resources | Virginia Tech
careers.pageuppeople.com
April 28, 2025 at 7:43 PM
Reposted by John Bostanci
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...
April 1, 2025 at 10:26 PM
Reposted by John Bostanci
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
Breakthrough Prize – Breakthrough Prize Announces 2025 Laureates in Life Sciences, Fundamental Physics, and Mathematics
breakthroughprize.org
April 6, 2025 at 7:22 AM
Reposted by John Bostanci
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:
February 12, 2025 at 5:11 PM
Reposted by John Bostanci
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:
February 11, 2025 at 9:02 PM
Reposted by John Bostanci
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).
February 11, 2025 at 8:56 PM
Reposted by John Bostanci
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!
February 12, 2025 at 5:13 PM
Can't wait to see everyone in NYC for ITCS! :D
January 5, 2025 at 12:22 AM
Reposted by John Bostanci
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)
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-...
arxiv.org
January 3, 2025 at 7:35 AM
Finally finished my 9+1, super excited to run the NY marathon next year! 😃

Time to start training 😅
December 15, 2024 at 10:08 PM
Reposted by John Bostanci
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...
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...
gardenofforkingpath.blogspot.com
December 9, 2024 at 2:20 AM
Reposted by John Bostanci
Now in one place, my sixty favorite theorems covering the six decades of computational complexity.

blog.computationalco...
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...
blog.computationalcomplexity.org
December 4, 2024 at 2:07 PM
Reposted by John Bostanci
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...
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?
quantumcomputing.stackexchange.com
November 28, 2024 at 4:56 PM
Reposted by John Bostanci
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.
November 26, 2024 at 9:07 PM