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…”
Background
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Introduction to Quantum Algorithms for Physics and Chemistry. https://app.cochat.ai/papers/10.1002/9781118742631.ch03
- The paper
- Yung, M., Whitfield, J. D., Boixo, S., Tempel, D. G., & Aspuru‐Guzik, A. (2014). Introduction to Quantum Algorithms for Physics and Chemistry. Advances in Chemical Physics. https://doi.org/10.1002/9781118742631.ch03
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.