The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Paul Webster, Lucas Berent, Omprakash Chandra, Evan T. Hockings, Nou\'edyn Baspin, Felix Thomsen, Samuel C. Smith, Lawrence Z. Cohen

TL;DR
The paper introduces the Pinnacle Architecture, a quantum computing design using quantum LDPC codes, enabling RSA-2048 factorization with fewer than 100,000 qubits, significantly reducing resource requirements.
Contribution
It presents a novel fault-tolerant quantum architecture that drastically lowers the qubit count needed for practical quantum computations like RSA-2048 factoring.
Findings
RSA-2048 can be factored with fewer than 100,000 qubits
Uses quantum LDPC codes for lower overhead
Demonstrates feasibility of large-scale quantum computing
Abstract
The realisation of utility-scale quantum computing inextricably depends on the design of practical, low-overhead fault-tolerant architectures. We introduce the Pinnacle Architecture, which uses quantum low-density parity check (QLDPC) codes to allow for universal, fault-tolerant quantum computation with a spacetime overhead significantly smaller than that of any competing architecture. With this architecture, we show that 2048-bit RSA integers can be factored with fewer than one hundred thousand physical qubits, given a physical error rate of , code cycle time of microsecond and a reaction time of microseconds. We thereby demonstrate the feasibility of utility-scale quantum computing with an order of magnitude fewer physical qubits than has previously been believed necessary.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
