Hybridized Methods for Quantum Simulation in the Interaction Picture

Abstract

Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic advantages for some Hamiltonians, but incurs prohibitive constant factors and is incompatible with methods like qubitization. We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations over known algorithms. These approaches show asymptotic improvements over the individual methods that comprise them and further make interaction picture simulation methods practical in the near term. Physical applications of these hybridized methods yield a gate complexity scaling as ${\log }^2\Lambda$ in the electric cutoff $\Lambda$ for the Schwinger Model and independent of the electron density for collective neutrino oscillations, outperforming the scaling for all current algorithms with these parameters. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $\lambda$ used to impose an energy cost on time-evolution into an unphysical subspace.

References in corpus (14)

• Simulated Quantum Computation of Molecular Energies
• Exponential algorithmic speedup by quantum walk
• A Grand Unification of Quantum Algorithms
• A new quantum ripple-carry addition circuit
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Novel constructions for the fault-tolerant Toffoli gate
• Coherent Development of Neutrino Flavor in the Supernova Environment
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Simulation of Collective Neutrino Oscillations on a Quantum Computer
• Entanglement and Many-Body effects in Collective Neutrino Oscillations
• Dynamical Phase Transitions in models of Collective Neutrino Oscillations
• Fast Black-Box Quantum State Preparation
• 3-Local Hamiltonian is QMA-complete

Cited by in corpus (30)

• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Provably accurate simulation of gauge theories and bosonic systems
• Toward Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations
• On the complexity of implementing Trotter steps
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• qSWIFT: High-order randomized compiler for Hamiltonian simulation
• Composite Quantum Simulations
• Quantum simulation of battery materials using ionic pseudopotentials
• Importance sampling for stochastic quantum simulations
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• A stochastic quantum Krylov protocol with double factorized Hamiltonians
• Qutrit and Qubit Circuits for Three-Flavor Collective Neutrino Oscillations
• Randomized measurement protocols for lattice gauge theories
• Calculating the many-body density of states on a digital quantum computer
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• End-to-end complexity for simulating the Schwinger model on quantum computers
• Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence
• Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
• Fault-tolerant simulation of Lattice Gauge Theories with gauge covariant codes
• Statistics of topological defects across a phase transition in a digital superconducting quantum processor
• Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation
• Diagnosing thermalization dynamics of non-Hermitian quantum systems via GKSL master equations
• Coarse-grained effective Hamiltonian via the Magnus Expansion for a three-level system
• Phase estimation with partially randomized time evolution
• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation
• Halving the cost of quantum multiplexed rotations