Self-healing of Trotter error in digital adiabatic state preparation

Abstract

Adiabatic time evolution can be used to prepare a complicated quantum many-body state from one that is easier to synthesize and Trotterization can be used to implement such an evolution digitally. The complex interplay between non-adiabaticity and digitization influences the infidelity of this process. We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $\mathcal{O}(T^{-2}\delta t^2)$ instead of $\mathcal{O}(T^2\delta t^2)$ expected from general Trotter error bounds, where $\delta t$ is the time step and $T$ is the total time. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$\delta t$ digitized evolutions still decrease for a wide variety of Hamiltonians. It also establishes a correspondence between the Quantum Approximate Optimization Algorithm (QAOA) and digitized quantum annealing.

5+ pages and Appendices

References in corpus (3)

• Simulated Quantum Computation of Molecular Energies
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Experimental implementation of an adiabatic quantum optimization algorithm

Cited by in corpus (22)

• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Krylov complexity and Trotter transitions in unitary circuit dynamics
• Entanglement accelerates quantum simulation
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
• Realization of programmable Ising models in a trapped-ion quantum simulator
• Experimental Demonstration of Break-Even for the Compact Fermionic Encoding
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
• Dilution of error in digital Hamiltonian simulation
• Quantum metrology enhanced by the $XY$ spin interaction in a generalized Tavis-Cummings model
• Quantum ergodicity and scrambling in quantum annealers
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Calculating potential energy surfaces with quantum computers by measuring only the density along adiabatic transitions
• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
• Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
• Validity condition for high-fidelity Digitized Quantum Annealing
• Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem
• Lattice Holography on a Quantum Computer
• Hidden local adiabatic ramp in the modulated time evolution and the quantum approximate optimization algorithm
• Error Interference in Quantum Simulation
• Nonadiabatic Self-Healing of Trotter Errors in Digitized Counterdiabatic Dynamics
• Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators