Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mi>exp</a:mi> <a:mo></a:mo> <a:mo stretchy="false">(</a:mo> <a:mo>−</a:mo> <a:mi mathvariant="normal">Δ</a:mi> <a:mi>E</a:mi> <a:msub> <a:mi>t</a:mi> <a:mi>max</a:mi> </a:msub> <a:mo stretchy="false">)</a:mo> </a:math> , where <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" display="inline"> <f:mi mathvariant="normal">Δ</f:mi> <f:mi>E</f:mi> </f:math> is the Hamiltonian spectral gap and <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline"> <i:msub> <i:mi>t</i:mi> <i:mi>max</i:mi> </i:msub> </i:math> is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-12-23
DOI
https://doi.org/10.1103/74s6-3jsz
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Katherine Klymko, Roel Van Beeumen, Susanne F. Yelin, Anonymous et al.
PRX Quantum
Quantum Computing Algorithms and Architecture
article

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Katherine Klymko, Roel Van Beeumen, Susanne F. Yelin, Anonymous, Hong-Ye Hu, Daan Camps, Alex Buzali
article en

Abstract

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mi>exp</a:mi> <a:mo></a:mo> <a:mo stretchy="false">(</a:mo> <a:mo>−</a:mo> <a:mi mathvariant="normal">Δ</a:mi> <a:mi>E</a:mi> <a:msub> <a:mi>t</a:mi> <a:mi>max</a:mi> </a:msub> <a:mo stretchy="false">)</a:mo> </a:math> , where <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" display="inline"> <f:mi mathvariant="normal">Δ</f:mi> <f:mi>E</f:mi> </f:math> is the Hamiltonian spectral gap and <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline"> <i:msub> <i:mi>t</i:mi> <i:mi>max</i:mi> </i:msub> </i:math> is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

PRX QuantumVol. 7(1)
Lawrence Berkeley National Laboratory (US), Harvard University Press (US)
Openalex Percentile: Top 19%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.