The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes

• URL: http://arxiv.org/abs/2602.11457v1
• Date: Thu, 12 Feb 2026 00:30:48 GMT
• Title: The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
• Abstract summary: We introduce the textit Pinnacle Architecture, which uses quantum low-density parity check (QLDPC) codes to allow for universal, fault-tolerant quantum computation.<n>We show that 2048-bit RSA integers can be factored with less than one hundred thousand physical qubits, given a physical error rate of $10-3$, code cycle time of $1$ textmu s and a reaction time of $10$ textmu s.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 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 less than one hundred thousand physical qubits, given a physical error rate of $10^{-3}$, code cycle time of $1$ \textmu s and a reaction time of $10$ \textmu s. We thereby demonstrate the feasibility of utility-scale quantum computing with an order of magnitude fewer physical qubits than has previously been believed necessary.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Quantum LDPC codes with design rate 1/5 and good performance below 1000 physical qubits [0.0]
  Constant-rate quantum low-density parity-check (LDPC) codes promise fault-tolerant quantum computation with constant spatial overhead in the limit.<n>We introduce a new family of quantum LDPC codes with design rate $1/5$ and check weight $9$ that approaches the teraquop memory regime per qubit-round with several hundred physical qubits.
  arXiv  Detail & Related papers  (2026-07-30T03:55:43Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting [0.0]
  Quantum computer hardware is predicted to scale over hundreds of thousands of qubits coming online in the next decade.<n>Despite significant theoretical and experimental QEC progress, quantum computer architecture has suffered a significant gap.<n>We present a complete heterogeneous quantum computing architecture incorporating task-specific hardware selection and QEC encoding, and agnostic to code selection or physical qubit parameters.
  arXiv  Detail & Related papers  (2026-04-07T18:00:11Z)
• Impacts of Decoder Latency on Utility-Scale Quantum Computer Architectures [1.2099984425168675]
  We build a model for the reaction time in which the decoder latency is based on parallel space- and time-window decoding methods.<n>We show how the logical microarchitecture can be optimized with respect to the reaction time.
  arXiv  Detail & Related papers  (2025-11-13T18:55:10Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures [0.8453577061453568]
  We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations.<n>We show that physical quantum resource estimation reduces to a simple model involving a small number of key parameters.
  arXiv  Detail & Related papers  (2024-11-06T21:25:34Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays [5.542275446319411]
  We propose a hardware-efficient scheme to perform fault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable atom arrays. Our work paves the way for explorations of low-overhead quantum computing with qLDPC codes at a practical scale.
  arXiv  Detail & Related papers  (2023-08-16T19:47:17Z)
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations [0.5658123802733283]
  We propose a quantum computing architecture to close the gap between NISQ and FTQC. For early-FTQC devices, we can perform roughly $1.72 times 107$ Clifford operations and $3.75 times 104$ arbitrary rotations on 64 logical qubits.
  arXiv  Detail & Related papers  (2023-03-23T11:21:41Z)
• A High Performance Compiler for Very Large Scale Surface Code Computations [38.26470870650882]
  We present the first high performance compiler for very large scale quantum error correction. It translates an arbitrary quantum circuit to surface code operations based on lattice surgery. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device.
  arXiv  Detail & Related papers  (2023-02-05T19:06:49Z)
• Field-deployable Quantum Memory for Quantum Networking [62.72060057360206]
  We present a quantum memory engineered to meet real-world deployment and scaling challenges. The memory technology utilizes a warm rubidium vapor as the storage medium, and operates at room temperature. We demonstrate performance specifications of high-fidelity retrieval (95%) and low operation error $(10-2)$ at a storage time of 160 $mu s$ for single-photon level quantum memory operations.
  arXiv  Detail & Related papers  (2022-05-26T00:33:13Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras [0.9622115055919379]
  In the early years of fault-tolerant quantum computing (FTQC), the available code distance and the number of magic states will be restricted. Here, we integrate quantum error correction and quantum error mitigation into an efficient FTQC architecture. This scheme will dramatically alleviate the required computational overheads and hasten the arrival of the FTQC era.
  arXiv  Detail & Related papers  (2020-10-08T10:27:29Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.