Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond

• URL: http://arxiv.org/abs/2209.12653v3
• Date: Mon, 14 Aug 2023 19:00:43 GMT
• Title: Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond
• Authors: Hongzheng Zhao, Marin Bukov, Markus Heyl, and Roderich Moessner
• Abstract summary: Simulation of continuous time evolution requires time discretization on both classical and quantum computers. We introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables. Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 which 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 usual Trotterized dynamics is facing 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 potentially a wide range of applicability. We demonstrate the capabilities by enforcing gauge invariance which is crucial for a faithful and long-sought quantum simulation of lattice gauge theories. Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws [0.0]
  Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. We present an adaptive Trotterization algorithm to cope with time-dependent Hamiltonians. We validate the algorithm for a time-dependent quantum spin chain, demonstrating that it can outperform the conventional Trotter algorithm with a fixed step size at a controlled error.
  arXiv  Detail & Related papers  (2023-07-19T09:20:02Z)
• Hybrid quantum gap estimation algorithm using a filtered time series [0.0]
  We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution. We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap. Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
  arXiv  Detail & Related papers  (2022-12-28T18:59:59Z)
• Diabatic Quantum Annealing for the Frustrated Ring Model [0.7046417074932257]
  Adiabatic evolutions can lead to evolution times that scale exponentially with the system size. We show that non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown.
  arXiv  Detail & Related papers  (2022-12-05T22:16:17Z)
• Improved Quantum Computing with the Higher-order Trotter Decomposition [9.713857446596721]
  We use Trotter decompositions to reduce the propagator into a combination of single-qubit operations and fixed-time system evolutions. We show that the higher-order Trotter decompositions can provide efficient Ans"atze for the variational quantum algorithm.
  arXiv  Detail & Related papers  (2022-05-05T09:01:14Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Optimizing adiabatic quantum pathways via a learning algorithm [10.664271328456728]
  We propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.
  arXiv  Detail & Related papers  (2020-06-27T06:57:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.