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

I. D. Kivlichan, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, W. Sun, Z. Jiang, N. Rubin, A. Fowler, A. Aspuru-Guzik, H. Neven, and R. Babbush, Improved fault-tolerant quantum simulation of condensed-phase correlated electrons via Trotterization, Quantum 4

Original

1902

Earlier work this paper cites.

P. Panteleev and G. Kalachev, Degenerate quantum LDPC codes with good finite length performance, Quantum 5

Original

1904

Earlier work this paper cites.

C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5

Original

1905

Earlier work this paper cites.

D. Litinski, Magic state distillation: Not as costly as you think, Quantum 3

Original

1905

Earlier work this paper cites.

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes , North-Holland Mathematical Library, Vol. 16 (Elsevier, 1977)

1977

Earlier work this paper cites.

P. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134

1994

Earlier work this paper cites.

S. Lloyd, Universal quantum simulators, Science 273

1996

Earlier work this paper cites.

D. J. C. MacKay, G. Mitchison, and P. L. McFadden, Sparse graph codes for quantum error-correction, IEEE Transactions on Information Theory 50

2004

Earlier work this paper cites.

S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Physical Review A 70

2004

Earlier work this paper cites.

S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Physical Review A 71

2005

Earlier work this paper cites.

J. Yoneda, W. Huang, M. Feng, C. H. Yang, K. W. Chan, T. Tanttu, W. Gilbert, R. C. C. Leon, F. E. Hudson, K. M. Itoh, A. Morello, S. D. Bartlett, A. Laucht, A. Saraiva, and A. S. Dzurak, Coherent spin qubit transport in silicon, Nature Communications 12

Original

2008

Earlier work this paper cites.

A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Physical Review A 86

Original

2012

Earlier work this paper cites.

D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New Journal of Physics 14

Original

2012

Earlier work this paper cites.

E. T. Campbell, Early fault-tolerant simulations of the Hubbard model, Quantum Science and Technology 7

Original

2012

Earlier work this paper cites.

N. Raveendran and B. Vasić, Trapping sets of quantum LDPC codes, Quantum 5

Original

2012

Earlier work this paper cites.

A. A. Kovalev and L. P. Pryadko, Quantum Kronecker sum-product low-density parity-check codes with finite rate, Physical Review A 88

Original

2013

Earlier work this paper cites.

C. Jones, Low-overhead constructions for the fault-tolerant Toffoli gate, Physical Review A 87

Original

2013

Earlier work this paper cites.

A. Paetznick and K. M. Svore, Repeat-until-success: Non-deterministic decomposition of single-qubit unitaries, Quantum Information and Computation 14

Original

2014

Earlier work this paper cites.

A. Bocharov, M. Roetteler, and K. M. Svore, Efficient synthesis of universal repeat-until-success circuits, Physical Review Letters 114

Original

2015

Earlier work this paper cites.

S. Bravyi, G. Smith, and J. Smolin, Trading classical and quantum computational resources, Physical Review X 6

Original

2016

Earlier work this paper cites.

H. Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code, Scientific Reports 6

2016

Cited alongside, same era.

M. Ekerå and J. Håstad, Quantum algorithms for computing short discrete logarithms and factoring RSA integers, in Post-Quantum Cryptography , Vol. 10346 (2017) pp. 347–363, arXiv:1702.00249

Original

2017

Cited alongside, same era.

R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding electronic spectra in quantum circuits with linear T complexity, Physical Review X 8

Original

2018

Cited alongside, same era.

N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2

Original

2021

Cited alongside, same era.

H. Bombin, I. H. Kim, D. Litinski, N. Nickerson, M. Pant, F. Pastawski, S. Roberts, and T. Rudolph, Interleaving: Modular architectures for fault-tolerant photonic quantum computing (2021), arXiv:2103.08612

T. J. Yoder, E. Schoute, P. Rall, E. Pritchett, J. M. Gambetta, A. W. Cross, M. Carroll, and M. E. Beverland, Tour de gross: A modular quantum computer based on bivariate bicycle codes (2025), arXiv:2506.03094

Original

2025

Later among the works it cites.

P. Webster, S. C. Smith, and L. Z. Cohen, Explicit construction of low-overhead gadgets for gates on quantum LDPC codes (2025), arXiv:2511.15989

Original

2025

Later among the works it cites.

A. C. Hughes, R. Srinivas, C. M. Löschnauer, H. M. Knaack, R. Matt, C. J. Ballance, M. Malinowski, T. P. Harty, and R. T. Sutherland, Trapped-ion two-qubit gates with > > 99.99% fidelity without ground-state cooling (2025), arXiv:2510.17286

Original

2025

Later among the works it cites.

H. Zhou, C. Duckering, C. Zhao, D. Bluvstein, M. Cain, A. Kubica, S.-T. Wang, and M. D. Lukin, Resource analysis of low-overhead transversal architectures for reconfigurable atom arrays, in Proceedings of the 52nd Annual International Symposium on Computer Architecture (2025) pp. 1432–1448, arXiv:2505.15907

Original

2025