Realization of a scalable Shor algorithm
Open accessAbstract
Reducing quantum overhead: A quantum computer is expected to outperform its classical counterpart in certain tasks. One such task is the factorization of large integers, the technology that underpins the security of bank cards and online privacy. Using a small-scale quantum computer comprising five trapped calcium ions, Monz et al. implement a scalable version of Shor's factorization algorithm. With the function of ions being recycled and the architecture scalable, the process is more efficient than previous implementations. The approach thus provides the potential for designing a powerful quantum computer, but with fewer resources. Science , this issue p. 1068
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Large-scale factoring of RSA-2048 on a fault-tolerant quantum computer requires deep logical circuits and extensive error correction, demanding millions of physical qubits and prolonged error-free operation.
“large-scale factoring of RSA-2048 on a fault-tolerant quantum computer requires deep logical circuits and extensive error correction, demanding millions of physical qubits and prolonged error-free operation [1,2,31,32].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [31]
The gap between required secrecy lifetime and the adversary's horizon is shrinking as advances in quantum computation reduce the time needed to break cryptosystems such as RSA and elliptic-curve cryptography.
“The gap between these two quantities is shrinking as advances in quantum computation reduce the time needed to break cryptosystems such as RSA and elliptic-curve cryptography [31,32].”
From Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition (2025) · cites this paper as [31]
Cites
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001) · Nature · doi:10.1038/414883a · Cited by 1,738 · see citing works
Self-citationExperimental issues in coherent quantum-state manipulation of trapped atomic ions
Wineland, D. J., Monroe, C., Itano, W. M., Leibfried, D., King, B. E., & Meekhof, D. M. (1998) · Journal of Research of the National Institute of Standards and Technology · doi:10.6028/jres.103.019 · Cited by 1,497 · see citing works
Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement
Lanyon, B. P., Weinhold, T. J., Langford, N. K., Barbieri, M., James, D. F. V., Gilchrist, A., & White, A. G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.250505 · Cited by 327 · see citing works
Parker, S., & Plenio, M. B. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.3049 · Cited by 130 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Trapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483 · see citing works
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031 · see citing works
Quantum optimization using variational algorithms on near-term quantum devices
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., et al. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab822 · Cited by 744 · see citing works
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646 · see citing works
Experimental comparison of two quantum computing architectures
Linke, N. M., Maslov, D., Roetteler, M., Debnath, S., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1618020114 · Cited by 508 · see citing works
A programmable qudit-based quantum processor
Chi, Y., Huang, J., Zhang, Z., Mao, J., Zhou, Z., Chen, X., Zhai, C., Bao, J., Dai, T., Yuan, H., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-28767-x · Cited by 273 · see citing works
Low-cost error mitigation by symmetry verification
Bonet-Monroig, X., Sagastizabal, R., Singh, M., & O'Brien, T. E. (2018) · Physical Review A · doi:10.1103/physreva.98.062339 · Cited by 250 · see citing works
Quantum computing for healthcare: a review
Ur Rasool, R., Ahmad, H. F., Rafique, W., Qayyum, A., Qadir, J., & Anwar, Z. (2023) · Future Internet · doi:10.3390/fi15030094 · Cited by 242 · see citing works
Shuttling-based trapped-ion quantum information processing
Kaushal, V., Lekitsch, B., Stahl, A., Hilder, J., Pijn, D., Schmiegelow, C., Bermudez, A., Müller, M., Schmidt-Kaler, F., & Poschinger, U. (2020) · AVS Quantum Science · doi:10.1116/1.5126186 · Cited by 141 · see citing works
Materials challenges for trapped-ion quantum computers
Brown, K. R., Chiaverini, J., Sage, J. M., & Häffner, H. (2021) · Nature Reviews Materials · doi:10.1038/s41578-021-00292-1 · Cited by 120 · see citing works
Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer
Dallaire-Demers, P.-L., Romero, J., Veis, L., Sim, S., & Aspuru-Guzik, A. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab3951 · Cited by 119 · see citing works
Quantum gate learning in qubit networks: Toffoli gate without time-dependent control
Banchi, L., Pancotti, N., & Bose, S. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.19 · Cited by 74 · see citing works
Noise analysis for high-fidelity quantum entangling gates in an anharmonic linear Paul trap
Wu, Y., Wang, S.-T., & Duan, L.-M. (2018) · Physical Review A · doi:10.1103/physreva.97.062325 · Cited by 69 · see citing works
Self-citationDemonstration of Fault-Tolerant Steane Quantum Error Correction
Postler, L., Butt, F., Pogorelov, I., Marciniak, C. D., Heußen, S., Blatt, R., Schindler, P., Rispler, M., Müller, M., & Monz, T. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030326 · Cited by 66 · see citing works
Self-citationSideband cooling of small ion Coulomb crystals in a Penning trap
Stutter, G., Hrmo, P., Jarlaud, V., Joshi, M. K., Goodwin, J. F., & Thompson, R. C. (2018) · Journal of Modern Optics · doi:10.1080/09500340.2017.1376719 · Cited by 21 · see citing works
Harvest-Now, Decrypt-Later: A Temporal Cybersecurity Risk in the Quantum Transition
Kagai, F., Branch, P., But, J., & Allen, R. (2025) · Telecom · doi:10.3390/telecom6040100 · Cited by 15 · see citing works
“…sector-specific forms L d , s or L ( s ) From a systems perspective, large-scale factoring of RSA-2048 on a fault-tolerant quantum computer requires deep logical circuits and extensive error correction, demanding millions of physical qubits and prolonged error-free operation [1,2,31,32].”
Optimization and implementation of a surface-electrode ion trap junction
Zhang, C., Mehta, K. K., & Home, J. P. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac7db6 · Cited by 10 · see citing works
Analysis of RSA and Shor’s algorithm for cryptography: A quantum perspective
Kute, S., Desai, C., & Jadhav, M. (2024) · AIP Conference Proceedings · doi:10.1063/5.0227773 · Cited by 5 · see citing works
- Authors
- Monz, T., Nigg, D., Martinez, E. A., Brandl, M. F., Schindler, P., Rines, R., Wang, S. X., Chuang, I. L., & Blatt, R.
- Affiliations
- Universität Innsbruck (AT)
- MIT-Harvard Center for Ultracold Atoms (US)
- Austrian Academy of Sciences (AT)
- Corresponding author
- Monz, Thomas
- ORCID
- Venue
- Science
- Published
- 2016-03-04
- Volume
- 351
- Issue
- 6277
- Pages
- 1068-1070
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1635919617
- Cited by
- 486
- References
- 4
- Citations by year
- 2026: 30 · 2025: 61 · 2024: 54 · 2023: 47 · 2022: 48 · 2021: 49 · 2020: 49 · 2019: 41 · 2018: 32 · 2017: 48 · 2016: 25 · 2015: 2
- FWCI
- 40.10
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Austrian Science Fund (FWF)
- Office of the Director of National Intelligence (ODNI)
- Intelligence Advanced Research Projects Activity (IARPA)
- Army Research Office (W911NF-10-1-0284)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- Shor's algorithm, quantum factoring, modular multiplication, ion trap quantum computer, qubits, quantum error correction, integer factorization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
