
22,000 Qubits to Crack RSA – with Théau Perronin of Alice & Bob | Ep. 141
Title history
- 22,000 Qubits to Crack RSA – with Théau Perronin of Alice & Bob | Ep. 141 — observed on 20261111-1439 UTC (YouTube)
Keywords
Summary
154 words
Critical Evaluation
Value of the Information & Strength of the Argument
The interview provides substantial technical insight into the cat qubit approach, explaining the physics behind bit-flip suppression and how it leads to a square-root reduction in overhead compared to 2D surface codes. The argumentation is coherent and builds from first principles, contrasting with Gidney’s approach and acknowledging stringent hardware assumptions (e.g., century-long bit-flip times). The claim of a full compilation chain, including gate-level simulation, adds credibility, but the lack of peer review and the self-promotional context temper the strength of the argumentation.
Scientific Rigor, Source Quality, Title Accuracy
The scientific rigor is moderate: Perronin clearly distinguishes current experimental state (bit-flip time ~1 hour) from required assumptions (century), and offers a relaxed scenario (45,000 qubits) if improvements plateau. He references Gidney’s work and mentions internal papers, but no external sources are cited. The title accurately represents the content, focusing on the headline qubit count and the RSA/ECC implications. The description links to Alice & Bob’s site and Protiviti, but these are promotional and not primary sources. No comments were provided for analysis.
180 words
Title / Content Match
The title accurately reflects the central topic: the claim of cracking RSA-2048 with 22,593 cat qubits. The content directly addresses this and the related ECC attack.
Quality & Reliability
6/10
The claims originate from a company CEO presenting their own research, not peer-reviewed or independently verified. The technical discussion is detailed and plausible, but the reliability is limited by potential promotional bias and lack of external validation.
Key Moments
Markers derived by PSI from the transcript: the creator did not define chapters.
- Introduction of the paper's bold claim: breaking RSA-2048 with 22,593 cat qubits.
- Explanation of cat qubits and their native bit-flip error suppression.
- Discussion of LDPC codes and 2D layout folding to achieve low overhead.
- Comparison to Gidney's approach and discussion of space-time trade-offs.
- AI and autonomous experimentalists running physics tests; future scaling prospects.
Cited Sources
- Alice & Bob - Official Website — Company website where the paper and technical details are presented.
- Protiviti Quantum Computing Services — Sponsor and employer of host; context for the podcast's post-quantum readiness focus.
Contribution & Novelties
The main novelty is the dramatic reduction in physical qubit estimates for breaking RSA-2048, achieved by fully compiling the algorithm down to the gate level and exploiting cat qubit properties throughout the error correction stack. This goes beyond previous back-of-envelope resource estimates, potentially accelerating the perceived timeline for quantum threats. The episode also highlights the growing role of AI in quantum hardware development.
Pour aller plus loin :
- Cat qubit explanation (Wikipedia) — Concept of Schrödinger cat states, foundational to the cat qubit design.
- Quantum error correction (Wikipedia) — Overview of error correction codes, including LDPC codes.
- Shor’s algorithm (Wikipedia) — The algorithm that can factor large numbers efficiently, relevant to RSA breaking.
- Elliptic curve cryptography (Wikipedia) — Basis of Bitcoin’s security, discussed for 60-minute crack.
126 words
Radar Profile
The radar shows high scores in technical level and quantity of information, with moderate quality and reliability, reflecting a technically deep but potentially biased source. The low reliability score suggests the need for independent verification.