Quantum algorithms for fermionic simulations
Open accessAbstract
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on standard qubits.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
The problem reduces to the quantum simulation of the effective Hamiltonian, which can be done in polynomial time using the procedure outlined by Ortiz et al.
“The problem then reduces to the quantum simulation of this effective Hamiltonian, , which can be done in polynomial time using the procedure outlined by Ortiz et al.23”
From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [23]
A quantum device can efficiently evaluate the expectation value of a tensor product of an arbitrary number of simple Pauli operators.
“A quantum device can efficiently evaluate the expectation value of a tensor product of an arbitrary number of simple Pauli operators23.”
From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [23]
A diverse set of experimental groups worldwide have already implemented various variational quantum algorithms on their physical systems.
“A diverse set of experimental groups worldwide have already implemented various variational quantum algorithms on their physical systems 52-59 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [55]
The algorithms described in Section 4 are typically beyond the limit of current error-prone quantum computers, so only proof-of-principle demonstrations for simple problems have been executed thus far.
“The algorithms described in this section are typically beyond this limit. Thus, only proof-of-principle demonstrations for simple problems have been executed thus far 55,234-236 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [55]
UCCSD has been demonstrated experimentally for H2 on a superconducting quantum computer.
“Finally, UCCSD has been demonstrated experimentally for HeH + using a single trapped ion 53 , for H 2 on a superconducting quantum computer 55 ,”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [55]
The first experimental demonstration of VQE was performed in 2014; the first scalable demonstration of both IPEA and VQE employed three superconducting qubits for simulating H2 in a minimal basis, and VQE with a hardware-based ansatz for H2, LiH and BeH2 was demonstrated in a six-qubit system.
“The first experimental demonstration of VQE was performed in 2014 52 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [55]
The variational quantum eigensolver has become the focus of state-of-the-art quantum experiments.
“This algorithm, known as the variational quantum eigensolver, as described in Section 5.1 has become the focus of the state-of-the-art quantum experiments 55,56 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [55]
The citation lists haven’t been fetched yet
References 38 · Cited by 347
- Authors
- Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R.
- Affiliations
- Los Alamos National Laboratory (US)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2001-07-18
- Volume
- 64
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2109899096
- Cited by
- 347
- References
- 38
- Citations by year
- 2026: 9 · 2025: 25 · 2024: 23 · 2023: 57 · 2022: 25 · 2021: 33 · 2020: 27 · 2019: 25 · 2018: 17 · 2017: 4 · 2016: 4 · 2015: 9 · 2014: 15 · 2013: 5 · 2012: 9
- FWCI
- 7.42
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- APS Meeting Abstracts
- 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 › Quantum Mechanics and Applications
- Keywords
- Jordan-Wigner transformation, fermionic sign problem, qubits, fermionic systems, quantum algorithms, polynomial complexity
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