Algorithmic Shadow Spectroscopy

Abstract

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 post-processing classical shadows of time-evolved quantum states to extract a large number of time-periodic signals $N_o\propto 10^8$, whose frequencies correspond to Hamiltonian energy differences with Heisenberg-limited precision. We provide strong analytical guarantees that (a) quantum resources scale as $O(\log N_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 $\propto \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 orders of magnitude fewer number of shots than typical near-term quantum algorithms -- as low as 10 shots per timestep is 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.

33 pages, 14 figures, new results with hardware and figures

References in corpus (81)

• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Many body localization and thermalization in quantum statistical mechanics
• Efficient classical simulation of slightly entangled quantum computations
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Many-body localization edge in the random-field Heisenberg chain
• Hamiltonian Simulation by Qubitization
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum Error Mitigation
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Toward the first quantum simulation with quantum speedup
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid quantum-classical algorithms and quantum error mitigation
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Variational Quantum Computation of Excited States
• Characterizing Quantum Gates via Randomized Benchmarking
• Theory of variational quantum simulation
• Fermionic transport in a homogeneous Hubbard model: Out-of-equilibrium dynamics with ultracold atoms
• Observation of antiferromagnetic correlations in the Hubbard model with ultracold atoms
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• A random compiler for fast Hamiltonian simulation
• Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
• Subspace-search variational quantum eigensolver for excited states
• Undecidability of the Spectral Gap (short version)
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Variational quantum algorithms for discovering Hamiltonian spectra
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
• Efficient estimation of Pauli observables by derandomization
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Emerging quantum computing algorithms for quantum chemistry
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Quantum circuits for strongly correlated quantum systems
• Fermionic partial tomography via classical shadows
• Exponential Error Suppression for Near-Term Quantum Devices
• Entanglement Hamiltonian Tomography in Quantum Simulation
• Elementary excitations in gapped quantum spin systems
• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Adiabatic state preparation study of methylene
• Matchgate Shadows for Fermionic Quantum Simulation
• Exact and efficient Lanczos method on a quantum computer
• Mitigating algorithmic errors in Hamiltonian simulation
• Experimentally scalable protocol for identification of correctable codes
• Multicore Quantum Computing
• Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
• Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Mitigating Coherent Noise Using Pauli Conjugation
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks
• Evaluating energy differences on a quantum computer with robust phase estimation
• Resource Estimation for Quantum Variational Simulations of the Hubbard Model
• Shallow shadows: Expectation estimation using low-depth random Clifford circuits
• Measurement cost of metric-aware variational quantum algorithms
• The Dominant Eigenvector of a Noisy Quantum State
• Quantum natural gradient generalised to noisy and non-unitary circuits
• Compilation by stochastic Hamiltonian sparsification
• Measuring Arbitrary Physical Properties in Analog Quantum Simulation
• QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
• Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers
• Quantum Error Mitigated Classical Shadows
• Variational quantum simulation: a case study for understanding warm starts
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Noise-resilient phase estimation with randomized compiling
• Molecular Excited State Calculations with Adaptive Wavefunctions on a Quantum Eigensolver Emulation: Reducing Circuit Depth and Separating Spin States
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
• Probabilistic Interpolation of Quantum Rotation Angles
• Randomized gap and amplitude estimation
• Can shallow quantum circuits scramble local noise into global white noise?
• Simulating spectroscopy experiments with a superconducting quantum computer
• Sparse Probabilistic Synthesis of Quantum Operations

Cited by in corpus (9)

• Efficient Quantum Simulation of QCD Jets on the Light Front
• In the shadow of the Hadamard test: Using the garbage state for good and further modifications
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• Computing n-time correlation functions without ancilla qubits
• Biased Estimator Channels for Classical Shadows
• Exponential distillation of dominant eigenproperties
• Classical post-processing approach for quantum amplitude estimation
• Simulating Electron Transfer on Noisy Quantum Computers
• Short-time simulation of quantum dynamics by Pauli measurements