FOCS 2026 will be held in New York City Nov 8 - 11! CFP is up (link below). Submit your best work in theoretical computer science by April 1, 5pm ET.

In the last post of a 3-part series, Dominik Hangleiter highlights the importance of efficient verification of quantum advantage, and assesses the prospects for achieving it soon. quantumfrontiers.com/2026/02/28/w...

Congratulations to our colleague John Wright, who has received a 2026 Sloan Fellowship! chemistry.berkeley.edu/news/seven-u...

How can we make sense of computational problems that we don’t even have the language to describe? I spoke to @henryyuen.bsky.social about what’s missing from the standard approach to quantum complexity theory — read more in @quantamagazine.bsky.social!

The list of accepted papers at #STOC2026 is out: acm-stoc.org/stoc2026/acc... Congratulations to all authors!

Hi, I have a new paper out with Andrew Huang and Vinod Vaikuntanathan! We give another classical oracle separation between QMA and QCMA, and a classical oracle separation between BQP/qpoly and BQP/poly. Based on the Yamakawa-Zhandry code intersection problem. arxiv.org/abs/2602.09385

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...

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

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

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...

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...

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

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:

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:

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).

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!

Can't wait to see everyone in NYC for ITCS! :D

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)

Finally finished my 9+1, super excited to run the NY marathon next year! 😃 Time to start training 😅

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...

Now in one place, my sixty favorite theorems covering the six decades of computational complexity. blog.computationalco...

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...

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.