Oversimplifying quantum factoring
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Shor’s quantum factoring algorithm exponentially outperforms known classical methods. Previous experimental implementations have used simplifications dependent on knowing the factors in advance. However, as we show here, all composite numbers admit simplification of the algorithm to a circuit equivalent to flipping coins. The difficulty of a particular experiment therefore depends on the level of simplification chosen, not the size of the number factored. Valid implementations should not make use of the answer sought.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
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
Shor’s Quantum Factoring Algorithm on a Photonic Chip
Politi, A., Matthews, J. C. F., & O'Brien, J. L. (2009) · Science · doi:10.1126/science.1173731 · Cited by 477
Semiclassical Fourier Transform for Quantum Computation
Griffiths, R. B., & Niu, C.-S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3228 · Cited by 431
Experimental realization of Shor's quantum factoring algorithm using qubit recycling
Martín-López, E., Laing, A., Lawson, T., Alvarez, R., Zhou, X.-Q., & O'Brien, J. L. (2012) · Nature Photonics · doi:10.1038/nphoton.2012.259 · Cited by 349
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 · cited 1×
“(6) Measure the first register to obtain classical result y.”
BackgroundComputing prime factors with a Josephson phase qubit quantum processor
Lucero, E., Barends, R., Chen, Y., Kelly, J., Mariantoni, M., Megrant, A., O’Malley, P., Sank, D., Vainsencher, A., Wenner, J., et al. (2012) · Nature Physics · doi:10.1038/nphys2385 · Cited by 311 · cited 1×
“While still far off, there have already been several small-scale demonstrations of Shor’s algorithm 2–7 .”
Background(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49208-9 · Cited by 185
Efficient Factorization with a Single Pure Qubit andlogNMixed Qubits
Parker, S., & Plenio, M. B. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.3049 · Cited by 130
Shor's algorithm with fewer (pure) qubits
Zalka, C. (2006) · arXiv · doi:10.48550/arxiv.quant-ph/0601097 · Cited by 20
Cited by
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
“orbitals [74]. As each spin orbital corresponds to a qubit in 5Although note that one has to be careful when using \problem size" as a proxy for \diculty in solving on a quantum computer" [90]. 10 Algorithm Technology Problem solved Shor’s algorithm Integrated optics [68] Factorisation of 21 Grover’s algorit…”
Scalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Cybersecurity in an Era with Quantum Computers: Will We Be Ready?
Mosca, M. (2018) · IEEE Security & Privacy · doi:10.1109/msp.2018.3761723 · Cited by 581
Realization of a scalable Shor algorithm
Monz, T., Nigg, D., Martinez, E. A., Brandl, M. F., Schindler, P., Rines, R., Wang, S. X., Chuang, I. L., & Blatt, R. (2016) · Science · doi:10.1126/science.aad9480 · Cited by 486
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · doi:10.1093/oso/9780198782995.001.0001 · Cited by 326
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
Analysis of circuit imperfections in BosonSampling
Leverrier, A., & Garcia-Patron, R. (2015) · Quantum Information and Computation · doi:10.26421/qic15.5-6-8 · Cited by 17
Metadata
- Authors
- Smolin, J. A., Smith, G., & Vargo, A.
- Venue
- Nature
- Published
- 2013-07
- Volume
- 499
- Issue
- 7457
- Pages
- 163-165
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1983468898
- Cited by
- 127
- References
- 9
- FWCI
- 6.63
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.