Structure-Aware Variance Reduction for Unbiased Randomized Hamiltonian Simulation
quant-ph
Submitted: 2026-06-22
Updated: 2026-09-17
Comments: 31 pages, 6 pages
Code: https://github.com/fredrikhassel/CTEPAI
License: http://creativecommons.org/licenses/by/4.0/
The gist: Randomized Hamiltonian simulation methods are often governed by a trade-off between systematic bias and sampling overhead.
Terminology
Abstract
Randomized Hamiltonian simulation methods are often governed by a trade-off between systematic bias and sampling overhead. We study how classical variance-reduction techniques can be applied to such methods without changing their mean channel, and therefore without introducing additional bias. As a motivating unbiased estimator, we formulate continuous time-evolution probabilistic angle interpolation (continuous TE-PAI), a quasiprobabilistic random-circuit protocol whose remaining Monte Carlo error is purely statistical. Continuous TE-PAI removes Trotter discretization error with finite-depth random circuits, whereas deterministic Trotterization does so only in the infinite-depth limit. Further, in tensor-network simulations, we demonstrate that discretization error can cause an unphysical exponential growth in the bond dimension required for Trotterized simulations, whereas comparable-depth continuous TE-PAI circuits avoid this growth. We then show that the variance of randomized product-formula-based estimators admits a canonical decomposition into a classical counting component and a quantum ordering component such that the dominant simulation overhead results from the non-commutative parts of the Hamiltonian dynamics. Motivated by this decomposition, we achieve an about70% error-reduction using the counting-component for small systems whereas our tensor-network simulations of n=30 spin-chain dynamics use coarser statistics tailored to the observable and estimator attaining a negligible bias and a reduction of about 80% leading to about91% and about96% sampling-cost reductions, respectively.
Sources
- Importance sampling for stochastic quantum simulations
- STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer
- Stratified Sampling for Quasi-Probability Decompositions
- MLMC-qDRIFT: Multilevel Variance Reduction for Randomized Quantum Hamiltonian Simulation
- Benchmarking Quantum Processor Performance at Scale
- Low-Resource Quantum Energy Gap Estimation via Randomization
- Correcting and extending Trotterized quantum many-body dynamics
- Explicit error bounds with commutator scaling for time-dependent product and multi-product formulas
- Characterization and Verification of Trotterized Digital Quantum Simulation via Hamiltonian and Liouvillian Learning
- Time-evolution methods for matrix-product states
- Proof of Aldous' spectral gap conjecture
- Operator scrambling and quantum chaos
- Quantum simulation of many-body dynamics with noise-robust Trotter decomposition based on symmetric structures
- Beyond Commutativity: Redesigning Trotter Decomposition via Local Symmetry
- More efficient Clifford+T synthesis for small-angle rotations and application to Trotterization
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians