Importance sampling for stochastic quantum simulations

Abstract

Simulating many-body quantum systems is a promising task for quantum computers. However, the depth of most algorithms, such as product formulas, scales with the number of terms in the Hamiltonian, and can therefore be challenging to implement on near-term, as well as early fault-tolerant quantum devices. An efficient solution is given by the stochastic compilation protocol known as qDrift, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. In this work, we unify the qDrift protocol with importance sampling, allowing us to sample from arbitrary probability distributions, while controlling both the bias, as well as the statistical fluctuations. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Moreover, we incorporate recent work on composite channel and compute rigorous bounds on the bias and variance, showing how to choose the number of samples, experiments, and time steps for a given target accuracy. These results lead to a more efficient implementation of the qDrift protocol, both with and without the use of composite channels. Theoretical results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.

arXiv comment17 pages, 9 pages supplemental material

References in corpus (61)

• Quantum Computing in the NISQ era and beyond
• Quantum Simulation
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Hamiltonian Simulation by Qubitization
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Elucidating Reaction Mechanisms on Quantum Computers
• Effective Field Theory for Few-Nucleon Systems
• Toward the first quantum simulation with quantum speedup
• Noise tailoring for scalable quantum computation via randomized compiling
• Quantum Algorithms for Quantum Field Theories
• A Theory of Trotter Error
• Cloud Quantum Computing of an Atomic Nucleus
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• A random compiler for fast Hamiltonian simulation
• Gate count estimates for performing quantum chemistry on small quantum computers
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• Efficient estimation of Pauli observables by derandomization
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Faster quantum simulation by randomization
• Higher Order Decompositions of Ordered Operator Exponentials
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Eigenvector continuation with subspace learning
• Quantum computers as universal quantum simulators: state-of-art and perspectives
• The Spin-Flavor Dependence of Nuclear Forces from Large-N QCD
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Quantum hardware simulating four-dimensional inelastic neutron scattering
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Linear Response on a Quantum Computer
• Ground-State Properties of ${}^4$He and ${}^{16}$O Extrapolated from Lattice QCD with Pionless EFT
• Quantum Computing for Neutrino-nucleus Scattering
• Essential elements for nuclear binding
• Baryon-Baryon Interactions and Spin-Flavor Symmetry from Lattice Quantum Chromodynamics
• A randomized quantum algorithm for statistical phase estimation
• Faster Digital Quantum Simulation by Symmetry Protection
• Quantum computing of the ${}^6$Li nucleus via ordered unitary coupled clusters
• Simulation of Collective Neutrino Oscillations on a Quantum Computer
• Population Monte Carlo algorithms
• Error mitigation via verified phase estimation
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Concentration for random product formulas
• Nearly tight Trotterization of interacting electrons
• Quasielastic lepton scattering and back-to-back nucleons in the short-time approximation
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Quantum phase detection generalisation from marginal quantum neural network models
• Hamiltonian simulation with random inputs
• Compilation by stochastic Hamiltonian sparsification
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Fast-forwarding quantum evolution
• Quantum Simulation of Resonant Transitions for Solving the Eigen-problem of an Effective Water Hamiltonian
• Randomizing multi-product formulas for Hamiltonian simulation
• Quantum Simulation of Nuclear Inelastic Scattering
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations
• Quantum criticality using a superconducting quantum processor
• Optimal Trotterization in universal quantum simulators under faulty control
• Finite-size criticality in fully connected spin models on superconducting quantum hardware
• Short-depth circuits for efficient expectation value estimation
• Structure Factors of Neutron Matter at Finite Temperature
• Quantum Simulation on Noisy Superconducting Quantum Computers
• A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations

Cited by in corpus (11)

• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Quantum error mitigation for Fourier moment computation
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Generalised likelihood profiles for models with intractable likelihoods
• Deep Quantum Circuit Simulations of Low-Energy Nuclear States
• Statistics of topological defects across a phase transition in a digital superconducting quantum processor
• Power of quantum measurement in simulating unphysical operations
• Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
• Phase estimation with partially randomized time evolution
• Quantum Simulation via Stochastic Combination of Unitaries