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.
At a glance
- Simulating physics with computers. Int. J. Theor. Phys. 21, 467–488 (1982)
- Simulated quantum computation of molecular energies. Science 309, 1704–1707 (2005) , , &
- http://arxiv.org/abs/quant-ph/0001106 (2000) , , & Quantum computation by adiabatic evolution. Preprint at
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 472–475 (2001) et al.
- Statistical Physics of Spin Glasses and Information Processing: An Introduction (Oxford Univ. Press, 2001)
- Universal quantum simulators. Science 273, 1073–1078 (1996)
- http://arxiv.org/abs/quant-ph/9811052 (1998) & Quantum codes on a lattice with boundary. Preprint at
- Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012) , , &
- Experimental implementation of an adiabatic quantum optimization algorithm. Phys. Rev. Lett. 90, 067903 (2003) et al.
- Universal digital quantum simulation with trapped ions. Science 334, 57–61 (2011) et al.
- Digital quantum simulation of fermionic models with a superconducting circuit. Nat. Commun. 6, 7654 (2015) et al.
- Digital quantum simulation of spin models with circuit quantum electrodynamics. Phys. Rev. X 5, 021027 (2015) et al.
- The complexity of stoquastic local Hamiltonian problems. Quantum Inf. Comput. 8, 361–385 (2008) , , &
- Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev. 50, 755–787 (2008) et al.
- Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions. New J. Phys. 18, 023042 (2016) &
- http://arxiv.org/abs/1401.7320 (2014) , , , & Different strategies for optimization using the quantum adiabatic algorithm. Preprint at
- Adiabatic quantum simulation of quantum chemistry. Sci. Rep. 4, 6603 (2014) , &
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations. Phys. Rev. Lett. 94, 170201 (2005) &
- Computational multiqubit tunnelling in programmable quantum annealers. Nat. Commun. 7, 10327 (2016) et al.
- Fermionic quantum computation. Ann. Phys. 298, 210–226 (2002) &
- The Bravyi–Kitaev transformation for quantum computation of electronic structure. J. Chem. Phys. 137, 224109 (2012) , &
- Coherent Josephson qubit suitable for scalable quantum integrated circuits. Phys. Rev. Lett. 111, 080502 (2013) et al.
- State preservation by repetitive error detection in a superconducting quantum circuit. Nature 519, 66–69 (2015) et al.
- Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations. Phys. Lett. A 146, 319–323 (1990)
- Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508, 500–503 (2014) et al.
- Some implications of a cosmological phase transition. Phys. Rep. 67, 183–199 (1980)
- Cosmological experiments in superfluid helium? Nature 317, 505–508 (1985)
- Higher order decompositions of ordered operator exponentials. J. Phys. A 43, 065203 (2010) , , &
- Simulating Hamiltonian dynamics with a truncated Taylor series. Phys. Rev. Lett. 114, 090502 (2015) , , , &
- Supplementary Information (2.8 MB)
This fie contains Supplementary Text and Data, Supplementary Figures 1-10, Supplementary Tables 1-10 and additional references.