Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 191 of the 191 references it cites were found in a registry or an index.

Quantum many-body simulations on digital quantum computers: State-of-the-art and future challenges

Open access
Fauseweh, Benedikt · 2024 · Nature Communications

Abstract

Simulating quantum many-body systems is a key application for emerging quantum processors. While analog quantum simulation has already demonstrated quantum advantage, its digital counterpart has recently become the focus of intense research interest due to the availability of devices that aim to realize general-purpose quantum computers. In this perspective, we give a selective overview of the currently pursued approaches, review the advances in digital quantum simulation by comparing non-variational with variational approaches and identify hardware and algorithmic challenges. Based on this review, the question arises: What are the most promising problems that can be tackled with digital quantum simulation? We argue that problems of a qualitative nature are much more suitable for near-term devices then approaches aiming purely for a quantitative accuracy improvement.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41467-024-46402-9

Cites

191 of 191 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Digital quantum simulation of an interaction quench in a 1D fermion system with nearest neighbour interactions. Experimental data are obtained by combination of optimal state preparation, readout and symmetry error mitigation, zero noise extrapolation and full quantum state tomography after each time step on an IBM quantum computer. a Time and momentum dependence of the fermionic distribution function on a periodic four-site chain after an interaction quench to Ufinal = 2 at t = 0. b Time evolution of the filling factor. Comparison between the exact filling, the weak quench Ufinal = 1 and the strong quench Ufinal = 2. c Time evolution of the jump in the Fermi distribution. Comparison between the experimental results for weak and strong quenches and classical simulations. For the classical simulation, the state after initial preparation at t = 0 was obtained by full state tomography from the quantum computer. It was subsequently evolved by the Schroedinger equation, orange and blue line, and by Trotterization, black dashed line, on a classical computer. (d) Entanglement entropy of a bipartition of the system. The classical simulations were obtained with the same method as in (c). Figure adopted from65.
Fig. 1 Digital quantum simulation of an interaction quench in a 1D fermion system with nearest neighbour interactions. Experimental data are obtained by combination of optimal state preparation, readout and symmetry error mitigation, zero noise extrapolation and full quantum state tomography after each time step on an IBM quantum computer. a Time and momentum dependence of the fermionic distribution function on a periodic four-site chain after an interaction quench to Ufinal = 2 at t = 0. b Time evolution of the filling factor. Comparison between the exact filling, the weak quench Ufinal = 1 and the strong quench Ufinal = 2. c Time evolution of the jump in the Fermi distribution. Comparison between the experimental results for weak and strong quenches and classical simulations. For the classical simulation, the state after initial preparation at t = 0 was obtained by full state tomography from the quantum computer. It was subsequently evolved by the Schroedinger equation, orange and blue line, and by Trotterization, black dashed line, on a classical computer. (d) Entanglement entropy of a bipartition of the system. The classical simulations were obtained with the same method as in (c). Figure adopted from65.CC BY · PubMed Central
Fig. 2 Toric code on a superconducting quantum processor. a Graphical representation of the star and plaquette parity measured after preparation of the toric code ground state. Qubits are represented as white crosses, solid black lines in the background show the lattice of the toric code. b Quantum circuit for the preparation of the toric code ground state on a 31 qubit processor. Figure adopted from74.
Fig. 2 Toric code on a superconducting quantum processor. a Graphical representation of the star and plaquette parity measured after preparation of the toric code ground state. Qubits are represented as white crosses, solid black lines in the background show the lattice of the toric code. b Quantum circuit for the preparation of the toric code ground state on a 31 qubit processor. Figure adopted from74.CC BY · PubMed Central
Fig. 3 Variational Quantum Eigensolver applied to a four qubit Heisenberg model on a superconducting quantum computer. a Energy optimization using a hardware efficient Ansatz of depth 0 (blue) and depth 2 (red), with dashed lines indicating the final energy estimate for J/B = 1. Plotted along with the exact energy (dashed black line). The inset highlights the qubits used for the experiment along with the entangling gates (arrows) (b), (c) Experimental results (blue and red data points) plotted along with exact values (black dashed lines) and density plots of 100 numerical outcomes, for energy (b) and magnetization (c), for a range of values of J/B. Figure adopted from110.
Fig. 3 Variational Quantum Eigensolver applied to a four qubit Heisenberg model on a superconducting quantum computer. a Energy optimization using a hardware efficient Ansatz of depth 0 (blue) and depth 2 (red), with dashed lines indicating the final energy estimate for J/B = 1. Plotted along with the exact energy (dashed black line). The inset highlights the qubits used for the experiment along with the entangling gates (arrows) (b), (c) Experimental results (blue and red data points) plotted along with exact values (black dashed lines) and density plots of 100 numerical outcomes, for energy (b) and magnetization (c), for a range of values of J/B. Figure adopted from110.CC BY · PubMed Central
Fig. 4 Quantum Technology Circle. Relation between the fields Digital Quantum Simulation, Quantum Matter and Technology and Quantum Computing Platform development, which could potentially foster a Quantum Moore’s Law. Current state of the art quantum platforms are the results of years of research on complex many-body systems and quantum matter. Quantum computing platforms enable digital quantum simulation with the potential to predict emerging states, which in turn support the development of novel quantum building blocks that can potential serve quantum computing platforms. At each point of the circle there are spin-off applications and technologies which can be useful in other fields, such as the understanding of non-equilibrium phenomena.
Fig. 4 Quantum Technology Circle. Relation between the fields Digital Quantum Simulation, Quantum Matter and Technology and Quantum Computing Platform development, which could potentially foster a Quantum Moore’s Law. Current state of the art quantum platforms are the results of years of research on complex many-body systems and quantum matter. Quantum computing platforms enable digital quantum simulation with the potential to predict emerging states, which in turn support the development of novel quantum building blocks that can potential serve quantum computing platforms. At each point of the circle there are spin-off applications and technologies which can be useful in other fields, such as the understanding of non-equilibrium phenomena.CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 189 references

