Digitized adiabatic quantum computing with a superconducting circuit
Open accessThe DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Abstract
A digitized approach to adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the digital method, is implemented using a superconducting circuit to find the ground states of arbitrary Hamiltonians. Adiabatic quantum computers are analogue machines that, with the help of quantum tunnelling, slowly evolve from a simple input to the desired, more complicated output. Although adiabiatic quantum computers can be very fast at specific tasks, they are limited by noise and errors that cannot be corrected during the computation. In contrast, universal quantum computers are digital devices that use logic gates and allow for error correction. Here, Rami Barends et al. combine the advantages of adiabiatic and universal quantum computers by digitizing an adiabiatic quantum computation. This approach allows for encoding non-stoquastic Hamiltonians, which are crucial for simulating physical and chemical systems with interacting fermions. Quantum mechanics can help to solve complex problems in physics1 and chemistry2, provided they can be programmed in a physical device. In adiabatic quantum computing3,4,5, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing6, which enables the construction of arbitrary interactions and is compatible with error correction7,8, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation9,10,11,12 of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.
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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“A complementary approach is digital quantum computing, where logic gates combine to form quantum circuit algorithms [7].”
BackgroundSurface 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-citationIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282 · cited 1×
“We use the Trotter expansion to digitize [25], the evolution is divided into many steps in time, each of which is implemented using a construction of quantum gates, see Supplementary Information.”
MethodA Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Cosmological experiments in superfluid helium?
Zurek, W. H. (1985) · Nature · doi:10.1038/317505a0 · Cited by 1,894
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Self-citationSome implications of a cosmological phase transition
Kibble, T. W. B. (1980) · Physics Reports · doi:10.1016/0370-1573(80)90091-5 · Cited by 1,465
Simulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Classical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations
Troyer, M., & Wiese, U.-J. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.170201 · Cited by 1,246
Statistical Physics of Spin Glasses and Information Processing: An Introduction
Nishimori, H. (2001) · doi:10.1093/acprof:oso/9780198509417.001.0001 · Cited by 1,182
Learning and relearning in Boltzmann machines
Hinton, G. E., & Sejnowski, T. J. (2001) · Graphical Models · doi:10.7551/mitpress/3349.003.0005 · Cited by 1,037
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
State preservation by repetitive error detection in a superconducting quantum circuit
Kelly, J., Barends, R., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., Campbell, B., Chen, Y., et al. (2015) · Nature · doi:10.1038/nature14270 · Cited by 916
Self-citationSuzuki, M. (1990) · Physics Letters A · doi:10.1016/0375-9601(90)90962-n · Cited by 853
Dynamics of a Quantum Phase Transition
Zurek, W. H., Dorner, U., & Zoller, P. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.105701 · Cited by 808
Coherent Josephson Qubit Suitable for Scalable Quantum Integrated Circuits
Barends, R., Kelly, J., Megrant, A., Sank, D., Jeffrey, E., Chen, Y., Yin, Y., Chiaro, B., Mutus, J., Neill, C., et al. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.080502 · Cited by 779 · cited 1×
“As quantum hardware improves, the implementation of near-optimal schemes such as this becomes increasingly viable.”
BackgroundSelf-citationSimulating Hamiltonian Dynamics with a Truncated Taylor Series
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090502 · Cited by 742 · cited 2×
“…has been shown to exponentially outperform Trotterization in terms of (cid:15) , scale linearly with T (up to logarithmic factors), which implies a quadratic reduction in γ − 1 , and scale much better with the number of terms for real world applications such as the simulation of chemistry [32, 33].”
BackgroundMethodSimulating Physics with Computers
Feynman, R. P. (2018) · Feynman and Computation · doi:10.1201/9780429500459-11 · Cited by 731
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704445226 · Cited by 648
Statistical physics of spin glasses and information processing : an introduction
Nishimori, H. (2001) · Cited by 617
Universal Digital Quantum Simulation with Trapped Ions
Lanyon, B. P., Hempel, C., Nigg, D., Müller, M., Gerritsma, R., Zähringer, F., Schindler, P., Barreiro, J. T., Rambach, M., Kirchmair, G., et al. (2011) · Science · doi:10.1126/science.1208001 · Cited by 613
The Bravyi-Kitaev transformation for quantum computation of electronic structure
Seeley, J. T., Richard, M. J., & Love, P. J. (2012) · The Journal of Chemical Physics · doi:10.1063/1.4768229 · Cited by 585
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · cited 1×
“In adiabatic quantum computing [4–6], the system is slowly evolved from the ground state of a simple initial Hamiltonian to a fi-nal Hamiltonian that encodes a computational problem.”
BackgroundAdiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Digital quantum simulation of fermionic models with a superconducting circuit
Barends, R., Lamata, L., Kelly, J., García-Álvarez, L., Fowler, A. G., Megrant, A., Jeffrey, E., White, T. C., Sank, D., Mutus, J. Y., et al. (2015) · Nature Communications · doi:10.1038/ncomms8654 · Cited by 338
Self-citationQuantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space
Poulin, D., Qarry, A., Somma, R., & Verstraete, F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.170501 · Cited by 265 · cited 2×
“[30] N.”
MethodDigital Quantum Simulation of Spin Models with Circuit Quantum Electrodynamics
Salathé, Y., Mondal, M., Oppliger, M., Heinsoo, J., Kurpiers, P., Potočnik, A., Mezzacapo, A., Las Heras, U., Lamata, L., Solano, E., et al. (2015) · Physical Review X · doi:10.1103/physrevx.5.021027 · Cited by 247
Self-citationComputational multiqubit tunnelling in programmable quantum annealers
Boixo, S., Smelyanskiy, V. N., Shabani, A., Isakov, S. V., Dykman, M., Denchev, V. S., Amin, M. H., Smirnov, A. Y., Mohseni, M., & Neven, H. (2016) · Nature Communications · doi:10.1038/ncomms10327 · Cited by 233
Self-citationSimple Proof of Equivalence between Adiabatic Quantum Computation and the Circuit Model
Mizel, A., Lidar, D. A., & Mitchell, M. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.070502 · Cited by 217
Higher order decompositions of ordered operator exponentials
Wiebe, N., Berry, D., Høyer, P., & Sanders, B. C. (2010) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/43/6/065203 · Cited by 208 · cited 2×
“S1 [28], In [29, 30], it is shown that such an evolution can be simulated with error (cid:15) by choosing M = T 2 a 2 max L 2 /(cid:15) where a max = max (cid:96),t { a (cid:96) ( t ) } .”
BackgroundMethodHow Powerful is Adiabatic Quantum Computation
van Dam, W., Mosca, M., & Vazirani, U. V. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 204
Adiabatic Quantum Simulation of Quantum Chemistry
Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · Scientific Reports · doi:10.1038/srep06603 · Cited by 191
Self-citationExperimental Implementation of an Adiabatic Quantum Optimization Algorithm
Steffen, M., van Dam, W., Hogg, T., Breyta, G., & Chuang, I. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.067903 · Cited by 183
Realizable Hamiltonians for universal adiabatic quantum computers
Biamonte, J. D., & Love, P. J. (2008) · Physical Review A · doi:10.1103/physreva.78.012352 · Cited by 173
Complexity Classification of Local Hamiltonian Problems
Cubitt, T. S., & Montanaro, A. (2016) · SIAM Journal on Computing · doi:10.1137/140998287 · Cited by 173
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.8 · Cited by 159
Quantum Annealing and Related Optimization Methods
Das, A., & Chakrabarti, B. K. (2008) · Cited by 142
The complexity of stoquastic local Hamiltonian problems
Bravyi, S. B., Divincenzo, D. P., Oliveira, R. I., & Terhal, B. M. (2008) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2011772.2011773 · Cited by 135
Exponentially more precise quantum simulation of fermions in second quantization
Babbush, R., Berry, D. W., Kivlichan, I. D., Wei, A. Y., Love, P. J., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/3/033032 · Cited by 135
Self-citationImproving quantum algorithms for quantum chemistry
Hastings, M. B., Wecker, D., Bauer, B., & Troyer, M. (2015) · Quantum Information and Computation · doi:10.26421/qic15.1-2-1 · Cited by 128
Quantum Annealing and Related Optimization Methods 679
Chakrabarti, B. K., & Das, A. (2005) · Cited by 104
Qubit Metrology of Ultralow Phase Noise Using Randomized Benchmarking
O’Malley, P. J. J., Kelly, J., Barends, R., Campbell, B., Chen, Y., Chen, Z., Chiaro, B., Dunsworth, A., Fowler, A. G., Hoi, I.-C., et al. (2015) · Physical Review Applied · doi:10.1103/physrevapplied.3.044009 · Cited by 90
Self-citationThe complexity of stoquastic local Hamiltonian problems
Bravyi, S., DiVincenzo, D. P., Oliveira, R., & Terhal, B. M. (2008) · Quantum Information and Computation · doi:10.26421/qic8.5-1 · Cited by 80
Product formula methods for time-dependent Schrodinger problems
Huyghebaert, J., & Raedt, H. D. (1990) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/23/24/019 · Cited by 75
Ramsey Numbers and Adiabatic Quantum Computing
Gaitan, F., & Clark, L. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.010501 · Cited by 69
Training a Binary Classifier with the Quantum Adiabatic Algorithm
Neven, H., Denchev, V. S., Rose, G., & Macready, W. G. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.0416 · Cited by 68
Self-citationDifferent Strategies for Optimization Using the Quantum Adiabatic Algorithm
Crosson, E., Farhi, E., Lin, C. Y.-Y., Lin, H.-H., & Shor, P. W. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.7320 · Cited by 65
Role of single-qubit decoherence time in adiabatic quantum computation
Amin, M. H. S., Truncik, C. J. S., & Averin, D. V. (2009) · Physical Review A · doi:10.1103/physreva.80.022303 · Cited by 63
Complexity Classification of Local Hamiltonian Problems
Cubitt, T. S., & Montanaro, A. (2014) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.21 · Cited by 47
From local to global ground states in Ising spin glasses
Zintchenko, I., Hastings, M. B., & Troyer, M. (2015) · Physical Review B · doi:10.1103/physrevb.91.024201 · Cited by 37
Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions
Lloyd, S., & Terhal, B. M. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023042 · Cited by 37
Hamiltonian gadgets with reduced resource requirements
Cao, Y., Babbush, R., Biamonte, J., & Kais, S. (2015) · Physical Review A · doi:10.1103/physreva.91.012315 · Cited by 35 · cited 2×
“[21] J.”
BackgroundSelf-citationCooling dynamics of pure and random Ising chains
Suzuki, S. (2009) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2009/03/p03032 · Cited by 35
Comment on "Distinguishing Classical and Quantum Models for the D-Wave Device"Preprint
Shin, S. W., Smith, G., Smolin, J. A., & Vazirani, U. V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.6499 · Cited by 29
Dynamics of quantum adiabatic evolution algorithm for Number PartitioningPreprint
Smelyanskiy, V., von Toussaint, U., & Timuçin, D. A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0202155 · Cited by 25
Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions
Lloyd, S., & Terhal, B. M. (2016) · RWTH Publications (RWTH Aachen) · Cited by 23
Kibble-Zurek mechanism in simulated annealing and quantum annealing
Suzuki, S. (2011) · Journal of Physics Conference Series · doi:10.1088/1742-6596/302/1/012046 · Cited by 12
Babbush, R., Berry, D. W., Kivlichan, I., Wei, A. Y., Love, P. J., & Aspuru‐Guzik, A. (2015) · arXiv (Cornell University) · Cited by 8
Self-citationQuantum annealing of an infinite-range transverse-field Ising model
Caneva, T., Fazio, R., & Santoro, G. E. (2009) · Journal of Physics Conference Series · doi:10.1088/1742-6596/143/1/012004 · Cited by 5
Cited by
Superconducting Qubits: Current State of Play
Kjaergaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050605 · Cited by 1,544
Microwave photonics with superconducting quantum circuits
Gu, X., Kockum, A. F., Miranowicz, A., Liu, Y.-X., & Nori, F. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.002 · Cited by 1,307
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
“trapped ions [7, 57–59], and superconducting qubits [5, 6, 60, 61].”
BackgroundQuantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
An atom-by-atom assembler of defect-free arbitrary two-dimensional atomic arrays
Barredo, D., de Léséleuc, S., Lienhard, V., Lahaye, T., & Browaeys, A. (2016) · Science · doi:10.1126/science.aah3778 · Cited by 860
Metadata
- Authors
- Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., Chen, Z., Chiaro, B., Dunsworth, A., Jeffrey, E., Lucero, E., Megrant, A., Mutus, J. Y., Neeley, M., Neill, C., O’Malley, P. J. J., Quintana, C., Roushan, P., Sank, D., Vainsencher, A., Wenner, J., White, T. C., Solano, E., Neven, H., & Martinis, J. M.
- Venue
- Nature
- Published
- 2016-06-08
- Volume
- 534
- Issue
- 7606
- Pages
- 222-226
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2203542361
- Cited by
- 463
- References
- 64
- FWCI
- 54.22
- 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.