Success of digital adiabatic simulation with large Trotter step
arXiv:2107.06404 · doi:10.1103/PhysRevA.104.052603
Abstract
The simulation of adiabatic evolution has deep connections with Adiabatic Quantum Computation, the Quantum Approximate Optimization Algorithm and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. We show that with additional conditions, the circuit depth can be linear in simulation time . The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed as the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1). The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2). Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3). As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.
References in corpus (37)
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- A Quantum Approximate Optimization Algorithm
- Adiabatic Quantum Computing
- Hamiltonian Simulation by Qubitization
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Robustness of adiabatic quantum computation
- A Theory of Trotter Error
- Digitized adiabatic quantum computing with a superconducting circuit
- Bounds for the adiabatic approximation with applications to quantum computation
- A random compiler for fast Hamiltonian simulation
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- Adiabatic Quantum Computation in Open Systems
- Inconsistency in the application of the adiabatic theorem
- Consistency of the Adiabatic Theorem
- Nearly optimal lattice simulation by product formulas
- Near-optimal ground state preparation
- Many-body quantum chaos: Analytic connection to random matrix theory
- Quantum localization bounds Trotter errors in digital quantum simulation
- Optimal Protocols in Quantum Annealing and QAOA Problems
- Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
- Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
- Digitized-counterdiabatic quantum approximate optimization algorithm
- Counterdiabaticity and the quantum approximate optimization algorithm
- Digital Quantum Simulation, Trotter Errors, and Quantum Chaos of the Kicked Top
- Rapid adiabatic preparation of injective PEPS and Gibbs states
- An Elementary Proof of the Quantum Adiabatic Theorem
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Hamiltonian Simulation in the Interaction Picture
- Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits
- Destructive Error Interference in Product-Formula Lattice Simulation
- The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
- Improved Error Bounds for the Adiabatic Approximation
- Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion
- Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm
- Improved Bounds for Eigenpath Traversal
- Fast digital methods for adiabatic state preparation
- Spectral Analysis of Product Formulas for Quantum Simulation
Cited by in corpus (10)
- Quantum Machine Learning for Chemistry and Physics
- Digitized-Counterdiabatic Quantum Optimization
- Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
- Self-healing of Trotter error in digital adiabatic state preparation
- Krylov complexity and Trotter transitions in unitary circuit dynamics
- Optimizing Counterdiabaticity by Variational Quantum Circuits
- Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations
- Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
- Quantum ergodicity and scrambling in quantum annealers
- Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem