Short-time simulation of quantum dynamics by Pauli measurements
arXiv:2412.08719 · doi:10.1103/6ggs-y392
Abstract
Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here, we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical post-processing using a truncated Taylor series approach. While limited to short simulation times, our hybrid quantum-classical method is equipped with rigorous error bounds. It is extendable to estimate low-order Taylor approximations of smooth, time-dependent functions of tractable linear combinations of measurable operators. These insights can be made use of in the context of Hamiltonian learning and device verification, short-time imaginary time evolution, or the application of intractable operations to sub-universal quantum simulators in classical post-processing.
10 pages, 1 figure
References in corpus (45)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Time-dependent density-matrix renormalization-group using adaptive effective Hilbert spaces
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Logical quantum processor based on reconfigurable atom arrays
- Hamiltonian Simulation by Qubitization
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Measurement-Induced Phase Transitions in the Dynamics of Entanglement
- Quantum error correction below the surface code threshold
- Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
- Tensor networks for complex quantum systems
- A Theory of Trotter Error
- The randomized measurement toolbox
- A random compiler for fast Hamiltonian simulation
- Quantum certification and benchmarking
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Entanglement phase transitions in measurement-only dynamics
- Efficient estimation of Pauli observables by derandomization
- Faster quantum simulation by randomization
- Learning a local Hamiltonian from local measurements
- The Dynamics of 1D Quantum Spin Systems Can Be Approximated Efficiently
- Theory of quantum system certification: a tutorial
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- A randomized quantum algorithm for statistical phase estimation
- Theoretical and Experimental Perspectives of Quantum Verification
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Exploring Large-Scale Entanglement in Quantum Simulation
- Efficient and feasible state tomography of quantum many-body systems
- Quantum simulators, continuous-time automata, and translationally invariant systems
- Shallow shadows: Expectation estimation using low-depth random Clifford circuits
- Shorter gate sequences for quantum computing by mixing unitaries
- Overlapped grouping measurement: A unified framework for measuring quantum states
- Classical simulation of short-time quantum dynamics
- Randomizing multi-product formulas for Hamiltonian simulation
- Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
- Dynamical structure factors of dynamical quantum simulators
- Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
- Faster quantum and classical SDP approximations for quadratic binary optimization
- Guaranteed recovery of quantum processes from few measurements
- Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
- Estimating expectation values using approximate quantum states
- Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
- Robustly learning the Hamiltonian dynamics of a superconducting quantum processor
- Algorithmic Shadow Spectroscopy