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 nonadiabaticity 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 O(T^{-2}δt^{2}) instead of O(T^{2}δt^{2}) expected from general Trotter error bounds, where δ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-δt digitized evolutions still decrease for a wide variety of Hamiltonians. It also establishes a correspondence between the quantum approximate optimization algorithm and digitized quantum annealing.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1103/PhysRevLett.131.060602 | DOI Listing |
J Chem Phys
January 2025
Department of Chemistry, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada.
In this work, we propose a path integral Monte Carlo approach based on discretized continuous degrees of freedom and rejection-free Gibbs sampling. The ground state properties of a chain of planar rotors with dipole-dipole interactions are used to illustrate the approach. Energetic and structural properties are computed and compared to exact diagonalization and numerical matrix multiplication for N ≤ 3 to assess the systematic Trotter factorization error convergence.
View Article and Find Full Text PDFEntropy (Basel)
October 2024
Department of Physics, Shanghai University, Shanghai 200444, China.
Digitized counter-diabatic (CD) optimization algorithms have been proposed and extensively studied to enhance performance in quantum computing by accelerating adiabatic processes while minimizing energy transitions. While adding approximate counter-diabatic terms can initially introduce adiabatic errors that decrease over time, Trotter errors from decomposition approximation persist. On the other hand, increasing the high-order nested commutators for CD terms may improve adiabatic errors but could also introduce additional Trotter errors.
View Article and Find Full Text PDFPhys Rev Lett
July 2024
Max Planck Institute for the Physics of Complex Systems, Nöthnitzer Straße 38, 01187 Dresden, Germany.
Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. On current quantum processors with notable gate imperfections, there is a critical trade-off between improved accuracy for finer time steps, and increased error rate on account of the larger circuit depth. We present an adaptive Trotterization algorithm to cope with time dependent Hamiltonians, where we propose a concept of piecewise "conserved" quantities to estimate errors in the time evolution between two (nearby) points in time; these allow us to bound the errors accumulated over the full simulation period.
View Article and Find Full Text PDFJ Comput Chem
October 2024
Department of Chemistry and Research Center for Smart Molecules, Faculty of Science, Rikkyo University, Toshima-ku, Japan.
J Chem Theory Comput
May 2024
Quantum Simulation Technologies Inc., Boston, Massachusetts 02135, United States.
We describe a matrix product state (MPS) extension for the Fermionic Quantum Emulator (FQE) software library. We discuss the theory behind symmetry-adapted MPSs for approximating many-body wave functions of spin-1/2 Fermions, and we present an open-source, MPS-enabled implementation of the FQE interface (MPS-FQE). The software uses the open-source pyblock3 and block2 libraries for most elementary tensor operations, and it can largely be used as a drop-in replacement for FQE that allows for more efficient but approximate emulation of larger Fermionic circuits.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!