anthony-leverrier.bsky.social
@anthony-leverrier.bsky.social
Pinned
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}.
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}.
November 25, 2025 at 4:50 PM
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}.
Reposted by anthony-leverrier.bsky.social
The list of accepted papers for #QIP2026 is now online at qip2026.lu.lv/programme/ac...
Accepted papers
qip2026.lu.lv
November 11, 2025 at 1:28 PM
The list of accepted papers for #QIP2026 is now online at qip2026.lu.lv/programme/ac...
Reposted by anthony-leverrier.bsky.social
P ≠ NP in Lean - a milestone in computational vibe complexity!
arxiv.org/abs/2510.17829
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
October 24, 2025 at 3:46 PM
P ≠ NP in Lean - a milestone in computational vibe complexity!
arxiv.org/abs/2510.17829
arxiv.org/abs/2510.17829
Est-ce que c’est au même endroit ?
October 17, 2025 at 1:41 PM
Est-ce que c’est au même endroit ?
Reposted by anthony-leverrier.bsky.social
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
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
October 13, 2025 at 5:31 AM
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
Amazing that this can be done.
arxiv.org/abs/2510.08672
Reposted by anthony-leverrier.bsky.social
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 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...
September 26, 2025 at 7:39 AM
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 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...
September 23, 2025 at 7:03 PM
Reposted by anthony-leverrier.bsky.social
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.
1. flying to the Moon
2. mining some Helium-3
3. bringing it back to the Earth and pouring it in your quantum computer.
September 22, 2025 at 6:45 AM
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.
1. flying to the Moon
2. mining some Helium-3
3. bringing it back to the Earth and pouring it in your quantum computer.
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
;-)
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
September 19, 2025 at 1:22 PM
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
;-)
Nice work by Brenner, Diaz and Koenig
arxiv.org/abs/2509.14658
Cat qubits (and generalizations) for the win, I guess
;-)
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)
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)
September 18, 2025 at 2:40 PM
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)
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
From arxiv.org/abs/2509.13405
September 18, 2025 at 5:30 AM
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
From arxiv.org/abs/2509.13405
Reposted by anthony-leverrier.bsky.social
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.
Comment, reply, message, and spread the word.
July 18, 2025 at 1:47 AM
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.
Comment, reply, message, and spread the word.
Reposted by anthony-leverrier.bsky.social
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
qip2026.lu.lv
August 6, 2025 at 12:44 AM
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
qip2026.lu.lv
Reposted by anthony-leverrier.bsky.social
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.
August 5, 2025 at 4:52 AM
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.
Reposted by anthony-leverrier.bsky.social
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 !
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.
But see if I care. Hereafter you can find my web page at jhwatrous.github.io in case you're looking for it.
I ditched my old website and created a new one on GitHub Pages:
johnwatrous.com
It's a great option for a static web page, particularly if you like to do your own CSS styling rather than flipping through pre-built templates that are never quite right.
johnwatrous.com
It's a great option for a static web page, particularly if you like to do your own CSS styling rather than flipping through pre-built templates that are never quite right.
August 2, 2025 at 7:10 PM
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 !
Reposted by anthony-leverrier.bsky.social
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.
July 30, 2025 at 10:42 AM
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.
Reposted by anthony-leverrier.bsky.social
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...
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
www.youtube.com
July 30, 2025 at 10:31 AM
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...
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...
Reposted by anthony-leverrier.bsky.social
Gilles Dowek, informaticien engagé et vulgarisateur, est mort
Gilles Dowek, informaticien engagé et vulgarisateur, est mort
Passionné par la dimension éthique de sa discipline, le chercheur de l’Inria et professeur attaché à l’ENS Paris-Saclay, est décédé lundi 21 juillet, à l’âge de 58 ans.
www.lemonde.fr
July 21, 2025 at 4:05 PM
Gilles Dowek, informaticien engagé et vulgarisateur, est mort
Reposted by anthony-leverrier.bsky.social
"Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation"
arxiv.org/abs/2507.03678
A comprehensive database of notable quantum computing experiments, with emphasis on quantum error correction implementations:
github.com/francois-mar...
arxiv.org/abs/2507.03678
A comprehensive database of notable quantum computing experiments, with emphasis on quantum error correction implementations:
github.com/francois-mar...
Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation
Achieving fault-tolerant quantum computation (FTQC) demands simultaneous progress in physical qubit performance and quantum error correction (QEC). This work reviews and benchmarks experimental advanc...
arxiv.org
July 8, 2025 at 6:36 AM
"Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation"
arxiv.org/abs/2507.03678
A comprehensive database of notable quantum computing experiments, with emphasis on quantum error correction implementations:
github.com/francois-mar...
arxiv.org/abs/2507.03678
A comprehensive database of notable quantum computing experiments, with emphasis on quantum error correction implementations:
github.com/francois-mar...
Reposted by anthony-leverrier.bsky.social
Les PPP, c'est l'avenir de la recherche de qualité
July 6, 2025 at 3:32 PM
Les PPP, c'est l'avenir de la recherche de qualité
Reposted by anthony-leverrier.bsky.social
After all these reports of authors adding language instructions for LLM reviews in their papers I wanted to check this myself and I downloaded the .tex source from one of these papers.
Here is an example.
(I will not share the identity of the paper)
Here is an example.
(I will not share the identity of the paper)
July 5, 2025 at 5:12 PM
After all these reports of authors adding language instructions for LLM reviews in their papers I wanted to check this myself and I downloaded the .tex source from one of these papers.
Here is an example.
(I will not share the identity of the paper)
Here is an example.
(I will not share the identity of the paper)
Reposted by anthony-leverrier.bsky.social
Ils sont en train de bannir CALVIN & HOBBES du Tennessee 😭
How profoundly sad. The kids deprived of reading Calvin and Hobbes are the kids who need them the most. My brother put it best: "We know we’re fucked when they come for your cartoon stuffed tigers."
Let's go sit in the grass and crack open "The Days are Just Packed."
pen.org/magic-tree-h...
Let's go sit in the grass and crack open "The Days are Just Packed."
pen.org/magic-tree-h...
‘Magic Tree House’ Author, ‘Calvin and Hobbes’ among hundreds of Tennessee book bans - PEN America
The removals in Tennessee are the result of a growing political movement to control information through book banning.
pen.org
June 23, 2025 at 5:50 PM
Ils sont en train de bannir CALVIN & HOBBES du Tennessee 😭