For QIP 2027 submissions: Submit your paper to the arXiv by Wednesday at 2pm ET to have moderation delay protection. After that you’re taking a chance.
For talks that have been registered, keep in mind the deadline for uploading to arXiv: submit before 14:00 Eastern Daylight Time (18:00 UTC) on September 30 2026, to have moderation-delay protection.
Reminder for those submitting to QIP 2027: You must register your paper by the end of the day! This means you have to enter a title, abstract, list of authors, and select the topic area(s).
Note the various submission deadlines for QIP 2027. It’s different from last year! Your paper must be on the arXiv on the final submission day and hence it is recommended to upload your paper to the arXiv by Sept 30.
For talk submissions, remember to register by 28 Sep (23:59 AoE)! Registration only requires a title, short abstract, authors, and topic selections, but do note the recommended cutoff for the arXiv submission and talk submission - read the details at qipconference.org/2027/call/
The STOC 2027 Call For Papers is out and has many differences compared to last year.
acm-stoc.org/stoc2027/stoc20…
I like these changes! They are very consistent with my own views on how conferences in 2027 should adapt to the new world we’re in.
Frontier LLMs can now solve interesting open problems. So how should academic conferences adapt? I get asked this often and I've given this a lot of thought for QIP 2027 specifically, as chair of the Steering Committee. My personal thoughts (not speaking for the SC): (1/4)
Now on the arXiv: Shalev Ben-David and I (with the help of LLMs) show how a randomized algorithm can compute a total Boolean function faster than it is possible to certify the function! The full proof is < 3 pages.
arxiv.org/abs/2609.15063scirate.com/arxiv/2609.15063
Frontier LLMs can now solve interesting open problems. So how should academic conferences adapt? I get asked this often and I've given this a lot of thought for QIP 2027 specifically, as chair of the Steering Committee. My personal thoughts (not speaking for the SC): (1/4)
This seems independent of whether the ideas were generated by humans or AI. Even if the results were generated by AI, authors still play an important role: they understand the results, verify correctness, simplify the arguments, and present them clearly for other humans. (3/4)
Since the Program Committee can't evaluate the talk itself, the submission serves as a proxy. If the submission doesn't clearly explain the results to the PC, then the authors haven't shown that the talk will be a good use of the QIP audience's time. (4/4)
QIP 2027 CFP is out! Some changes: Separate registration and submission deadlines one week apart. Paper must be on arXiv by submission deadline. 3 page abstract has no author names. Poster and talk submissions separate. AI use OK, but badly written papers will be rejected.
We're pleased to announce the QIP 2027 call for submissions. The key dates are as follows; refer to the website qipconference.org/2027/call/ for detailed instructions.
Frontier LLMs can now solve many quantum computing and theoretical computer science problems that I've personally spent weeks or months working on. How is everyone else dealing with the existential crisis that accompanies this reality?
THIS IS NOT A PAPER ON ARXIV!
I want to spread more concern and awareness in our quantum information community about the current AI situation with examples, and try to stimulate important discussions that our community needs to have!
QIP will be a good time or will be too late?
We're pleased to announce the key dates for QIP 2027, as follows (refer to the website qipconference.org/2027/ for up-to-date information). We look forward to your participation!
My strategy of attending the past 17 QIPs in a row has paid off! I'm happy to announce I'm now chair of the QIP steering committee. More seriously, I'd like to thank the committee for selecting me and I look forward to QIP 2027 in Singapore.
I'm happy to announce that we improved this result establishing @fortnow's conjecture: from a quartic relationship between degree and rational degree to cubic. This is essentially the limit of this method and further demonstrates the power of "best-case" query measures.
Congrats to Matt Kovacs-Deak, Daochen Wang, and (undergraduate student!) Rain Zimin Yang on resolving the 30+ year old conjecture (by Lance Fortnow) in query complexity on rational degree vs. degree. What's more, the proof is like ~2 pages if you know the standard tools!
Just watched this movie. I wholeheartedly recommend it to everyone, even if you think AI is not very relevant to your life (because if it isn't right now, it soon will be).
Registration is now open for QEC26, to be held this June in sunny Santa Barbara, CA! see the registration page at qec-conference.org for a link.
Also, the deadline for submissions is next Friday. Make sure to get those in and spread the word to friends and collaborators!
Congrats to Matt Kovacs-Deak, Daochen Wang, and (undergraduate student!) Rain Zimin Yang on resolving the 30+ year old conjecture (by Lance Fortnow) in query complexity on rational degree vs. degree. What's more, the proof is like ~2 pages if you know the standard tools!