Introduction to Quantum Algorithms for Physics and Chemistry
Open accessThe DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Abstract
This chapter introduces the basic concepts of digital quantum simulation. The study of the computational complexity of problems in quantum simulation helps us better understand how quantum computers can surpass classical computers. The chapter briefly summarizes a few important examples of complexity classes of decision problems. Quantum algorithms are procedures for applying elementary quantum logic gates to complete certain unitary transformations of the input state. The steps involved in carrying out a digital quantum simulation consist of three parts: state preparation, time evolution, and measurement of observables. The chapter provides an overview of state preparation and simulation of time evolution. The use of Suzuki–Trotter formulas in quantum simulation for time-independent sparse Hamiltonians is reviewed. The chapter reviews a method to effect nondestructive measurements of constants of the motion within the adiabatic model.
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
On the generators of quantum dynamical semigroups
Lindblad, G. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608499 · Cited by 7,548 · cited 2×
“Continuing the work of Lloyd (1996), works by Aharonov & Ta-Shma (2003) and Childs (2004) show that black-box sparse Hamiltonians are too efficiently simulatable.”
BackgroundMethodThe Theory of Open Quantum Systems
Breuer, H.-P., & Petruccione, F. (2007) · doi:10.1093/acprof:oso/9780199213900.001.0001 · Cited by 5,938
Completely positive dynamical semigroups of N -level systems
Gorini, V., Kossakowski, A., & Sudarshan, E. C. G. (1976) · Journal of Mathematical Physics · doi:10.1063/1.522979 · Cited by 3,998 · cited 1×
“…this evolution can often be described by a (Markovian) quantum master equation in Lindblad form (Breuer & Petruccione 2002, Lindblad 1975, Gorini, Kossakokowski & Sudarshan 1976), where H s is the system Hamiltonian, m αβ is a positive matrix, and Λ α is a linear basis of traceless…”
BackgroundLadd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 3×
“This conjecture was justified by Lloyd (1996), who argued that any Hamiltonian which can be decomposed into m local terms { H i } can be simulated efficiently by a universal quantum computer.”
BackgroundMethodMolecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
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-citationEnvironment-assisted quantum walks in photosynthetic energy transfer
Mohseni, M., Rebentrost, P., Lloyd, S., & Aspuru-Guzik, A. (2008) · The Journal of Chemical Physics · doi:10.1063/1.3002335 · Cited by 1,189
Self-citationAn open-system quantum simulator with trapped ions
Barreiro, J. T., Müller, M., Schindler, P., Nigg, D., Monz, T., Chwalla, M., Hennrich, M., Roos, C. F., Zoller, P., & Blatt, R. (2011) · Nature · doi:10.1038/nature09801 · Cited by 1,100 · cited 3×
“Like NP-problems, the QMA class covers many problems that are important to physics and chemistry (Liu, Christandl & Verstraete 2007b, Schuch & Verstraete 2009a, Wei, Mosca & Nayak 2010). For example, the ground-state problem of Hamiltonians involving local interaction terms is known to be QMA-complete (Kitaev et al. 2…”
BackgroundBuluta, I., & Nori, F. (2009) · Science · doi:10.1126/science.1177838 · Cited by 876 · cited 2×
“Several review articles (Zalka 1998b, Buluta & Nori 2009, Brown, Munro & Kendon 2010, Kassal, Whitfield, Perdomo-Ortiz, Yung & Aspuru-Guzik 2011) and book chapters (Kitaev, Shen & Vyalyi 2002, Stolze & Suter 2008, Nielsen & Chuang 2011, Williams 2010) already present a different emphasis.”
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×
“|} in the eigenvector basis {| e k (cid:105)} of H to the trial state | ψ T (cid:105) , then the probability of getting the ground state | e 0 (cid:105) is exactly equal to F , and can be implemented with the phase estimation algorithm (Abrams & Lloyd 1999).”
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-citationEfficient 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
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
Observation of topologically protected bound states in photonic quantum walks
Kitagawa, T., Broome, M. A., Fedrizzi, A., Rudner, M. S., Berg, E., Kassal, I., Aspuru-Guzik, A., Demler, E., & White, A. G. (2012) · Nature Communications · doi:10.1038/ncomms1872 · Cited by 607
Self-citationQuantum 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 2×
“The original idea is due to Farhi et al. (2000).”
MethodSimulation 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 1×
“The explicit circuits for simulating the time evolution operators can be found in Whitfield et al. (2011).”
BackgroundSelf-citationSchmidt number for density matrices
Terhal, B. M., & Horodecki, P. (2000) · Physical Review A · doi:10.1103/physreva.61.040301 · Cited by 427
Discrete Single-Photon Quantum Walks with Tunable Decoherence
Broome, M. A., Fedrizzi, A., Lanyon, B. P., Kassal, I., Aspuru-Guzik, A., & White, A. G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.153602 · Cited by 420
Self-citationOn the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411 · cited 2×
“lems based on the polynomial method (Beals, Buhrman, Cleve, Mosca & de Wolf 1998). This bound could be violated given sub-linear simulation time. In a departure from the methods discussed so far, Childs (2010) used a quantum walk based approach to push the scaling closer to linear in the reweighed time and Raesi,…”
MethodPolynomial-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-citationSimulating 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-citationQuantum algorithms for fermionic simulations
Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2001) · Physical Review A · doi:10.1103/physreva.64.022319 · Cited by 347
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322
Can one trust quantum simulators?
Hauke, P., Cucchietti, F. M., Tagliacozzo, L., Deutsch, I., & Lewenstein, M. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/8/082401 · Cited by 315 · cited 1×
“For a recent review, see e.g. Ladd, Jelezko, Laflamme, Nakamura, Monroe & O’Brien (2010) and Hauke, Cucchietti, Tagliacozzo, Deutsch & Lewenstein (2011).”
Temme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D., & Verstraete, F. (2011) · Nature · doi:10.1038/nature09770 · Cited by 305 · cited 1×
“For more discussion on topics of computational complexity and quantum simulation, readers may find the following references useful: Aharonov & Naveh (2002), Rassolov & Garashchuk (2008), Aaronson (2009), Osborne (2011) and Aaronson (2011).”
BackgroundSchuch, N., & Verstraete, F. (2009) · Nature Physics · doi:10.1038/nphys1370 · Cited by 260 · cited 2×
“For recent developments in the connections between DFT and quantum complexity 14 see Schuch & Verstraete (2009b), while for applications of DFT to adiabatic quantum computation see Gaitan & Nori (2009).”
BackgroundQuantum Computational Complexity of the N -Representability Problem: QMA Complete
Liu, Y.-K., Christandl, M., & Verstraete, F. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.110503 · Cited by 211 · cited 1×
“Like NP -problems, the QMA class covers many problems that are important to physics and chemistry (Liu, Christandl & Verstraete 2007b, Schuch & Verstraete 2009a, Wei, Mosca & Nayak 2010).”
BackgroundQuantum Computing with an Always-On Heisenberg Interaction
Benjamin, S. C., & Bose, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.247901 · Cited by 190 · cited 1×
“Benjamin & Bose (2003) and Benjamin & Bose (2004) have shown that any set of universal two-qubit and single-qubit gates can be implemented with the Hamiltonian of Eq.”
BackgroundThermalization in Nature and on a Quantum Computer
Riera, A., Gogolin, C., & Eisert, J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.080402 · Cited by 189 · cited 1×
“…of spin systems (Lidar & Biham 1997, Yung et al. 2010); mapping the CETS as the ground state of certain Hamiltonian (Somma, Batista & Ortiz 2007, Ohzeki & Nishimori 2011); and methods based on quantum phase estimation (Poulin & Wocjan 2009b, Bilgin & Boixo 2010, Riera, Gogolin & Eisert 2011).”
MethodQuantum Simulations on a Quantum Computer
Somaroo, S., Tseng, C. H., Havel, T. F., Laflamme, R., & Cory, D. G. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.5381 · Cited by 180 · cited 1×
“To the best of our knowledge, the first quantum simulation experiment was performed by Somaroo, Tseng, Havel, Laflamme & Cory (1999) in a two-qubit NMR system in 1999, where a truncated quantum harmonic or anharmonic oscillator (4 levels) was simulated.”
MethodDissipative Quantum Church-Turing Theorem
Kliesch, M., Barthel, T., Gogolin, C., Kastoryano, M., & Eisert, J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.120501 · Cited by 154
Using Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129 · cited 1×
“Several review articles (Zalka 1998b, Buluta & Nori 2009, Brown, Munro & Kendon 2010, Kassal, Whitfield, Perdomo-Ortiz, Yung & Aspuru-Guzik 2011) and book chapters (Kitaev, Shen & Vyalyi 2002, Stolze & Suter 2008, Nielsen & Chuang 2011, Williams 2010) already present a different emphasis.”
BackgroundSimulating open quantum systems: from many-body interactions to stabilizer pumping
Müller, M., Hammerer, K., Zhou, Y. L., Roos, C. F., & Zoller, P. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/8/085007 · Cited by 127
Perdomo, A., Truncik, C., Tubert-Brohman, I., Rose, G., & Aspuru-Guzik, A. (2008) · Physical Review A · doi:10.1103/physreva.78.012320 · Cited by 120
Self-citationCalculating the thermal rate constant with exponential speedup on a quantum computer
Lidar, D. A., & Wang, H. (1999) · Physical Review E · doi:10.1103/physreve.59.2429 · Cited by 115
Quantum algorithm for simulating the dynamics of an open quantum system
Wang, H., Ashhab, S., & Nori, F. (2011) · Physical Review A · doi:10.1103/physreva.83.062317 · Cited by 106
Brown, K. R., Clark, R. J., & Chuang, I. L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050504 · Cited by 98 · cited 1×
“We refer to Brown, Clark & Chuang (2006) and Clark et al. (2009) for further explore this area.”
BackgroundQuantum Approach to Classical Statistical Mechanics
Somma, R. D., Batista, C. D., & Ortiz, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.030603 · Cited by 87
Simulating Sparse Hamiltonians with Star Decompositions
Childs, A. M., & Kothari, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-18073-6_8 · Cited by 85
Quantum algorithm for molecular properties and geometry optimization
Kassal, I., & Aspuru-Guzik, A. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3266959 · Cited by 76 · cited 2×
“…& Wang 1999, Wu, Byrd & Lidar 2002, Somma, Ortiz, Gubernatis, Knill & Laflamme 2002, Somma, Ortiz, Knill & Gubernatis 2003, Byrnes & Yamamoto 2006, Kassal & Aspuru-Guzik 2009) or quantities of physical interest such as the partition function (Master, Yamaguchi & Yamamoto 2003, Wocjan, Chiang,…”
BackgroundSelf-citationQuantum-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
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
Self-citationSolving 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
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×
“Consider, more generally, the preparation of the following n -qubit quantum state (Zalka 1998b, Grover & Rudolph 2002, Kaye & Mosca 2004, Ward et al. 2009): Here again we will assume that f ( x ) is real.”
BackgroundSelf-citationRelativistic quantum chemistry on quantum computers
Veis, L., Višňák, J., Fleig, T., Knecht, S., Saue, T., Visscher, L., & Pittner, J. (2012) · Physical Review A · doi:10.1103/physreva.85.030304 · Cited by 36
Cited by
Quantum 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-citationHamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
Romero, J., Babbush, R., McClean, J. R., Hempel, C., Love, P. J., & Aspuru-Guzik, A. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/aad3e4 · Cited by 726
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
Quantum implementation of the unitary coupled cluster for simulating molecular electronic structure
Shen, Y., Zhang, X., Zhang, S., Zhang, J.-N., Yung, M.-H., & Kim, K. (2017) · Physical Review A · doi:10.1103/physreva.95.020501 · Cited by 295
Self-citation
Metadata
- Authors
- Yung, M., Whitfield, J. D., Boixo, S., Tempel, D. G., & Aspuru‐Guzik, A.
- Venue
- Advances in Chemical Physics
- Publisher
- Wiley
- Published
- 2014-02-14
- Pages
- 67-106
- ISSN
- 0065-2385 (ISSN-L)
- 1934-4791
- OpenAlex
- W2144688890
- Cited by
- 50
- References
- 48
- Type
- other
- 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.