Link: sanjeevkhanna.org/FOCS2026_CFP...
02.03.2026 01:41
👍 0
🔁 0
💬 0
📌 0
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.
Congrats to Sloan fellows: @nyucourant.bsky.social colleagues Florian Schäfer and Joe Tassarotti, and theory colleagues @behnezhad.bsky.social, @surbhigoel.bsky.social, Aayush Jain, Anand Natarajan, @adtraghunathan.bsky.social, @soledadvillar.bsky.social, and John Wright!
sloan.org/fellowships/...
I remember the summer of 2007 after freshman year. I was lucky to land a summer internship with CACS, to redesign the group website. I was pretty intimidated to be sharing an office with you. One day, I snuck a glance back at you and relaxed when I saw that you were browsing guitars on craigslist.
My thoughts: "how much longer is he going to ask me to stand here looking off into the distance?"
I discuss fully quantum complexity theory with @benbenbrubaker.bsky.social. Although we're not really sure, it seems like our understanding of computing on quantum data needs new foundations. Transforming quantum data is less like solving a hard math problem, and more like doing an intricate dance.
How to turn off Gmail's ability to read your emails to train its bots: www.malwarebytes.com/blog/news/20...
This problem was originally introduced by Aaronson and Kuperberg in 2007 in their seminal paper that gave a *quantum* oracle separating QMA vs QCMA. Coming up with a classical oracle to do the same has attracted a lot of attention from folks over the years.
John gave an epic 2.5 hour whiteboard talk today about the proof, and the ideas used are quite dazzling: Noether's theorem, recording oracles, bosons, ...
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
The list of accepted papers for #QIP2026 is now online at qip2026.lu.lv/programme/ac...
You could also work with Debbie Leung, Richard Cleve, David Gosset, Luke Schaefer, Ashwin Nayak, Norbert Lutkenhaus, Mike Mosca, Christine Muschik or some combination of us if you do theory.
Following *this* reference in turn yields basically a version of the iterative QPE.
Thanks for the reference. I took a closer look at this paper, and first of all it is beautifully written. Second of all I noticed that it mentions off-hand "Also, it should be noted that the QFT, and its inverse, can be implemented in the fault tolerant ‘semiclassical’ way (Griffiths & Niu).
I do phase estimation without QFT in my undergrad course. youtu.be/CMqPutlG59c?...
It's just Hadamard test plus binary search.
Academics in Assyria in the 7th c BC complain that admin is preventing them from doing research and teaching
Best wishes, Eric.
This is great! Do you know of a good reference for comparing the pros/cons of the QFT version versus the single-ancilla qubit version (complexity, why you would use one versus another)? Patrick Rall's paper alludes to the tradeoffs, but it doesn't give as much detail as I would like.
By Kitaev's algorithm, do you mean the one without QFT?
Is there any reason to teach QFT at all in an intro to quantum computing class? From Patrick Rall's paper on phase estimation, it seems potentially superfluous (arxiv.org/pdf/2103.09717).
But last week I covered the "poor man's" version of phase estimation, which only uses a single ancilla qubit. I am now wondering, why do we need the QFT anyways? Googling around, it seems like in many cases we don't! Is there any reason to QFT-based phase estimation?
Tomorrow I am teaching quantum phase estimation in my Intro to Quantum Computing Class for the seventh time. I was prepared to teach it the standard, textbook, Nielsen and Chuang way: applied controlled unitaries and their powers thereof, apply inverse QFT to the ancillas.
Congrats Clement!
Congratulations Lauritz!
Dr. Jane Goodall filmed an interview with Netflix in March 2025 that she understood would only be released after her death.
The music totally sounds Haar random!
The submission server for #ITCS2026 (which will take place at Bocconi University, Milan, in January 2026) is open!
Submission deadline: Sep 4 (abstracts), Sep 6 (papers)
itcs-conf.org
How fast can (pseudo)random unitaries be implemented on a quantum computer? O(1) time suffices (provided you can do things like intermediate measurements)! This -and more- is thanks to a superfun collaboration with Ben Foxman, @nat-parham.bsky.social, and @franvasco.bsky.social (all PhD students!).
Donation link here: www.ipam.ucla.edu/news/nsf-fun...
Sausages and cheese, German supermarket
the scenario we all feared
