Abstract
Simulation of continuous-time evolution requires time discretization on both classical and quantum computers. A finer time step improves simulation precision but it inevitably leads to increased computational efforts. This is particularly costly for today’s noisy intermediate-scale quantum computers, where notable gate imperfections limit the circuit depth that can be executed at a given accuracy. Classical adaptive solvers are well developed to save numerical computation times. However, it remains an outstanding challenge to make optimal usage of the available quantum resources by means of adaptive time steps. Here, we introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables. The key conceptual element of our algorithm is a feedback loop that self-corrects the simulation errors by adapting time steps, thereby significantly outperforming conventional Trotter schemes on a fundamental level and reducing the circuit depth. It even allows for a controlled asymptotic long-time error, where the usual Trotterized dynamics faces difficulties. Another key advantage of our quantum algorithm is that any desired conservation law can be included in the self-correcting feedback loop, which has a potentially wide range of applicability. We demonstrate the capabilities by enforcing gauge invariance, which is crucial for a faithful and long-sought-after quantum simulation of lattice gauge theories. Our algorithm can potentially be useful on a more general level whenever time discretization is involved also concerning, e.g., numerical approaches based on time-evolving block-decimation methods.
- Received 26 January 2023
- Accepted 3 July 2023
DOI:https://doi.org/10.1103/PRXQuantum.4.030319
Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.
Published by the American Physical Society
Physics Subject Headings (PhySH)
Popular Summary
Quantum computers have the potential to outperform classical computers in certain tasks. One area of interest is simulating the time evolution of many-body systems when they are far from equilibrium. To simulate the continuous evolution of these systems, we need to discretize time into smaller pieces, both on regular computers and on quantum computers. Using smaller time steps improves the accuracy of the simulation, but it requires more computational power. This is particularly costly for today's noisy intermediate-scale quantum computers, where notable gate imperfections limit the simulation time that can be achieved at a given accuracy. Classical adaptive solvers are well developed to save numerical computation times. However, it remains an outstanding challenge to make optimal usage of the available quantum resources by means of adaptive time steps.
Here, we introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables. The key conceptual element of our algorithm is a feedback loop that self-corrects the simulation errors by adapting the time-step size, thereby significantly outperforming conventional fixed-step schemes on a fundamental level and reducing the circuit depth. It even allows for a controlled long-time error, where the usual fixed-step scheme faces difficulties. Another key advantage of our algorithm is that any desired conservation law can be included in the self-correcting feedback loop, which has a potentially wide range of applicability.
Our algorithm can be applied in more general situations that involve time discretization, for instance, quantum imaginary time evolution, time-dependent Hamiltonian simulation, and classical numerical approaches based on time-evolving block decimation methods.