RECORD
Shadow Hamiltonian Simulation
Quantum Physics · Submitted 31 Jul 2024
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim This evolution can be simulated on a quantum computer efficiently under broad conditions.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Simulating quantum dynamics is one of the most important applications of quantum computers. Traditional approaches for quantum simulation involve preparing the full evolved state of the system and then measuring some physical quantity. Here, we present a different and novel approach to quantum simulation that uses a compressed quantum state that we call the ``shadow state''. The amplitudes of this shadow state are proportional to the time-dependent expectations of a specific set of operators of interest, and it evolves according to its own Schr\"odinger equation. This evolution can be simulated on a quantum computer efficiently under broad conditions. Applications of this approach to quantum simulation problems include simulating the dynamics of exponentially large systems of free fermions or free bosons, the latter example recovering a recent algorithm for simulating exponentially many classical harmonic oscillators. These simulations are hard for classical methods and also for traditional quantum approaches, as preparing the full states would require exponential resources. Shadow Hamiltonian simulation can also be extended to simulate expectations of more complex operators such as two-time correlators or Green's functions, and to study the evolution of operators themselves in the Heisenberg picture.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Simulating quantum dynamics is one of the most important applications of quantum computers. | background 1.00 | 0.04 | 0.02 | asserted 1.00 |
| s1 | Traditional approaches for quantum simulation involve preparing the full evolved state of the system and then measuring some physical quantity. | background 1.00 | 0.04 | 0.02 | asserted 1.00 |
| s2 | Here, we present a different and novel approach to quantum simulation that uses a compressed quantum state that we call the ``shadow state''. | contribution 0.99 | 0.91 | 0.30 | asserted 1.00 |
| s3 | The amplitudes of this shadow state are proportional to the time-dependent expectations of a specific set of operators of interest, and it evolves according to its own Schr\"odinger equation. | method 0.73 | 0.78 | 0.16 | asserted 1.00 |
| s4 | This evolution can be simulated on a quantum computer efficiently under broad conditions. | result 0.54 | 0.70 | 0.24 | asserted 0.92 |
| s5 | Applications of this approach to quantum simulation problems include simulating the dynamics of exponentially large systems of free fermions or free bosons, the latter example recovering a recent algorithm for simulating exponentially many classical harmonic oscillators. | contribution 0.68 | 0.65 | 0.16 | asserted 0.90 |
| s6 | These simulations are hard for classical methods and also for traditional quantum approaches, as preparing the full states would require exponential resources. | gap 0.38 | 0.19 | 0.10 | asserted 1.00 |
| s7 | Shadow Hamiltonian simulation can also be extended to simulate expectations of more complex operators such as two-time correlators or Green's functions, and to study the evolution of operators themselves in the Heisenberg picture. | contribution 0.89 | 0.78 | 0.10 | asserted 0.63 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Simulating quantum dynamics is one of the most important applications of quantum computers. Traditional approaches for quantum simulation involve preparing the full evolved state of the system and then measuring some physical quantity. Here, we present a different and novel approach to quantum simulation that uses a compressed quantum state that we call the ``shadow state''. The amplitudes of this shadow state are proportional to the time-dependent expectations of a specific set of operators of interest, and it evolves according to its own Schr\"odinger equation. This evolution can be simulated on a quantum computer efficiently under broad conditions. Applications of this approach to quantum simulation problems include simulating the dynamics of exponentially large systems of free fermions or free bosons, the latter example recovering a recent algorithm for simulating exponentially many classical harmonic oscillators. These simulations are hard for classical methods and also for traditional quantum approaches, as preparing the full states would require exponential resources. Shadow Hamiltonian simulation can also be extended to simulate expectations of more complex operators such as two-time correlators or Green's functions, and to study the evolution of operators themselves in the Heisenberg picture.
Human review
References
How the literature uses it
4 arXiv papers cite this in 7 sentences
Papers citing it · 2 sentences without a confident label
Uses its method or tool 3 papers
-
In this Letter, we derive an efficient and exact ansatz for the many-fermion wave function on quantum devices by combining concepts from shadow tomography [ref] and reduced density matrix theory [ref] .
Shadow Ansatz for the Many-Fermion Wave Function in Scalable Molecular Simulations on Quantum Computing Devices · Introduction · 0.90
-
To this end, we follow an encoding scheme that has been used for classical oscillators [ref] and more recently for shadow Hamiltonian simulation [ref] .
Complexity of Quadratic Bosonic Hamiltonian Simulation: BQP-Completeness and PostBQP-Hardness · Introduction · 0.99
-
An alternative approach is to encode observables in a quantum state using techniques like shadow Hamiltonian simulation [ref] .
Quantum linear algebra for disordered electrons · Estimating physical quantities · 0.96
Cites it as background 1 paper
-
Classical shadows has recently emerged as a powerful framework for learning the expectation values of a large number of operators from few copies of a state $ρ$ of interest [ref] .
Real classical shadows · Introduction · 1.00
What it cites · 3 sentences without a confident label
Compares with 1 paper
-
We note that our shadow Hamiltonian simulation approach for this example is clearly different from other approaches aimed at simulating bosonic field theories formulated in the Schrödinger picture approach [ref] .
Quantum simulations of one dimensional quantum systems · Free bosons · 1.00
Cites as background 4 papers
-
A plethora of Hamiltonian simulation algorithms exist, with various complexities in terms of the relevant problem parameters, including the time $t$, the error $ϵ$ to which the final state is prepared, and intrinsic properties of the Hamiltonian such as the magnitude of interaction strengths (cf. [ref] ).
Hamiltonian simulation for low-energy states with optimal time dependence · Introduction · 1.00
-
A plethora of Hamiltonian simulation algorithms exist, with various complexities in terms of the relevant problem parameters, including the time $t$, the error $ϵ$ to which the final state is prepared, and intrinsic properties of the Hamiltonian such as the magnitude of interaction strengths (cf. [ref] ).
A Simple Proof that Toffoli and Hadamard are Quantum Universal · Introduction · 1.00
-
Depending on the choice of operator basis, this unitary may also be called the super-operator [ref] or Pauli transfer matrix [ref] .
Tensor networks and graphical calculus for open quantum systems · Comparison with the transfer matrix method · 0.94
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.