anthony-leverrier.bsky.social

J'imagine qu'il existe un nombre de journaux où ça peut fonctionner ? Et il suffit de demander à l'IA de faire ce genre de rapport.

I very much agree with you. I wonder what should be said to students who want to learn programming instead, and not just algorithms.

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

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

looks amazing! congrats!

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

"Monsieur le Président, On meurt dans vos Universités"

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

sometimes people call it stabilizer weight but this is truly the generators weight. This is the maximum weight of operators needed to generate the stabilizer group.

thanks for sharing!

Small quantum Tanner codes from left--right Cayley complexes Quantum Tanner codes are a class of quantum low-density parity-check codes that provably display a linear minimum distance and a constant encoding rate in the asymptotic limit. When built from left--r...

And we also found many small codes with great parameters [[144,12,11]], [[432,20,22]], [[576,28,24]].
Great collaboration with Wouter Rozendaal and Gilles Zémor!
arxiv.org/abs/2512.20532

After a set of stabilizers is measured, one reschuffles the qubits in each column (e.g. with a cyclic permutation), and one proceeds with the next set of stabilizer measurements. Ideal for atoms or ions @pasqal-quantum.bsky.social @queracomputing.bsky.social @quantinuum.bsky.social (3/4)

They are naturally defined on a square-complex that may be hard to picture in one's mind. But there also exists a way to represent them in 3D (see picture above).
They have 4 types of stabilizers, that can all be measured in parallel. (2/4)

Quantum Tanner codes are asymptotically good qLDPC codes, but they remain a bit mysterious (1/4)

An upbeat blog post for Christmas: Quantum Error Correction goes FOOM

algassert.com/post/2503

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

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

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!

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

what happened?

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

P ≠ NP in Lean - a milestone in computational vibe complexity!
arxiv.org/abs/2510.17829

Est-ce que c’est au même endroit ?

Onedrive settings. A toggle for using AI to detect and identify faces is set to on. The caption says, you can only turn off this setting 3 times per year.

bitch what

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

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

Kitaev also

grandfather? he's not *that* old
;-)

A weird chess position where White has 9 queens, two rooks in the corners, etc, and black is checkmated with king in the corner, and only two pawns. From here: https://lichess.org/@/Tobs40/blog/there-is-no-reachable-chess-position-with-more-than-218-moves/a5xdxeqs

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

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.