Cited by 100Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Holographic quantum algorithms for simulating correlated spin systems

Open access
Foss-Feig, Michael, Hayes, David, Dreiling, Joan M., Figgatt, Caroline, Gaebler, John P., Moses, Steven A., Pino, Juan M., Potter, Andrew C.·2021·Physical Review Research

Abstract

We present a suite of ``holographic'' quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin systems, which require far fewer qubits than the number of spins being simulated. The algorithms exploit the equivalence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit reuse, in order to simulate a $D$-dimensional spin system using only a $(D\ensuremath{-}1)$-dimensional subset of qubits along with an ancillary qubit register whose size scales logarithmically in the amount of entanglement present in the simulated state. Ground states can either be directly prepared from a known MPS representation or obtained via a holographic variational quantum eigensolver (holoVQE). Dynamics of MPS under local Hamiltonians for time $t$ can also be simulated with an additional (multiplicative) $\mathrm{poly}(t)$ overhead in qubit resources. These techniques open the door to efficient quantum simulation of MPS with exponentially large bond dimension, including ground states of two- and three-dimensional systems, or thermalizing dynamics with rapid entanglement growth. As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer, achieving within $10(3)%$ of the exact ground-state energy of an infinite chain using only a pair of qubits.

Integrity signals

Registry

Crossref · 10.1103/physrevresearch.3.033002

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • A GHZ fidelity greater than 0.5 is sufficient to witness genuine multipartite entanglement.

    “By comparison, a GHZ fidelity greater than 0.5 is sufficient to witness genuine multipartite entanglement [83].”

    From A Race-Track Trapped-Ion Quantum Processor (2023) · cites this paper as [83]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Foss-Feig, M., Hayes, D., Dreiling, J. M., Figgatt, C., Gaebler, J. P., Moses, S. A., Pino, J. M., & Potter, A. C.
Affiliations
The University of Texas at Austin (US)
Venue
Physical Review Research
Published
2021-07-01
Volume
3
Issue
3
ISSN
2643-1564 (ISSN-L)
OpenAlex
W3022144696
Cited by
100
References
41
Citations by year
2026: 5 · 2025: 21 · 2024: 15 · 2023: 21 · 2022: 23 · 2021: 15
FWCI
6.54
Type
journal article
Language
en
Open access
Locations
  • Physical Review Research (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • arXiv (Cornell University)
Funders
National Science Foundation (DMR-1653007)
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 › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
matrix product states, quantum channels, partial measurements, ground state preparation, entanglement growth, thermalization, antiferromagnetic Heisenberg chain, trapped-ion quantum computer, bond dimension

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