Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
Trading classical and quantum computational resources
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. First we consider sparse quantum circuits such that each qubit participates in O(1) two-qubit gates. It is shown that any sparse circuit on n+k qubits can be simulated by sparse circuits on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Secondly, we study Pauli-based computation (PBC) where allowed operations are non-destructive eigenvalue measurements of n-qubit Pauli operators. The computation begins by initializing each qubit in the so-called magic state. This model is known to be equivalent to the universal quantum computer. We show that any PBC on n+k qubits can be simulated by PBCs on n qubits and a classical processing that takes time $2^{O(k)} poly(n)$. Finally, we propose a purely classical algorithm that can simulate a PBC on n qubits in a time $2^{c n} poly(n)$ where $c\approx 0.94$. This improves upon the brute-force simulation method which takes time $2^n poly(n)$. Our algorithm exploits the fact that n-fold tensor products of magic states admit a low-rank decomposition into n-qubit stabilizer states.
citation-role summary
background 1
method 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Stabilizer Rényi entropies and Pauli spectrum cumulants show universal power-law scaling with driving rate in slow processes across quantum phase transitions, with the logarithmic Pauli spectrum asymptotically Gaussian, demonstrated in the transverse-field Ising model and long-range Kitaev models.
Non-Clifford gates including Ising, Toffoli, and T arise as exact path integrals in Chern-Simons and Dijkgraaf-Witten topological quantum field theories.
citing papers explorer
-
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
-
Universal Non-stabilizerness Dynamics Across Quantum Phase Transitions
Stabilizer Rényi entropies and Pauli spectrum cumulants show universal power-law scaling with driving rate in slow processes across quantum phase transitions, with the logarithmic Pauli spectrum asymptotically Gaussian, demonstrated in the transverse-field Ising model and long-range Kitaev models.
-
Magic and Non-Clifford Gates in Topological Quantum Field Theory
Non-Clifford gates including Ising, Toffoli, and T arise as exact path integrals in Chern-Simons and Dijkgraaf-Witten topological quantum field theories.