Research works printed but not linked: 6

  1. Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010).
  2. Bermejo-Vega, J., Hangleiter, D., Schwarz, M., Raussendorf, R. & Eisert, J. Architectures for quantum simulation showing a quantum speedup. Phys. Rev. X 8, 021010 (2018).
  3. Bradley, C. E. et al. A ten-qubit solid-state spin register with quantum memory up to one minute. Phys. Rev. X 9, 031045 (2019).
  4. Li, Y. & Benjamin, S. C. Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X 7, 021050 (2017).
  5. Lidar, D. A. Quantum Information and Computation for Chemistry (John Wiley & Sons, Inc., 2014).
  6. Skinner, B., Ruhman, J. & Nahum, A. Measurement-induced phase transitions in the dynamics of entanglement. Phys. Rev. X 9, 031009 (2019).

Cited by

See all 153

Metadata

Authors
Fauseweh, B.
Affiliations
TU Dortmund University (DE)
Corresponding author
Fauseweh, Benedikt
Venue
Nature Communications
Published
2024-03-08
Volume
15
Issue
1
Pages
2123-2123
ISSN
2041-1723 (ISSN-L)
OpenAlex
W4392595180
Cited by
152
References
189
Citations by year
2026: 40 · 2025: 88 · 2024: 24
FWCI
5.22
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature Communications (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
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 Information and Cryptography
Keywords
digital quantum simulation, quantum many-body systems, variational quantum algorithms, quantum advantage, quantum algorithms, near-term quantum devices

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: Quantum many-body simulations on digital quantum computers: State-of-the-art and future challenges. https://app.cochat.ai/papers/10.1038/s41467-024-46402-9
The paper
Fauseweh, B. (2024). Quantum many-body simulations on digital quantum computers: State-of-the-art and future challenges. Nature Communications. https://doi.org/10.1038/s41467-024-46402-9

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.