Success of digital adiabatic simulation with large Trotter step

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 $T$. 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 (9)

• A Quantum Approximate Optimization Algorithm
• Bounds for the adiabatic approximation with applications to quantum computation
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Counterdiabaticity and the quantum approximate optimization algorithm
• An Elementary Proof of the Quantum Adiabatic Theorem
• The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
• 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