Learning effective Hamiltonians for adaptive time-evolution quantum algorithms

• URL: http://arxiv.org/abs/2406.06198v1
• Date: Mon, 10 Jun 2024 11:50:38 GMT
• Title: Learning effective Hamiltonians for adaptive time-evolution quantum algorithms
• Authors: Hongzheng Zhao, Ao Chen, Shu-Wei Liu, Marin Bukov, Markus Heyl, Roderich Moessner,
• Abstract summary: Digital quantum simulation of many-body dynamics relies on Trotterization to decompose the target time evolution into elementary quantum gates. Recent advances have outlined protocols enabling more efficient adaptive Trotter protocols. We propose to use quantum Hamiltonian learning to numerically obtain the effective Hamiltonian and apply it on the recently introduced ADA-Trotter algorithm.
• Score: 0.08796261172196743
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Digital quantum simulation of many-body dynamics relies on Trotterization to decompose the target time evolution into elementary quantum gates operating at a fixed equidistant time discretization. Recent advances have outlined protocols enabling more efficient adaptive Trotter protocols, which have been shown to exhibit a controlled error in the dynamics of local observables and correlation functions. However, it has remained open to which extent the errors on the actual generator of the dynamics, i.e., the target many-body Hamiltonian, remain controlled. Here, we propose to use quantum Hamiltonian learning to numerically obtain the effective Hamiltonian and apply it on the recently introduced ADA-Trotter algorithm as a concrete demonstration. Our key observation is that deviations from the target generator remain bounded on all simulation times. This result suggests that the ADA-Trotter not only generates reliable digital quantum simulation of local dynamics, but also controllably approximates the global quantum state of the target system. Our proposal is sufficiently general and readily applicable to other adaptive time-evolution algorithms.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• 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)
• Characterization and Verification of Trotterized Digital Quantum Simulation via Hamiltonian and Liouvillian Learning [0.0]
  We propose Floquet Hamiltonian learning to reconstruct the experimentally realized Floquet Hamiltonian order-by-order. We show that our protocol provides the basis for feedback-loop design and calibration of new types of quantum gates.
  arXiv  Detail & Related papers  (2022-03-29T18:29:01Z)
• Variational quantum simulation of the imaginary-time Lyapunov control for accelerating the ground-state preparation [17.802280143175235]
  We first propose a Lyapunov control-inspired strategy to accelerate the well-established imaginary-time method for ground-state preparation. To make the method accessible in the noisy intermediate-scale quantum era, we propose a variational form of the algorithm that could work with shallow quantum circuits.
  arXiv  Detail & Related papers  (2021-12-22T10:40:33Z)
• 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)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• 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)
• Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
  Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. Here, we propose an adaptive approach to construct a low-depth time evolution circuit. Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
  arXiv  Detail & Related papers  (2020-11-10T18:00:42Z)
• Entanglement Hamiltonian Tomography in Quantum Simulation [0.0]
  Entanglement in quantum simulators is an outstanding challenge in today's era of intermediate scale quantum devices. Here we discuss an efficient tomographic protocol for reconstructing reduced density matrices and entanglement spectra for spin systems. We show the validity and efficiency of the protocol for a long-range Ising model in 1D using numerical simulations.
  arXiv  Detail & Related papers  (2020-09-18T18:12:22Z)

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.