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
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
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
Self-citationQuantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Simulating 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
Quantum Chemistry Calculations on a Trapped-Ion Quantum Simulator
Hempel, C., Maier, C., Romero, J., McClean, J., Monz, T., Shen, H., Jurcevic, P., Lanyon, B. P., Love, P., Babbush, R., et al. (2018) · Physical Review X · doi:10.1103/physrevx.8.031022 · Cited by 446
Self-citationOpenFermion: the electronic structure package for quantum computers
McClean, J. R., Rubin, N. C., Sung, K. J., Kivlichan, I. D., Bonet-Monroig, X., Cao, Y., Dai, C., Fried, E. S., Gidney, C., Gimby, B., et al. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8ebc · Cited by 464
Self-citationPerspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · Nature · doi:10.1038/nature17658 · Cited by 463
Self-citationQuantum Simulation of Electronic Structure with Linear Depth and Connectivity
Kivlichan, I. D., McClean, J., Wiebe, N., Gidney, C., Aspuru-Guzik, A., Chan, G. K.-L., & Babbush, R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.110501 · Cited by 431
Self-citationEncoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383
“[7], the idea that one should use phase estimation and adiabatic state preparation [8 – 10] to extract quantum chemistry ground-state energies became especially popular.”
BackgroundSelf-citationQuantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
Potential of quantum computing for drug discovery
Cao, Y., Romero, J., & Aspuru-Guzik, A. (2018) · IBM Journal of Research and Development · doi:10.1147/jrd.2018.2888987 · Cited by 357
Self-citationLow-Depth Quantum Simulation of Materials
Babbush, R., Wiebe, N., McClean, J., McClain, J., Neven, H., & Chan, G. K.-L. (2018) · Physical Review X · doi:10.1103/physrevx.8.011044 · Cited by 335
“III A and III B can be used for groundstate simulation, either by simulating adiabatic state preparation [8] or by projecting to a ground state using quantum phase estimation [4,5], such approaches are likely to require error correction for their implementation.”
MethodSelf-citationObservation of topological phenomena in a programmable lattice of 1,800 qubits
King, A. D., Carrasquilla, J., Raymond, J., Ozfidan, I., Andriyash, E., Berkley, A., Reis, M., Lanting, T., Harris, R., Altomare, F., et al. (2018) · Nature · doi:10.1038/s41586-018-0410-x · Cited by 323
Tapering off qubits to simulate fermionic Hamiltonians
Bravyi, S. B., Gambetta, J., Mezzacapo, A., & Temme, K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.08213 · Cited by 162
A case study in programming a quantum annealer for hard operational planning problems
Rieffel, E. G., Venturelli, D., O’Gorman, B., Do, M. B., Prystay, E. M., & Smelyanskiy, V. N. (2015) · Quantum Information Processing · doi:10.1007/s11128-014-0892-x · Cited by 218
Chemical basis of Trotter-Suzuki errors in quantum chemistry simulation
Babbush, R., McClean, J., Wecker, D., Aspuru-Guzik, A., & Wiebe, N. (2015) · Physical Review A · doi:10.1103/physreva.91.022311 · Cited by 199
Self-citationLow rank representations for quantum simulation of electronic structure
Motta, M., Ye, E., McClean, J. R., Li, Z., Minnich, A. J., Babbush, R., & Chan, G. K.-L. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00416-z · Cited by 171
Self-citationEmerging quantum computing algorithms for quantum chemistry
Motta, M., & Rice, J. E. (2022) · WIREs Computational Molecular Science · doi:10.1002/wcms.1580 · Cited by 173
Yen, T.-C., Verteletskyi, V., & Izmaylov, A. F. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00008 · Cited by 178
Low rank representations for quantum simulation of electronic structure
Motta, M., Ye, E., McClean, J. R., Li, Z., Minnich, A. J., Babbush, R., & Chan, G. K.-L. (2018) · arXiv · doi:10.48550/arxiv.1808.02625 · Cited by 173
Self-citationQuantum annealing with all-to-all connected nonlinear oscillators
Puri, S., Andersen, C. K., Grimsmo, A. L., & Blais, A. (2017) · Nature Communications · doi:10.1038/ncomms15785 · Cited by 164
A quantum algorithm for evolving open quantum dynamics on quantum computing devices
Hu, Z., Xia, R., & Kais, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-60321-x · Cited by 163
Quantum machine learning for electronic structure calculations
Xia, R., & Kais, S. (2018) · Nature Communications · doi:10.1038/s41467-018-06598-z · Cited by 145
Application of fermionic marginal constraints to hybrid quantum algorithms
Rubin, N. C., Babbush, R., & McClean, J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab919 · Cited by 152
Self-citationGate-Efficient Simulation of Molecular Eigenstates on a Quantum Computer
Ganzhorn, M., Egger, D. J., Barkoutsos, P., Ollitrault, P., Salis, G., Moll, N., Roth, M., Fuhrer, A., Mueller, P., Woerner, S., et al. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.11.044092 · Cited by 131
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-citationTheBravyi–Kitaev transformation: Properties and applications
Tranter, A., Sofia, S., Seeley, J., Kaicher, M., McClean, J., Babbush, R., Coveney, P. V., Mintert, F., Wilhelm, F., & Love, P. J. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24969 · Cited by 136
Self-citationQuantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 191
Quantum Information and Algorithms for Correlated Quantum Matter
Head-Marsden, K., Flick, J., Ciccarino, C. J., & Narang, P. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00620 · Cited by 155
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-citationFault-tolerant quantum simulations of chemistry in first quantization
Su, Y., Berry, D. W., Wiebe, N., Rubin, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040332 · Cited by 123
Self-citationFermion-to-qubit mappings with varying resource requirements for quantum simulation
Steudtner, M., & Wehner, S. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aac54f · Cited by 104
Electronic Structure Calculations and the Ising Hamiltonian
Xia, R., Bian, T., & Kais, S. (2018) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.7b10371 · Cited by 96
Khazali, M., & Mølmer, K. (2020) · Physical Review X · doi:10.1103/physrevx.10.021054 · Cited by 132
A Full Quantum Eigensolver for Quantum Chemistry Simulations
Wei, S., Li, H., & Long, G. (2020) · Research · doi:10.34133/2020/1486935 · Cited by 111
A QUBO Model for the Traveling Salesman Problem with Time Windows
Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., & Fanarioti, S. (2019) · Algorithms · doi:10.3390/a12110224 · Cited by 120
Adiabatic state preparation study of methylene
Veis, L., & Pittner, J. (2014) · The Journal of Chemical Physics · doi:10.1063/1.4880755 · Cited by 84
Sugisaki, K., Nakazawa, S., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2019) · ACS Central Science · doi:10.1021/acscentsci.8b00788 · Cited by 90
Babbush, R., Berry, D. W., Sanders, Y. R., Kivlichan, I. D., Scherer, A., Wei, A. Y., Love, P. J., & Aspuru-Guzik, A. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aa9463 · Cited by 85
Self-citationLocal spin operators for fermion simulations
Whitfield, J. D., Havlíček, V., & Troyer, M. (2016) · Physical Review A · doi:10.1103/physreva.94.030301 · Cited by 73
Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
Oshiyama, H., & Ohzeki, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-06070-5 · Cited by 85
Demonstration of a Nonstoquastic Hamiltonian in Coupled Superconducting Flux Qubits
Ozfidan, I., Deng, C., Smirnov, A. Y., Lanting, T. M., Harris, R., Swenson, L. J., Whittaker, J. D., Altomare, F., Babcock, M. C., Baron, C., et al. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.034037 · Cited by 78
Entanglement spectroscopy on a quantum computer
Johri, S., Steiger, D. S., & Troyer, M. (2017) · Physical Review B · doi:10.1103/physrevb.96.195136 · Cited by 66
A transmon quantum annealer: decomposing many-body Ising constraints into pair interactions
Leib, M., Zoller, P., & Lechner, W. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015008 · Cited by 63
Quantum inverse iteration algorithm for programmable quantum simulators
Kyriienko, O. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0239-7 · Cited by 86
Implementation of Quantum Annealing: A Systematic Review
Yulianti, L. P., & Surendro, K. (2022) · IEEE Access · doi:10.1109/access.2022.3188117 · Cited by 79
Moll, N., Fuhrer, A., Staar, P., & Tavernelli, I. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/29/295301 · Cited by 53
Solving Quantum Chemistry Problems with a D-Wave Quantum Annealer
Streif, M., Neukart, F., & Leib, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_10 · Cited by 85
Sugisaki, K., Yamamoto, S., Nakazawa, S., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2016) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.6b04932 · Cited by 55
Opportunities and Challenges of Quantum Computing for Engineering Optimization
Wang, Y., Kim, J. E., & Suresh, K. (2023) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4062969 · Cited by 65
Hamiltonian Simulation with Random Inputs
Zhao, Q., Zhou, Y., Shaw, A. F., Li, T., & Childs, A. M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.270502 · Cited by 98
Kumar, A., Asthana, A., Masteran, C., Valeev, E. F., Zhang, Y., Cincio, Ł., Tretiak, S., & Dub, P. A. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00520 · Cited by 60
Li, Z., Liu, X., Wang, H., Ashhab, S., Cui, J., Chen, H., Peng, X., & Du, J. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.090504 · Cited by 48
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-citationBarison, S., Moreno, J. R., & Motta, M. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb781 · Cited by 106
Electronic structure with direct diagonalization on a D-wave quantum annealer
Teplukhin, A., Kendrick, B. K., Tretiak, S., & Dub, P. A. (2020) · Scientific Reports · doi:10.1038/s41598-020-77315-4 · Cited by 51
Quantum simulation of Cayley-tree Ising Hamiltonians with three-dimensional Rydberg atoms
Song, Y., Kim, M., Hwang, H., Lee, W., & Ahn, J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013286 · Cited by 51
Demonstration of Tunable Three-Body Interactions between Superconducting Qubits
Menke, T., Banner, W. P., Bergamaschi, T. R., Paolo, A. D., Vepsäläinen, A. P., Weber, S. J., Winik, R., Melville, A. J., Niedzielski, B. M., Rosenberg, D., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.220501 · Cited by 58
Self-citationQuantum Simulation of Molecular Response Properties in the NISQ Era
Kumar, A., Asthana, A., Abraham, V., Crawford, T. D., Mayhall, N. J., Zhang, Y., Cincio, Ł., Tretiak, S., & Dub, P. A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00731 · Cited by 48
Camino, B., Buckeridge, J., Warburton, P. A., Kendon, V. M., & Woodley, S. M. (2023) · Journal of Applied Physics · doi:10.1063/5.0151346 · Cited by 46
Automated design of superconducting circuits and its application to 4-local couplers
Menke, T., Häse, F., Gustavsson, S., Kerman, A. J., Oliver, W. D., & Aspuru‐Guzik, A. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00382-6 · Cited by 48
Self-citationElectronic Quantum Materials Simulated with Artificial Model Lattices
Freeney, S. E., Slot, M. R., Gardenier, T. S., Swart, I., & Vanmaekelbergh, D. A. M. (2022) · ACS Nanoscience Au · doi:10.1021/acsnanoscienceau.1c00054 · Cited by 41
A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing ProblemPreprint
Harikrishnakumar, R., Nannapaneni, S., Nguyen, N. H., Steck, J. E., & Behrman, E. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.12478 · Cited by 61
Analog nature of quantum adiabatic unstructured search
Slutskii, M., Albash, T., Barash, L., & Hen, I. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab51f9 · Cited by 31
Low-Depth Hamiltonian Simulation by an Adaptive Product Formula
Zhang, Z., Sun, J., Yuan, X., & Yung, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.040601 · Cited by 48
Linear and Logarithmic Time Compositions of Quantum Many-Body Operators
Motzoi, F., Kaicher, M. P., & Wilhelm, F. K. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.160503 · Cited by 29
Digital-Analog Quantum Simulations Using the Cross-Resonance Effect
Gonzalez-Raya, T., Asensio-Perea, R., Martin, A., Céleri, L. C., Sanz, M., Lougovski, P., & Dumitrescu, E. F. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020328 · Cited by 27
Low-depth Hamiltonian Simulation by Adaptive Product Formula
Zhang, Z.-J., Sun, J., Yuan, X., & Yung, M.-H. (2020) · arXiv · doi:10.48550/arxiv.2011.05283 · Cited by 26
Anomaly detection speed-up by quantum restricted Boltzmann machines
Moro, L., & Prati, E. (2023) · Communications Physics · doi:10.1038/s42005-023-01390-y · Cited by 37
Quantum chemistry and charge transport in biomolecules with superconducting circuits
García-Álvarez, L., Las Heras, U., Mezzacapo, A., Sanz, M., Solano, E., & Lamata, L. (2016) · Scientific Reports · doi:10.1038/srep27836 · Cited by 20
Variationally scheduled quantum simulation
Matsuura, S., Buck, S., Senicourt, V., & Zaribafiyan, A. (2021) · Physical Review A · doi:10.1103/physreva.103.052435 · Cited by 30
Discovering optimal fermion-qubit mappings through algorithmic enumeration
Chiew, M., & Strelchuk, S. (2023) · Quantum · doi:10.22331/q-2023-10-18-1145 · Cited by 45
Matsuzaki, Y., Hakoshima, H., Sugisaki, K., Seki, Y., & Kawabata, S. (2021) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/abdf20 · Cited by 28
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0002 · Cited by 20
Optimizing Shot Assignment in Variational Quantum Eigensolver Measurement
Zhu, L., Liang, S., Yang, C., & Li, X. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c01113 · Cited by 40
Using quantum annealers to calculate ground state properties of molecules
Copenhaver, J., Wasserman, A., & Wehefritz-Kaufmann, B. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0030397 · Cited by 24
Superconducting circuit architecture for digital-analog quantum computing
Yu, J., Retamal, J. C., Sanz, M., Solano, E., & Albarrán-Arriagada, F. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00129-y · Cited by 27
Efficient two-electron ansatz for benchmarking quantum chemistry on a quantum computer
Smart, S. E., & Mazziotti, D. A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023048 · Cited by 20
Leveraging Quantum Computing for Database Index Selection
Trummer, I., & Venturelli, D. (2024) · Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data) · doi:10.1145/3665225.3665445 · Cited by 24
Efficient two-electron ansatz for benchmarking quantum chemistry on a quantum computer
Smart, S. E., & Mazziotti, D. A. (2020) · University of Chicago · doi:10.6082/2cxwm-y5012 · Cited by 16
Adiabatic quantum imaginary time evolution
Hejazi, K., Motta, M., & Chan, G. K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033084 · Cited by 22
Simulation of adiabatic quantum computing for molecular ground states
Kremenetski, V., Mejuto-Zaera, C., Cotton, S. J., & Tubman, N. M. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0060124 · Cited by 28
Adiabatic quantum simulations with driven superconducting qubits
Roth, M., Moll, N., Salis, G., Ganzhorn, M., Egger, D. J., Filipp, S., & Schmidt, S. (2019) · Physical Review A · doi:10.1103/physreva.99.022323 · Cited by 16
Quantum simulation of two-dimensional quantum chemistry in optical lattices
Argüello-Luengo, J., González-Tudela, A., Shi, T., Zoller, P., & Cirac, J. I. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.042013 · Cited by 18
Quantum Information and Computation for Chemistry
Olson, J., Cao, Y., Romero, J., Johnson, P., Dallaire-Demers, P.-L., Sawaya, N., Narang, P., Kivlichan, I., Wasielewski, M., & Aspuru-Guzik, A. (2017) · arXiv · doi:10.48550/arxiv.1706.05413 · Cited by 15
“In contrast to Lloyd’s original work, which used the Trotter-Suzuki approximation to simulate evolution under a Hamiltonian, Berry et al. instead considered the possibility of decomposing the Hamiltonian as a linear combination of unitary operators, and employing a truncated Taylor series to simulate Hamiltonian dynam…”
BackgroundInfluentialSelf-citationQuantum simulation of molecules without fermionic encoding of the wave function
Mazziotti, D. A., Smart, S. E., & Mazziotti, A. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac3573 · Cited by 16
Boosting quantum amplitude exponentially in variational quantum algorithms
Kyaw, T. H., Soley, M. B., Allen, B., Bergold, P., Sun, C., Batista, V. S., & Aspuru‐Guzik, A. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf4ba · Cited by 21
Self-citationSuperconducting qubit circuit emulation of a vector spin-1/2
Kerman, A. J. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab2ee7 · Cited by 17
VanQver: the variational and adiabatically navigated quantum eigensolver
Matsuura, S., Yamazaki, T., Senicourt, V., Huntington, L., & Zaribafiyan, A. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8080 · Cited by 20
Characterizing quantum simulations with quantum tomography on a spin quantum simulator
Zhao, D., Wei, C., Xue, S., Huang, Y., Nie, X., Li, J., Ruan, D., Lu, D., Xin, T., & Long, G. (2021) · Physical Review A · doi:10.1103/physreva.103.052403 · Cited by 14
Learning bounds for quantum circuits in the agnostic setting
Popescu, C. M. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03225-7 · Cited by 21
Albertsson, D. I., & Rusu, A. (2023) · Scientific Reports · doi:10.1038/s41598-023-31155-0 · Cited by 21
Manenti, R., & Motta, M. (2023) · doi:10.1093/oso/9780198787488.001.0001 · Cited by 29
An introduction to quantum computing for statisticians and data scientists
Lopatnikova, A., Tran, M., & Sisson, S. A. (2024) · Foundations of Data Science · doi:10.3934/fods.2024013 · Cited by 14
Nonperturbative embedding for highly nonlocal Hamiltonians
Subaşı, Y., & Jarzynski, C. (2016) · Physical Review A · doi:10.1103/physreva.94.012342 · Cited by 14
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.