The paper's authors confirmed that the new point is indeed correct.
A nice application of LLMs (Codex with gpt5.5 here) for research. Yesterday, a paper appeared on arXiv with an improved lower bound on the capacity threshold of the depolarizing channel, one of the most frustrating open problems in quantum information theory (1/4)
A nice application of LLMs (Codex with gpt5.5 here) for research. Yesterday, a paper appeared on arXiv with an improved lower bound on the capacity threshold of the depolarizing channel, one of the most frustrating open problems in quantum information theory (1/4)
amazing new benchmark for quantum computing. Now we just need to figure out how to decode qLDPC codes very well! arxiv.org/abs/2602.11457
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
The realisation of utility-scale quantum computing inextricably depends on the design of practical, low-overhead fault-tolerant architectures. We introduce the \textit{Pinnacle Architecture}, which us...
arxiv.org
Started to curate a table of small quantum Tanner codes. If you want to play with codes with fairly good parameters, all the parity-check matrices are available. aleverrier.github.io/qtanner-sear...
Best qTanner codes (table)
aleverrier.github.io
"Monsieur le Président, On meurt dans vos Universités"
Lettre ouverte d'Anne Fraïsse Présidente de l'Université de Montpellier Paul-Valéry au Président de la république | UPVM
Monsieur le Président,On meurt dans vos Universités. On meurt dans mon Université. D’excès de travail, de stress, d’usure, de désespoir, d’indifférence.
univ-montp3.fr
This year's Quantum Computing Theory in Practice Conference (QCTiP) is scheduled for 04/20/2026-04/25/2026 in Oxford, UK 🇬🇧: qctipconf.github.io Talk submission deadline is just round the corner: 01/11/2026. Looking forward to many exciting contributions and a great time in Hogwarts🪄, aehm Oxford🎓.
Quantum Tanner codes are asymptotically good qLDPC codes, but they remain a bit mysterious (1/4)
🔮What will 2026 hold for #QuantumErrorCorrection? And why was 2025 such a big year in #quantum? 👀Read all about it in our EOY round-up: www.riverlane.com/blog/quantum...
Excited to share our perspective article, written with Maddie Cain and Misha Lukin, on designing low-overhead fault-tolerant architectures: rdcu.be/eVTiB. The landscape is rapidly evolving, and excited to see where the field goes next!
Opportunities in full-stack design of low-overhead fault-tolerant quantum computation
Nature Computational Science - Quantum error correction is vital for scalable quantum computing, but it incurs high resource overheads. This Perspective outlines recent breakthroughs and explores...
rdcu.be
Peter Shor: we haven't found many new quantum algorithms, in part, because we need larger quantum devices for testing our heuristics. He gives several examples of algorithms that were discovered computationally, including turbo codes, @fermilab.bsky.social quantum symposium by the SQMS center.
Turns out that quantum Tanner codes can have a pretty large distance, even at low length and with generators of weight 6. Would be nice to prove a distance upper bound of n^{2/3}.
The list of accepted papers for #QIP2026 is now online at qip2026.lu.lv/programme/ac...
Accepted papers
qip2026.lu.lv
P ≠ NP in Lean - a milestone in computational vibe complexity! arxiv.org/abs/2510.17829
A Homological Proof of $\mathbf{P} \neq \mathbf{NP}$: Computational Topology via Categorical Framework
This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational ca...
arxiv.org
The future is here: a formalization in Lean of the generalized quantum Stein's lemma! Amazing that this can be done. arxiv.org/abs/2510.08672
A Formalization of the Generalized Quantum Stein's Lemma in Lean
The Generalized Quantum Stein's Lemma is a theorem in quantum hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource theories. Its origi...
arxiv.org
There's no reachable position in chess with more than 218 moves for one player! Here's one with 218 moves for White. This was *not* proved by checking all 8.7 × 10⁴⁵ reachable chess positions. Instead, someone known only to me as Tobs45 figured out a better proof: lichess.org/@/Tobs40/blo...
this is apparently true! en.wikipedia.org/wiki/Taiping...
Taiping Rebellion - Wikipedia
en.wikipedia.org
Thomas Steinke@stein.ke · 12mo agoThe fourth deadliest war in history killed 20-30 million people (more than WW1) and was a rebellion led by a man claiming to be the brother of Jesus Christ, and you've never even heard of it. 🤯
Stephen Colbert explains why the simplest way of finding the shortest path between 22 cities involves 1. flying to the Moon 2. mining some Helium-3 3. bringing it back to the Earth and pouring it in your quantum computer.
Rod Van Meter@rdvquantum.bsky.social · 12mo agoyoutu.be/yokWHyPBz78?... This was already one of the funniest Colbert monologues in recent times, then at 7:45 he veers into talking about quantum computers!
This is interesting and surprising: some Clifford gates cannot be implemented arbitrarily well on arbitrarily good approximate GKP states with Gaussian operations! Nice work by Brenner, Diaz and Koenig arxiv.org/abs/2509.14658 Cat qubits (and generalizations) for the win, I guess ;-)
Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes
Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end,...
arxiv.org
Can ChatGPT help with research? Maybe not yet for finding new results, but it can certainly speed up some tedious tasks. An example about quantum Tanner codes #qLDPC Working with qudits (d=5) lets you use nice local codes [4,2,3]_5. Then the idea is simply to enumerate small groups and (1/4)
I think this is a very misleading figure. The consensus is that RSA will be broken with proba 1 once a quantum computer is available, but I don't think anybody reasonably expects that all postquantum protocols will eventually get broken. From arxiv.org/abs/2509.13405
We are now at 999 codes. What should be our 1000th? If we pick yours, we will feature you in a post about the code. Comment, reply, message, and spread the word.
The QIP 2026 call for papers is out! QIP 2026 will be held in Riga, Latvia from January 24–30, 2026. See you there! qip2026.lu.lv
In what senses is the quote true or useful? One thing I like about it is that it takes for granted that the listener (me!) can work on great ideas, make a great contribution. Most work doesn't even try. But it's worth trying. The sentiment makes me want to set my sights higher.
Come for the iconic papers and eye-wateringly beautiful textbooks, stay for the stories "from the trenches" (of which I hope John posts more of!). Keep writing, @johnwatrous.bsky.social !
John Watrous@johnwatrous.bsky.social · last yr.Bluehost seems to be holding my domain name hostage, I gather in an effort to sell me more products and services. Avoid them at all costs. But see if I care. Hereafter you can find my web page at jhwatrous.github.io in case you're looking for it.
When their preprint came out, it was overshadowed by Regev's paper. I found it disconcerting: space is the key near-term cost and Regev was paying space while this paper was saving space, but then Quanta and Scott Aaronson mentioned Regev but not Chevignard+. Glad they're getting recognition now.
Chevignard's QIP2025 talk on reducing the space cost of quantum factoring: www.youtube.com/watch?v=R3yM... And her co-author Schrottenloher's talk at the Simons Summer Cluster on Quantum Computing: www.youtube.com/watch?v=0pnX...
Clémence Chevignard: "Reducing the Number of Qubits in Quantum Factoring" (QIP 2025)
YouTube video by QIP2025
youtube.com
