Algorithmic Shadow Spectroscopy
We present shadow spectroscopy as a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) beyond performing time evolution and measurements. The approach builds on the fundamental feature that every observab...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2025-03-01
|
| Series: | PRX Quantum |
| Online Access: | http://doi.org/10.1103/PRXQuantum.6.010352 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850040655031566336 |
|---|---|
| author | Hans Hon Sang Chan Richard Meister Matthew L. Goh Bálint Koczor |
| author_facet | Hans Hon Sang Chan Richard Meister Matthew L. Goh Bálint Koczor |
| author_sort | Hans Hon Sang Chan |
| collection | DOAJ |
| description | We present shadow spectroscopy as a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) beyond performing time evolution and measurements. The approach builds on the fundamental feature that every observable property of a quantum system must evolve according to the same harmonic components: we can reveal them by postprocessing classical shadows of time-evolved quantum states to extract a large number of time-periodic signals N_{o}∝10^{8}, whose frequencies correspond to Hamiltonian energy differences with precision limited as ϵ∝1/T for simulation time T. We provide strong analytical guarantees that (a) quantum resources scale as O(logN_{o}), while the classical computational complexity is linear O(N_{o}), (b) the signal-to-noise ratio increases with the number of processed signals as ∝sqrt[N_{o}], and (c) spectral peak positions are immune to reasonable levels of noise. We demonstrate our approach on model spin systems and the excited-state conical intersection of molecular CH_{2} and verify that our method is indeed intuitively easy to use in practice, robust against gate noise, amiable to a new type of algorithmic-error mitigation technique, and uses relatively few shots given a reasonable initial state is supplied—we demonstrate that even 10 shots per time step can be sufficient. Finally, we measured a high-quality, experimental shadow spectrum of a spin chain on readily available IBM quantum computers, achieving the same precision as in noise-free simulations without using any advanced error mitigation, and verified scalability in tensor-network simulations of up to 100-qubit systems. |
| format | Article |
| id | doaj-art-609e9c895d874e88b9c7afcb2e547c69 |
| institution | DOAJ |
| issn | 2691-3399 |
| language | English |
| publishDate | 2025-03-01 |
| publisher | American Physical Society |
| record_format | Article |
| series | PRX Quantum |
| spelling | doaj-art-609e9c895d874e88b9c7afcb2e547c692025-08-20T02:56:02ZengAmerican Physical SocietyPRX Quantum2691-33992025-03-016101035210.1103/PRXQuantum.6.010352Algorithmic Shadow SpectroscopyHans Hon Sang ChanRichard MeisterMatthew L. GohBálint KoczorWe present shadow spectroscopy as a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits) beyond performing time evolution and measurements. The approach builds on the fundamental feature that every observable property of a quantum system must evolve according to the same harmonic components: we can reveal them by postprocessing classical shadows of time-evolved quantum states to extract a large number of time-periodic signals N_{o}∝10^{8}, whose frequencies correspond to Hamiltonian energy differences with precision limited as ϵ∝1/T for simulation time T. We provide strong analytical guarantees that (a) quantum resources scale as O(logN_{o}), while the classical computational complexity is linear O(N_{o}), (b) the signal-to-noise ratio increases with the number of processed signals as ∝sqrt[N_{o}], and (c) spectral peak positions are immune to reasonable levels of noise. We demonstrate our approach on model spin systems and the excited-state conical intersection of molecular CH_{2} and verify that our method is indeed intuitively easy to use in practice, robust against gate noise, amiable to a new type of algorithmic-error mitigation technique, and uses relatively few shots given a reasonable initial state is supplied—we demonstrate that even 10 shots per time step can be sufficient. Finally, we measured a high-quality, experimental shadow spectrum of a spin chain on readily available IBM quantum computers, achieving the same precision as in noise-free simulations without using any advanced error mitigation, and verified scalability in tensor-network simulations of up to 100-qubit systems.http://doi.org/10.1103/PRXQuantum.6.010352 |
| spellingShingle | Hans Hon Sang Chan Richard Meister Matthew L. Goh Bálint Koczor Algorithmic Shadow Spectroscopy PRX Quantum |
| title | Algorithmic Shadow Spectroscopy |
| title_full | Algorithmic Shadow Spectroscopy |
| title_fullStr | Algorithmic Shadow Spectroscopy |
| title_full_unstemmed | Algorithmic Shadow Spectroscopy |
| title_short | Algorithmic Shadow Spectroscopy |
| title_sort | algorithmic shadow spectroscopy |
| url | http://doi.org/10.1103/PRXQuantum.6.010352 |
| work_keys_str_mv | AT hanshonsangchan algorithmicshadowspectroscopy AT richardmeister algorithmicshadowspectroscopy AT matthewlgoh algorithmicshadowspectroscopy AT balintkoczor algorithmicshadowspectroscopy |