The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Quantum supremacy using a programmable superconducting processor
Open accessAbstract
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In typical cases, if noise overwhelms the circuit, the measured distribution will be uniform18 and the measured XEB will be 0.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [18]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As an illustration, a type of superconducting processor used for Google's quantum supremacy experiment had single-qubit and two-qubit gate errors of 0.1% and 0.3%, respectively [5].”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [5]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Recent advances in control and readout of quantum bits have underscored the spectacular promise of QIP [82,83].”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [82]
The cited source says what the claim attributes to it.
In the citing paper
“Quantum advantage was demonstrated against the best classical computers for the task of sampling the output of a pseudo-random quantum circuit.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Arute et al., 2019
The cited source says what the claim attributes to it.
In the citing paper
“Finally, using 3D [[8,3,2]] code blocks16,17, we realize computationally complex sampling circuits18 with up to 48 logical qubits entangled with hypercube connectivity19 with 228 logical two-qubit gates and 48 logical CCZ gates20.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [18]
The cited source says what the claim attributes to it.
In the citing paper
“We obtain an XEB of approximately 0.1 for 48 logical qubits and hundreds of nonlocal logical entangling gates, up to roughly an order of magnitude higher than previous physical qubit implementations of digital circuits of similar complexity18,48, showing the benefits of a logical encoding for this application.”
From Logical quantum processor based on reconfigurable atom arrays (2024) · cites this paper as [18]
The cited source says what the claim attributes to it.
In the citing paper
“The researchers have explained that their sycamore processor takes about 200s to compute. A similar job would take approximately 10,000years by a state-of-the-art classical supercomputer [5].”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [5]
The cited source says what the claim attributes to it.
In the citing paper
“In the year of 2019, researchers executed quantum supremacy successfully in a 53 qubit superconducting machine.”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [5]
The cited source says what the claim attributes to it.
In the citing paper
“RCS is a system-level benchmark assessing how effectively a quantum computer can generate computationally complex quantum states15.”
From A 98-qubit trapped-ion quantum computer with all-to-all connectivity (2026) · cites this paper as [15]
The cited source says what the claim attributes to it.
In the citing paper
“In either case, the quality of samples can be judged by statistical tests, with the linear cross-entropy test being a widely used standard15.”
From A 98-qubit trapped-ion quantum computer with all-to-all connectivity (2026) · cites this paper as [15]
The cited source says what the claim attributes to it.
In the citing paper
“Existing quantum devices contain on the order of 100 physical qubits.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Arute et al., 2019
The cited source says what the claim attributes to it.
In the citing paper
“The recent development of quantum computing, which uses entanglement, superposition, and other quantum fundamental concepts, can provide substantial processing advantages over traditional computing.”
From Quantum Computing: Vision and Challenges (2025) · cites this paper as [4]
In the citing paper
“Error correction requires thousands of physical qubits for each logical qubit [91], resulting in millions of qubits for calculating the FeMoco ground state energy [45, 46].”
From Drug design on quantum computers (2024) · cites this paper as [45]
In the citing paper
“However, in the near term, this tradeoff is a happy one as many NISQ architectures—most notably superconducting qubit devices—can easily and rapidly repeat executions of a quantum circuit.”
From Training deep quantum neural networks (2020) · cites this paper as [46]
In the citing paper
“For example, the recently reported experiment involving the “Sycamore” quantum computer executed one instance of a quantum circuit a million times in 200 s46.”
From Training deep quantum neural networks (2020) · cites this paper as [46]
In the citing paper
“For comparison, the recent work on quantum supremacy by Google reported fidelities of 0.1% for single-qubit gates and 0.3% for two-qubit gates in a superconducting processor [20].”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [20]
In the citing paper
“Given that the current record for a controllable, programmable quantum processor is 53 qubits [20], there is still a long way to go.”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [20]
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Self-citationScheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics
Wallraff, A., Schuster, D. I., Blais, A., Frunzio, L., Huang, R. S., Majer, J., Kumar, S., Girvin, S. M., & Schoelkopf, R. J. (2004) · Nature · doi:10.1038/nature02851 · Cited by 3,796
Charge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Self-citationBarren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Self-citation
Research works printed but not linked: 3
- Farhi, E. & Neven, H. Classification with quantum neural networks on near term processors. Preprint at https://arxiv.org/abs/1802.06002 (2018). · arXiv
- Cross, A. W., Magesan, E., Bishop, L. S., Smolin, J. A. & Gambetta, J. M. Scalable randomised benchmarking of non-Clifford gates. npj Quant. Inform. 2, 16012 (2016).
- Villalonga, B. et al. A flexible high-performance simulator for the verification and benchmarking of quantum circuits implemented on real hardware. npj Quant. Inform. (in the press); preprint at https://arxiv.org/abs/1811.09599 (2018). · arXiv
Cited by
Sorted by citations
Items 1,001–1,052 of 1,052
A 40-nm Cryo-CMOS Quantum Controller IC for Superconducting Qubit
Kang, K., Minn, D., Bae, S., Lee, J., Kang, S., Lee, M., Song, H.-J., & Sim, J. (2022) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2022.3198663 · Cited by 46
Error Propagation in NISQ Devices for Solving Classical Optimization Problems
González-García, G., Trivedi, R., & Cirac, J. I. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040326 · Cited by 58
Quinton, F. A., Myhr, P. A. S., Barani, M., Crespo del Granado, P., & Zhang, H. (2025) · Scientific Reports · doi:10.1038/s41598-025-96220-2 · Cited by 46
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“Quantum computers mark a paradigm shift to tackle challenging tasks that classical computers cannot solve in a practical timescale 1,2 .”
Path toward manufacturable superconducting qubits with relaxation times exceeding 0.1 ms
Verjauw, J., Acharya, R., Van Damme, J., Ivanov, T., Lozano, D. P., Mohiyaddin, F. A., Wan, D., Jussot, J., Vadiraj, A. M., Mongillo, M., et al. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00600-9 · Cited by 45
Quantum Approximation for Wireless Scheduling
Choi, J., Oh, S., & Kim, J. (2020) · Applied Sciences · doi:10.3390/app10207116 · Cited by 44
Toward the institutionalization of quantum computing in pharmaceutical research
Zinner, M., Dahlhausen, F., Boehme, P., Ehlers, J., Bieske, L., & Fehring, L. (2022) · Drug Discovery Today · doi:10.1016/j.drudis.2021.10.006 · Cited by 43
Two-dimensional quantum walks of correlated photons
Jiao, Z.-Q., Gao, J., Zhou, W.-H., Wang, X.-W., Ren, R.-J., Xu, X.-Y., Qiao, L.-F., Wang, Y., & Jin, X.-M. (2021) · Optica · doi:10.1364/optica.425879 · Cited by 43
Streif, M., Yarkoni, S., Skolik, A., Neukart, F., & Leib, M. (2021) · Physical Review A · doi:10.1103/physreva.104.012403 · Cited by 41
Quantum adiabatic algorithm design using reinforcement learning
Lin, J., Lai, Z. Y., & Li, X. (2020) · Physical Review A · doi:10.1103/physreva.101.052327 · Cited by 39
Exploiting Symmetry Reduces the Cost of Training QAOA
Shaydulin, R., & Wild, S. M. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3066275 · Cited by 39
Generalized Quantum Assisted Simulator
Haug, T., & Bharti, K. (2020) · arXiv · doi:10.48550/arxiv.2011.14737 · Cited by 38
Quantum Computing: Vision and Challenges
Gill, S. S., Cetinkaya, O., Marrone, S., Claudino, D., Haunschild, D., Schlote, L., Wu, H., Ottaviani, C., Liu, X., Machupalli, S. P., et al. (2025) · Quantum Computing · doi:10.1016/b978-0-443-29096-1.00008-8 · Cited by 44
Montañez-Barrera, J. A., & Michielsen, K. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01082-1 · Cited by 34
Self-citationRNA folding using quantum computers
Fox, D. M., MacDermaid, C. M., Schreij, A. M. A., Zwierzyna, M., & Walker, R. C. (2022) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1010032 · Cited by 33
Controlling long ion strings for quantum simulation and precision measurements
Kranzl, F., Joshi, M. K., Maier, C., Brydges, T., Franke, J., Blatt, R., & Roos, C. F. (2022) · Physical Review A · doi:10.1103/physreva.105.052426 · Cited by 32
Castaldo, D., Rosa, M., & Corni, S. (2020) · arXiv · doi:10.48550/arxiv.2007.00368 · Cited by 32
High- E J / E C transmon qudits with up to 12 levels
Wang, Z., Parker, R. W., Champion, E., & Blok, M. S. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034046 · Cited by 29
Mermin's inequalities of multiple qubits with orthogonal measurements on IBM Q 53‐qubit system
Huang, W., Chien, W., Cho, C., Huang, C., Huang, T., & Chang, C. (2020) · Quantum Engineering · doi:10.1002/que2.45 · Cited by 32
Self-citationLong-time simulations with high fidelity on quantum hardware
Gibbs, J., Gili, K., Holmes, Z., Commeau, B., Arrasmith, A., Cincio, L., Coles, P. J., & Sornborger, A. (2021) · arXiv · doi:10.48550/arxiv.2102.04313 · Cited by 28
Bell Sampling from Quantum Circuits
Hangleiter, D., & Gullans, M. J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.020601 · Cited by 28
Error mitigation with Clifford quantum-circuit data
Czarnik, P., Arrasmith, A., Coles, P. J., & Cincio, L. (2021) · Quantum · doi:10.22331/q-2021-11-26-592 · Cited by 27
A review of Quantum Neural Networks: Methods, Models, Dilemma
Zhao, R., & Wang, S. (2021) · arXiv · doi:10.48550/arxiv.2109.01840 · Cited by 26
Enhanced connectivity of quantum hardware with digital-analog control
Galicia, A., Ramon, B., Solano, E., & Sanz, M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033103 · Cited by 22
Continuous and time-domain coherent signal conversion between optical and microwave frequencies
Peairs, G. A., Chou, M.-H., Bienfait, A., Chang, H.-S., Conner, C. R., Dumur, É., Grebel, J., Povey, R. G., Şahin, E., Satzinger, K. J., et al. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.061001 · Cited by 21
Self-citationWan, D., Couet, S., Piao, X., Souriau, L., Canvel, Y., Tsvetanova, D., Vangoidsenhoven, D., Thiam, A., Pacco, A., Potočnik, A., et al. (2021) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/abe5bb · Cited by 20
Dominant Reaction Pathways by Quantum Computing
Hauke, P., Mattiotti, G., & Faccioli, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.028104 · Cited by 20
Quantum Safe Lightweight Cryptography with Quantum Permutation Pad
Kuang, R., Lou, D., He, A., & Conlon, A. (2021) · 2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS) · doi:10.1109/icccs52626.2021.9449247 · Cited by 21
Codar: A Contextual Duration-Aware Qubit Mapping for Various NISQ Devices
Deng, H., Zhang, Y., & Li, Q. (2020) · 2020 57th ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18072.2020.9218561 · Cited by 23
Energy-Efficient Cluster Head Selection via Quantum Approximate Optimization
Choi, J., Oh, S., & Kim, J. (2020) · Electronics · doi:10.3390/electronics9101669 · Cited by 20
Error mitigation on a near-term quantum photonic device
Su, D., Israel, R., Sharma, K., Qi, H., Dhand, I., & Brádler, K. (2021) · Quantum · doi:10.22331/q-2021-05-04-452 · Cited by 19
A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks
Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3326469 · Cited by 20
QED driven QAOA for network-flow optimization
Zhang, Y., Zhang, R., & Potter, A. C. (2021) · Quantum · doi:10.22331/q-2021-07-27-510 · Cited by 19
He, T., Lin, W., Wang, R., Li, Y., Bei, J., Cai, J., Cao, S., Chen, D., Chen, K., Chen, X., et al. (2025) · Physical Review Letters · doi:10.1103/rqkg-dw31 · Cited by 14
Self-citationIndividual qubit addressing of rotating ion crystals in a Penning trap
Polloreno, A. M., Rey, A. M., & Bollinger, J. J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033076 · Cited by 11
Toward a quantum future for South Africa
Forbes, A., Petruccione, F., & Roux, F. S. (2021) · AVS Quantum Science · doi:10.1116/5.0060426 · Cited by 10
Ising model formulation for highly accurate topological color codes decoding
Takada, Y., Takeuchi, Y., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013092 · Cited by 10
Vykhodets, R. S. (2022) · EURASIAN INTEGRATION: economics, law, politics · doi:10.22394/2073-2929-2022-02-140-147 · Cited by 9
A 98-qubit trapped-ion quantum computer with all-to-all connectivity
Ransford, A., Allman, M. S., Arkinstall, J., Campora, J. P., Cooper, S. F., Delaney, R. D., Dreiling, J. M., Estey, B., Figgatt, C., Hall, A., et al. (2026) · Nature · doi:10.1038/s41586-026-10676-4 · Cited by 16
“RCS is a system-level benchmark assessing how effectively a quantum computer can generate computationally complex quantum states 15 .”
Quantum Secure Lightweight Cryptography with Quantum Permutation Pad
Kuang, R., Lou, D., He, A., & Conlon, A. (2021) · Advances in Science, Technology and Engineering Systems Journal · doi:10.25046/aj060445 · Cited by 7
Fault-tolerant quantum speedup from constant depth quantum circuits
Mezher, R., Ghalbouni, J., Dgheim, J., & Markham, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033444 · Cited by 8
Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
Rajakumar, J., Watson, J. D., & Liu, Y.-K. (2025) · Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611978322.30 · Cited by 7
Sengupta, K., Dinesh, S. P., Shafi, K. M., Asokan, S., & Chandrashekar, C. M. (2025) · Physical Review Applied · doi:10.1103/r7yp-1vz4 · Cited by 7
2022 Roadmap on integrated quantum photonics
Moody, G., Sorger, V. J., Blumenthal, D. J., Juodawlkis, P. W., Loh, W., Sorace-Agaskar, C., Jones, A. E., Balram, K. C., Matthews, J. C. F., Laing, A., et al. (2022) · Journal of Physics: Photonics · doi:10.1088/2515-7647/ac1ef4 · Cited by 6
Raw QPP-RNG randomness via system jitter across platforms: a NIST SP 800-90B evaluation
Vrana, G., Lou, D., & Kuang, R. (2025) · Scientific Reports · doi:10.1038/s41598-025-13135-8 · Cited by 8
Deterministic multi-mode gates on a scalable photonic quantum computing platform
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · Nature Physics · doi:10.1038/s41567-021-01296-y · Cited by 4
Quantum technology master’s: a shortcut to the quantum industry?
Goorney, S., Muñoz, B., & Sherson, J. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00299-x · Cited by 3
A 2-12GHz SiGe BiCMOS Cryogenic LNA with 6K Noise Temperature and 1.3mW DC Power
Wu, R., & Wang, C. (2023) · 2023 IEEE MTT-S International Microwave Workshop Series on Advanced Materials and Processes for RF and THz Applications (IMWS-AMP) · doi:10.1109/imws-amp57814.2023.10381379 · Cited by 3
Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030345 · Cited by 2
Partial randomized benchmarking
Dubovitskii, K., & Makhlin, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-13813-x · Cited by 1
Towards violations of Local Friendliness with quantum computers
Zeng, W. J., Labib, F., & Russo, V. (2025) · Quantum · doi:10.22331/q-2025-09-05-1851
“The measurements from the validation runs can be verified using cross-entropy benchmarking following [55].”
Evidence of scaling advantage on an NP-complete problem with enhanced quantum solvers
Lu, Q., Wei, S., Li, K., Gao, P., Yan, B., Zheng, M., Zhang, H., Zeng, J., & Long, G.-L. (2026) · Nature Computational Science · doi:10.1038/s43588-026-01007-8 · Cited by 1
“…algorithm (QAOA) 1 and the variational quantum eigensolver (VQE) 2 , are promising candidates for achieving quantum advantage in the noisy intermediate-scale quantum (NISQ) era 3 , which is characterized by limited qubit counts 4–6 and the absence of effective error correction mechanisms 7–10 .”
Metadata
- Authors
- Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., Burkett, B., Chen, Y., Chen, Z., Chiaro, B., Collins, R., Courtney, W., Dunsworth, A., Farhi, E., Foxen, B., Fowler, A., Gidney, C., Giustina, M., Graff, R., Guerin, K., Habegger, S., Harrigan, M. P., Hartmann, M. J., Ho, A., Hoffmann, M., Huang, T., Humble, T. S., Isakov, S. V., Jeffrey, E., Jiang, Z., Kafri, D., Kechedzhi, K., Kelly, J., Klimov, P. V., Knysh, S., Korotkov, A., Kostritsa, F., Landhuis, D., Lindmark, M., Lucero, E., Lyakh, D., Mandrà, S., McClean, J. R., McEwen, M., Megrant, A., Mi, X., Michielsen, K., Mohseni, M., Mutus, J., Naaman, O., Neeley, M., Neill, C., Niu, M. Y., Ostby, E., Petukhov, A., Platt, J. C., Quintana, C., Rieffel, E. G., Roushan, P., Rubin, N. C., Sank, D., Satzinger, K. J., Smelyanskiy, V., Sung, K. J., Trevithick, M. D., Vainsencher, A., Villalonga, B., White, T., Yao, Z. J., Yeh, P., Zalcman, A., Neven, H., & Martinis, J. M.
- Affiliations
- Google (United States) (US)
- Ames Research Center (US)
- University of California, Santa Barbara (US)
- Oak Ridge National Laboratory (US)
- University of California, Riverside (US)
- Forschungszentrum Jülich (DE)
- Corresponding author
- Martinis, John M.
- ORCID
- Venue
- Nature
- Published
- 2019-10-23
- Volume
- 574
- Issue
- 7779
- Pages
- 505-510
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2982169647
- Cited by
- 7,720
- References
- 51
- Citations by year
- 2026: 701 · 2025: 1157 · 2024: 1143 · 2023: 1234 · 2022: 1230 · 2021: 1315 · 2020: 875 · 2019: 60
- FWCI
- 397.23
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Nature (publishedVersion, other-oa)
- arXiv (Cornell University) (publishedVersion)
- PubMed (publishedVersion)
- Comillas Repository (Comillas Pontifical University) (publishedVersion, cc-by-nc-nd)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- RWTH Publications (RWTH Aachen) (submittedVersion)
- Funders
- U.S. Department of Energy (AC05-00OR22725, DE--AC05--00OR22725, DE-AC05?, Contract DE-AC05-00OR22725, 00OR22725)
- National Aeronautics and Space Administration (DE-AC05-00OR22725)
- Office of Science (DEAC05- 00OR22725, AC05-00OR22725)
- Ames Research Center
- University of California, Santa Barbara
- Air Force Research Laboratory (F4HBKC4162G001, DE-AC05-00OR22725)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum advantage, superconducting qubits, classical simulation of quantum circuits, programmable quantum processors, quantum computing
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
