Adiabatic Quantum Simulation of Quantum Chemistry
Open accessThe DOI matches its Crossref record; 141 of the 141 references it cites were found in a registry or an index.
Abstract
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings. By combining the Bravyi-Kitaev construction to map fermions to qubits with perturbative gadgets to reduce the Hamiltonian to 2-body, we obtain precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size. Hence our mapping is efficient. The required set of controllable interactions includes only two types of interaction beyond the Ising interactions required to apply the quantum adiabatic algorithm to combinatorial optimization problems. Our mapping may also be of interest to chemists directly as it defines a dictionary from electronic structure to spin Hamiltonians with physical interactions.
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
Figures







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.
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?
In the citing paper
“In the past few years, several papers have proposed new quantum algorithms along with experimental demonstrations on quantum devices 387,388 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [387]
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
(1979) · Cited by 43,841
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 2×
“Quantum computers have been rigorously proved to provide an algorithmic advantage over the best known classical approaches2 for a small set of problems [40–42].”
BackgroundA 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-citationLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 2×
“[46] S.”
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597 · cited 1×
“Hamiltonian gadgets provide a method for embedding the eigenspectra (and sometimes eigenvectors) of an n-qubit ‘‘target’’ Hamiltonian, denoted by Htarget, in a restricted (typically lowenergy) subspace of a more constrained (N . n)-qubit ‘‘gadget’’ Hamiltonian, denoted by ~H.”
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
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 7×
“How to cite this article: Babbush, R., Love, P.J. & Aspuru-Guzik, A. Adiabatic Quantum Simulation of Quantum Chemistry.”
MethodInfluentialBernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Born, M., & Fock, V. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01343193 · Cited by 1,494
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
Self-citationOn the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
About the Pauli exclusion principle
Jordán, P., & Wigner, E. P. (1928) · Cited by 951
Quantum simulation of antiferromagnetic spin chains in an optical lattice
Simon, J., Bakr, W. S., Ma, R., Tai, M. E., Preiss, P. M., & Greiner, M. (2011) · Nature · doi:10.1038/nature09994 · Cited by 898
Weimer, H., Müller, M., Lesanovsky, I., Zoller, P., & Büchler, H. P. (2010) · Nature Physics · doi:10.1038/nphys1614 · Cited by 867 · cited 1×
“We represent these vectors as a tensor product of individual spin orbitals written as jfn21…f0æ where fj [ B indicates the occupation of spin orbital jxjæ.”
BackgroundExponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · cited 2×
“[41] A.”
BackgroundQuantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817 · cited 2×
“[50] D.”
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810 · cited 2×
“At present, optimized codes on classical hardware can find the ground state of many instances in comparable time to the D-Wave device [10].”
MethodTowards quantum chemistry on a quantum computer
Lanyon, B. P., Whitfield, J. D., Gillett, G. G., Goggin, M. E., Almeida, M. P., Kassal, I., Biamonte, J. D., Mohseni, M., Powell, B. J., Barbieri, M., et al. (2010) · Nature Chemistry · doi:10.1038/nchem.483 · Cited by 796
Self-citationSimulating Physics with Computers
Feynman, R. P. (2018) · Feynman and Computation · doi:10.1201/9780429500459-11 · Cited by 731
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
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
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Simulating a quantum magnet with trapped ions
Friedenauer, A., Schmitz, H., Glueckert, J. T., Porras, D., & Schaetz, T. (2008) · Nature Physics · doi:10.1038/nphys1032 · Cited by 602
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
Self-citationFrom quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556
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 13×
“How to cite this article: Babbush, R., Love, P.J. & Aspuru-Guzik, A. Adiabatic Quantum Simulation of Quantum Chemistry.”
BackgroundMethodInfluentialFrom Quantum Cellular Automata To Quantum Lattice Gases
Meyer, D., Qca, F., David, Q., & Meyer, A. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 488
Simulation of electronic structure Hamiltonians using quantum computers
Whitfield, J. D., Biamonte, J., & Aspuru-Guzik, A. (2011) · Molecular Physics · doi:10.1080/00268976.2011.552441 · Cited by 472 · cited 3×
“[70] J.”
BackgroundMethodSelf-citationPolynomial-time quantum algorithm for the simulation of chemical dynamics
Kassal, I., Jordan, S. P., Love, P. J., Mohseni, M., & Aspuru-Guzik, A. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808245105 · Cited by 385
Self-citationFinding low-energy conformations of lattice protein models by quantum annealing
Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., & Aspuru-Guzik, A. (2012) · Scientific Reports · doi:10.1038/srep00571 · Cited by 366 · cited 1×
“folding [11, 12] and machine learning [13, 14].”
Self-citationSimulating physical phenomena by quantum networks
Somma, R., Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2002) · Physical Review A · doi:10.1103/physreva.65.042323 · Cited by 365
The complexity of quantum spin systems on a two-dimensional square lattice
Oliveira, R. I., & Terhal, B. M. (2008) · Quantum Information and Computation · doi:10.26421/qic8.10-2 · Cited by 362
Simulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
Self-citationGate-count estimates for performing quantum chemistry on small quantum computers
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B., & Troyer, M. (2014) · Physical Review A · doi:10.1103/physreva.90.022305 · Cited by 296
NMR Implementation of a Molecular Hydrogen Quantum Simulation with Adiabatic State Preparation
Du, J., Xu, N., Peng, X., Wang, P., Wu, S., & Lu, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.030502 · Cited by 274
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R., Johnson, M. W., Lanting, T., Berkley, A. J., Johansson, J., Bunyk, P., Tolkacheva, E., Ladizinsky, E., Ladizinsky, N., Oh, T., et al. (2010) · Physical Review B · doi:10.1103/physrevb.82.024511 · Cited by 273
Schuch, N., & Verstraete, F. (2009) · Nature Physics · doi:10.1038/nphys1370 · Cited by 260
Quantum Simulation of a Lattice Schwinger Model in a Chain of Trapped Ions
Hauke, P., Marcos, D., Dalmonte, M., & Zoller, P. (2013) · Physical Review X · doi:10.1103/physrevx.3.041018 · Cited by 254
Thermally assisted quantum annealing of a 16-qubit problem
Dickson, N. G., Johnson, M. W., Amin, M. H., Harris, R., Altomare, F., Berkley, A. J., Bunyk, P., Cai, J., Chapple, E. M., Chavez, P., et al. (2013) · Nature Communications · doi:10.1038/ncomms2920 · Cited by 225
From transistor to trapped-ion computers for quantum chemistry
Yung, M.-H., Casanova, J., Mezzacapo, A., McClean, J., Lamata, L., Aspuru-Guzik, A., & Solano, E. (2014) · Scientific Reports · doi:10.1038/srep03589 · Cited by 221
Self-citationSimulation of Electronic Structure Hamiltonians Using Quantum Computers
Whitfield, J. D., Biamonte, J., & Aspuru‐Guzik, A. (2011) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 218
Self-citationHigher 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 1×
“The occupation number basis is formed from all possible configurations of n spin orbitals which are each either empty or occupied.”
BackgroundQuantum simulations with cold trapped ions
Johanning, M., Varón, A. F., & Wunderlich, C. (2009) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/0953-4075/42/15/154009 · Cited by 208
Error-corrected quantum annealing with hundreds of qubits
Pudenz, K. L., Albash, T., & Lidar, D. A. (2014) · Nature Communications · doi:10.1038/ncomms4243 · Cited by 198
Mapping local Hamiltonians of fermions to local Hamiltonians of spins
Verstraete, F., & Cirac, J. I. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09012 · Cited by 196 · cited 2×
“However, in that case it is possible to improve beyond the Bravyi-Kitaev mapping and exploit the locality of the interactions to directly obtain Hamiltonians whose locality is independent of the number of orbitals [93].”
BackgroundQuantum simulation of the wavefunction to probe frustrated Heisenberg spin systems
Ma, X.-S., Dakic, B., Naylor, W., Zeilinger, A., & Walther, P. (2011) · Nature Physics · doi:10.1038/nphys1919 · Cited by 179 · cited 1×
“We represent these vectors as a tensor product of individual spin orbitals written as jfn21…f0æ where fj [ B indicates the occupation of spin orbital jxjæ.”
BackgroundExperimental demonstration of a robust and scalable flux qubit
Harris, R., Johansson, J., Berkley, A. J., Johnson, M. W., Lanting, T., Han, S., Bunyk, P., Ladizinsky, E., Oh, T., Perminov, I., et al. (2010) · Physical Review B · doi:10.1103/physrevb.81.134510 · Cited by 177 · cited 2×
“The potential value of a positive answer to this conjecture has motivated a commercial effort to construct an adiabatic quantum computer [22–31].”
BackgroundRealizable 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
Self-citationThe Trotter step size required for accurate quantum simulation of quantum chemistry
Poulin, D., Hastings, M. B., Wecker, D., Wiebe, N., Doberty, A. C., & Troyer, M. (2015) · Quantum Information and Computation · doi:10.26421/qic15.5-6-1 · Cited by 159
Faster quantum chemistry simulation on fault-tolerant quantum computers
Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/115023 · Cited by 145
Self-citationThe complexity of quantum spin systems on a two-dimensional square lattice
Oliveira, R. I., & Terhal, B. M. (2008) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2016985.2016987 · Cited by 144
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
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 · doi:10.1145/780551.780552 · Cited by 134
Trapped-Ion Quantum Simulator: Experimental Application to Nonlinear Interferometers
Leibfried, D., DeMarco, B., Meyer, V., Rowe, M., Ben-Kish, A., Britton, J., Itano, W. M., Jelenković, B., Langer, C., Rosenband, T., et al. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.247901 · Cited by 133
Sign- and Magnitude-Tunable Coupler for Superconducting Flux Qubits
Harris, R., Berkley, A. J., Johnson, M. W., Bunyk, P., Govorkov, S., Thom, M. C., Uchaikin, S., Wilson, A. B., Chung, J., Holtham, E., et al. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.177001 · Cited by 128
Improving 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
Simulations of Many-Body Quantum Systems by a Quantum Computer
Wiesner, S. J. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9603028 · Cited by 127
Exploiting Locality in Quantum Computation for Quantum Chemistry
McClean, J. R., Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · The Journal of Physical Chemistry Letters · doi:10.1021/jz501649m · Cited by 125
Self-citationSimulating Ising spin glasses on a quantum computer
Lidar, D. A., & Biham, O. (1997) · Physical Review E · doi:10.1103/physreve.56.3661 · Cited by 120
Simulating quantum mechanics on a quantum computer
Boghosian, B. M., & Taylor, W. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00042-6 · Cited by 120
Farhi, E., Gosset, D., Hen, I., Sandvik, A. W., Shor, P., Young, A. P., & Zamponi, F. (2012) · Physical Review A · doi:10.1103/physreva.86.052334 · Cited by 118
Biamonte, J. D. (2008) · Physical Review A · doi:10.1103/physreva.77.052331 · Cited by 115
Efficient quantum circuits for diagonal unitaries without ancillas
Welch, J., Greenbaum, D., Mostame, S., & Aspuru-Guzik, A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033040 · Cited by 114
Self-citationEfficient Simulation of Quantum Systems by Quantum Computers
Zalka, C. (1998) · Fortschritte der Physik · doi:10.1002/(sici)1521-3978(199811)46:6/8<877::aid-prop877>3.0.co;2-a · Cited by 110
A scalable readout system for a superconducting adiabatic quantum optimization system
Berkley, A. J., Johnson, M. W., Bunyk, P., Harris, R., Johansson, J., Lanting, T., Ladizinsky, E., Tolkacheva, E., Amin, M. H. S., & Rose, G. (2010) · Superconductor Science and Technology · doi:10.1088/0953-2048/23/10/105014 · Cited by 110
Quantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru-Guzik, A., & Hoffmann, M. R. (2008) · Physical Chemistry Chemical Physics · doi:10.1039/b804804e · Cited by 109 · cited 1×
“Adiabatic Quantum Simulation [1, 28, 29] Quantum Phase Estimation Algorithm [64, 65, 68, 84, 85]; Experimental Realization [68, 86, 87]”
MethodSelf-citationAdiabatic Quantum Algorithm for Search Engine Ranking
Garnerone, S., Zanardi, P., & Lidar, D. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.230506 · Cited by 102 · cited 2×
“AQC has also been applied to structured and unstructured search [16, 17], and even search engine ranking [18] and artificial intelligence problems arising in space exploration [19].”
MethodSimulating Quantum Mechanics on a Quantum Computer
Boghosian, B. M., & Taylor, W. (1997) · Cited by 98
Experimental Determination of Ramsey Numbers
Bian, Z., Chudak, F., Macready, W. G., Clark, L., & Gaitan, F. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.130505 · Cited by 96
Compound Josephson-junction coupler for flux qubits with minimal crosstalk
Harris, R., Lanting, T., Berkley, A. J., Johansson, J., Johnson, M. W., Bunyk, P., Ladizinsky, E., Ladizinsky, N., Oh, T., & Han, S. (2009) · Physical Review B · doi:10.1103/physrevb.80.052506 · Cited by 95
Bravyi, S., DiVincenzo, D. P., Loss, D., & Terhal, B. M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.070503 · Cited by 93
Adiabatic quantum computing for random satisfiability problems
Hogg, T. (2003) · Physical Review A · doi:10.1103/physreva.67.022314 · Cited by 93
Perturbative gadgets at arbitrary orders
Jordan, S. P., & Farhi, E. (2008) · Physical Review A · doi:10.1103/physreva.77.062329 · Cited by 91
Mapping local Hamiltonians of fermions to local Hamiltonians of spins
Verstraete, F., & Cirac, J. I. (2005) · CaltechAUTHORS (California Institute of Technology) · Cited by 85
Adiabatic state preparation study of methylene
Veis, L., & Pittner, J. (2014) · The Journal of Chemical Physics · doi:10.1063/1.4880755 · Cited by 84
A Near-Term Quantum Computing Approach for Hard Computational Problems in Space ExplorationPreprint
Smelyanskiy, V., Rieffel, E. G., Knysh, S., Williams, C. P., Johnson, M. W., Thom, M. C., Macready, W. G., & Pudenz, K. L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.2821 · Cited by 83
The Complexity of the Local Hamiltonian Problem
Kempe, J., Kitaev, A., & Regev, O. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30538-5_31 · Cited by 82
Probing Noise in Flux Qubits via Macroscopic Resonant Tunneling
Harris, R., Johnson, M. W., Han, S., Berkley, A. J., Johansson, J., Bunyk, P., Ladizinsky, E., Govorkov, S., Thom, M. C., Uchaikin, S., et al. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.117003 · Cited by 81
The 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
Classical signature of quantum annealing
Smolin, J. A., & Smith, G. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00052 · Cited by 79
Quantum algorithm for obtaining the energy spectrum of molecular systems
Wang, H., Kais, S., Aspuru‐Guzik, A., & Hoffmann, M. R. (2008) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 75
Self-citationSimulation of Chemical Isomerization Reaction Dynamics on a NMR Quantum Simulator
Lu, D., Xu, N., Xu, R., Chen, H., Gong, J., Peng, X., & Du, J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.020501 · Cited by 73
Quantum-circuit design for efficient simulations of many-body quantum dynamics
Raeisi, S., Wiebe, N., & Sanders, B. C. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/10/103017 · Cited by 72 · cited 1×
“The occupation number basis is formed from all possible configurations of n spin orbitals which are each either empty or occupied.”
BackgroundRicherme, P., Senko, C., Smith, J., Lee, A., Korenblit, S., & Monroe, C. (2013) · Physical Review A · doi:10.1103/physreva.88.012334 · Cited by 71
Computational complexity in electronic structure
Whitfield, J. D., Love, P. J., & Aspuru-Guzik, A. (2013) · Phys. Chem. Chem. Phys. · doi:10.1039/c2cp42695a · Cited by 71 · cited 2×
“[84] J.”
BackgroundSelf-citationTraining 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
Geometrical dependence of the low-frequency noise in superconducting flux qubits
Lanting, T., Berkley, A. J., Bumble, B., Bunyk, P., Fung, A., Johansson, J., Kaul, A., Kleinsasser, A., Ladizinsky, E., Maibaum, F., et al. (2009) · Physical Review B · doi:10.1103/physrevb.79.060509 · Cited by 66
Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance
Li, Z., Yung, M.-H., Chen, H., Lu, D., Whitfield, J. D., Peng, X., Aspuru-Guzik, A., & Du, J. (2011) · Scientific Reports · doi:10.1038/srep00088 · Cited by 63 · cited 1×
“Adiabatic Quantum Simulation [1, 28, 29] Quantum Phase Estimation Algorithm [64, 65, 68, 84, 85]; Experimental Realization [68, 86, 87]”
MethodSelf-citationNew construction for a QMA complete three-local Hamiltonian
Nagaj, D., & Mozes, S. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2748377 · Cited by 62
Max 2-SAT with up to 108 qubits
Santra, S., Quiroz, G., Ver Steeg, G., & Lidar, D. A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/4/045006 · Cited by 60
Quantum computing applied to calculations of molecular energies: CH2 benchmark
Veis, L., & Pittner, J. (2010) · The Journal of Chemical Physics · doi:10.1063/1.3503767 · Cited by 60
Training a Large Scale Classifier with the Quantum Adiabatic Algorithm
Neven, H., Denchev, V. S., Rose, G., & Macready, W. G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.0779 · Cited by 58
Necessary condition for the quantum adiabatic approximation
Boixo, S., & Somma, R. D. (2010) · Physical Review A · doi:10.1103/physreva.81.032308 · Cited by 57
Biamonte, J. D., Bergholm, V., Whitfield, J. D., Fitzsimons, J., & Aspuru-Guzik, A. (2011) · AIP Advances · doi:10.1063/1.3598408 · Cited by 54
Self-citationPreparation of many-body states for quantum simulation
Ward, N. J., Kassal, I., & Aspuru-Guzik, A. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3115177 · Cited by 54 · cited 1×
“The occupation number basis is formed from all possible configurations of n spin orbitals which are each either empty or occupied.”
BackgroundSelf-citationProposal for Verification of the Haldane Phase Using Trapped Ions
Cohen, I., & Retzker, A. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.040503 · Cited by 52
Fast universal quantum computation with railroad-switch local Hamiltonians
Nagaj, D. (2010) · Journal of Mathematical Physics · doi:10.1063/1.3384661 · Cited by 48
Babbush, R., Perdomo‐Ortiz, A., O'Gorman, B., Macready, W., & Aspuru‐Guzik, A. (2014) · Advances in Chemical Physics · doi:10.1002/9781118755815.ch05 · Cited by 45 · cited 1×
“folding [11, 12] and machine learning [13, 14].”
Self-citationQuantum 3-SAT Is QMA1-Complete
Gosset, D., & Nagaj, D. (2013) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2013.86 · Cited by 41
Evaporation of trapped anions studied with a 22-pole ion trap in tandem time-of-flight configuration
Mikosch, J., Frühling, U., Trippel, S. H., Otto, R., Hlavenka, P., Schwalm, D., Weidemüller, M., & Wester, R. (2008) · Physical Review A · doi:10.1103/physreva.78.023402 · Cited by 40
Preparation of Many-Body States for Quantum Simulation
Ward, N. J., Kassal, I., & Aspuru‐Guzik, A. (2009) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 39
Self-citationTwo-dimensional quantum gas in a hybrid surface trap
Gillen, J. I., Bakr, W., Peng, A., Unterwaditzer, P., Fölling, S., & Greiner, M. (2009) · Physical Review A · doi:10.1103/physreva.80.021602 · Cited by 35
Tunneling spectroscopy using a probe qubit
Berkley, A. J., Przybysz, A. J., Lanting, T., Harris, R., Dickson, N., Altomare, F., Amin, M. H., Bunyk, P., Enderud, C., Hoskinson, E., et al. (2013) · Physical Review B · doi:10.1103/physrevb.87.020502 · Cited by 35
Efficient quantum circuits for diagonal unitaries without ancillas
Welch, J., Greenbaum, D., Mostame, S., & Aspuru‐Guzik, A. (2014) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 35
Self-citationHamiltonian 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
Self-citationLandau-Zener transitions in a superconducting flux qubit
Johansson, J., Amin, M. H. S., Berkley, A. J., Bunyk, P., Choi, V., Harris, R., Johnson, M. W., Lanting, T. M., Lloyd, S., & Rose, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.012507 · Cited by 34
Choi, V. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.2226 · Cited by 34
Adiabatic quantum search algorithm for structured problems
Roland, J., & Cerf, N. J. (2003) · Physical Review A · doi:10.1103/physreva.68.062312 · Cited by 34
Resource efficient gadgets for compiling adiabatic quantum optimization problems
Babbush, R., O'Gorman, B., & Aspuru‐Guzik, A. (2013) · Annalen der Physik · doi:10.1002/andp.201300120 · Cited by 33
Self-citationThe Bose-Hubbard model is QMA-completePreprint
Childs, A. M., Gosset, D., & Webb, Z. (2013) · Cited by 30
Robust Classification with Adiabatic Quantum Optimization
Denchev, V. S., Ding, N., Vishwanathan, S. V. N., & Neven, H. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.1148 · Cited by 24
Comment on: "Classical signature of quantum annealing"
Wang, L., Rønnow, T. F., Boixo, S., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.5837 · Cited by 23
Synchronization of multiple coupled rf-SQUID flux qubits
Harris, R., Brito, F., Berkley, A. J., Johansson, J., Johnson, M. W., Lanting, T., Bunyk, P., Ladizinsky, E., Bumble, B., Fung, A., et al. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/12/123022 · Cited by 23
Joanis, P., Mahler, D. H., & de Guise, H. (2010) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/43/38/385304 · Cited by 21
Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix
Toloui, B., & Love, P. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1312.2579 · Cited by 20
Self-citationCommunication: Spin-free quantum computational simulations and symmetry adapted states
Whitfield, J. D. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4812566 · Cited by 19
Computational Complexity in Electronic Structure
Whitfield, J. D., Love, P. J., & Aspuru‐Guzik, A. (2012) · PubMed · doi:10.48550/arxiv.1208.3334 · Cited by 18
Self-citationThe Bose-Hubbard Model is QMA-complete
Childs, A. M., Gosset, D., & Webb, Z. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-43948-7_26 · Cited by 18
Can quantum chemistry be performed on a small quantum computer
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B., & Troyer, M. (2013) · Cited by 16
Babbush, R., Denchev, V. S., Ding, N., Isakov, S. V., & Neven, H. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4203 · Cited by 15
Self-citationCold Rydberg Atoms for Quantum Simulation of Exotic Condensed Matter Interactions
Hague, J. P., Downes, S., MacCormick, C., & Kornilovitch, P. E. (2013) · Journal of Superconductivity and Novel Magnetism · doi:10.1007/s10948-013-2414-y · Cited by 14
The complexity of quantum spin systems on a two-dimensional square latticePreprint
Oliveira, R. I., & Terhal, B. M. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0504050 · Cited by 14
Joanis, P., Dylan, H. M., & Hubert, D. G. (2010) · Journal of Physics A Mathematical and Theoretical · Cited by 13
Implementation of a Quantum Annealing Algorithm Using a Superconducting CircuitPreprint
Harris, R., Berkley, A. J., Johansson, J., Johnson, M. W., Lanting, T. M., Bunyk, P., Tolkacheva, E., Ladizinsky, E., Bumble, B., Fung, A., et al. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.3906 · Cited by 10
Improving Quantum Algorithms for Quantum ChemistryPreprint
Hastings, M. B., Wecker, D., Bauer, B., et al. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.1539 · Cited by 10
Classical signature of quantum annealingPreprint
Smolin, J. A., & Smith, G. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.4904 · Cited by 10
Efficient Algorithms for Universal Quantum Simulation
Sanders, B. C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38986-3_1 · Cited by 9
Classical and quantum annealing in the median of three-satisfiability
Neuhaus, T., Peschina, M., Michielsen, K. F. L., & Raedt, H. A. D. (2011) · Physical Review A · doi:10.1103/physreva.83.012309 · Cited by 9
Adiabatic quantum search algorithm for structured problems (7 pages)
Cerf, N. J., & Roland, J. (2003) · Physical Review A · Cited by 7
Realization of universal adiabatic quantum computation with fewer physical resources
Duan, Q.-H., & Chen, P. (2011) · Physical Review A · doi:10.1103/physreva.84.042332 · Cited by 6
Nuclear-resonant electron scattering
Pálffy, A., & Harman, Z. (2008) · Physical Review A · doi:10.1103/physreva.77.042704 · Cited by 6
Ma, X., Dakić, B., Kropatsche, S., Naylor, W. R., Chan, Y., Gong, Z., Duan, L.-M., Zeilinger, A., & Walther, P. J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2801 · Cited by 5
Efficient Algorithms for Universal Quantum SimulationPreprint
Sanders, B. C. (2016) · Cited by 5
The Trotter Step Size Required for Accurate Quantum Simulation of Quantum ChemistryPreprint
Poulin, D., Hastings, M. B., Wecker, D., et al. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4920 · Cited by 5
Classical and Quantum Annealing in the Median of Three Satisfiability
Neuhaus, T., Peschina, M., Michielsen, K. F. L., & Raedt, H. A. D. (2011) · International Conference on Quantum Information · doi:10.1364/icqi.2011.qmi23 · Cited by 3
Babbush, R., Perdomo‐Ortiz, A., O’Gorman, B., Macready, W. G., & Aspuru‐Guzik, A. (2012) · arXiv (Cornell University) · Cited by 3
Self-citationExperimentally Realizable Hamiltonian GadgetsPreprint
Cao, Y., Babbush, R., Biamonte, J., & Kais, S. (2013) · arXiv (Cornell University) · Cited by 2
Self-citation
Research works printed but not linked: 1
- Abrams D. S. & Lloyd S. Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors. Phys. Rev. Lett. 83, 5162– 5165; 10.1103/PhysRevLett.83.5162 (1999). · DOI · Paper page
Cited by
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Self-citationNoisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Self-citationQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Self-citationQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Self-citationAlbash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Metadata
- Authors
- Babbush, R., Love, P. J., & Aspuru-Guzik, A.
- Affiliations
- Harvard University (US)
- Haverford College (US)
- Venue
- Scientific Reports
- Published
- 2014-10-13
- Volume
- 4
- Issue
- 1
- Pages
- 6603-6603
- ISSN
- 2045-2322 (ISSN-L)
- PMC
- PMC4194464
- OpenAlex
- W2053275122
- Cited by
- 191
- References
- 137
- Citations by year
- 2026: 6 · 2025: 15 · 2024: 12 · 2023: 35 · 2022: 21 · 2021: 21 · 2020: 23 · 2019: 13 · 2018: 10 · 2017: 12 · 2016: 15 · 2015: 3 · 2014: 4
- FWCI
- 11.30
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Scientific Reports (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- arXiv (Cornell University)
- Funders
- National Science Foundation (0955518, 1152291)
- U.S. Department of Defense (FA9550)
- Division of Chemistry (CHE-1152291)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Keywords
- adiabatic quantum computation, Ising interaction, ancilla qubits
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.