Classical simulation of short-time quantum dynamics

• URL: http://arxiv.org/abs/2210.11490v2
• Date: Tue, 11 Jul 2023 12:45:31 GMT
• Title: Classical simulation of short-time quantum dynamics
• Authors: Dominik S. Wild, \'Alvaro M. Alhambra
• Abstract summary: We present classical algorithms for approximating the dynamics of local observables and nonlocal quantities. We establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this problem in order to benchmark quantum simulators and to delineate the regime of quantum advantage. Here we present classical algorithms for approximating the dynamics of local observables and nonlocal quantities such as the Loschmidt echo, where the evolution is governed by a local Hamiltonian. For short times, their computational cost scales polynomially with the system size and the inverse of the approximation error. In the case of local observables, the proposed algorithm has a better dependence on the approximation error than algorithms based on the Lieb-Robinson bound. Our results use cluster expansion techniques adapted to the dynamical setting, for which we give a novel proof of their convergence. This has important physical consequences besides our efficient algorithms. In particular, we establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.

Related papers

• Quantum error mitigation in optimized circuits for particle-density correlations in real-time dynamics of the Schwinger model [0.0]
  In principle, it is possible to calculate non-equal-time correlation functions, from which one can detect interesting phenomena. In practice, these calculations are strongly affected by noise, due to the complexity of the required quantum circuits. We derive a digital circuit implementation of the time-evolution of particle-density correlation operators and their correlation, comparing results from exact evolution, bare noisy simulations and simulations with different error mitigation techniques.
  arXiv  Detail & Related papers  (2025-01-18T17:32:59Z)
• Time-dependent Neural Galerkin Method for Quantum Dynamics [42.81677042059531]
  We introduce a classical computational method for quantum dynamics that relies on a global-in-time variational principle. We showcase the method's effectiveness simulating global quantum quenches in the paradigmatic Transverse-Field Ising model in both 1D and 2D. Overall, the method presented here shows competitive performance compared to state-of-the-art time-dependent variational approaches.
  arXiv  Detail & Related papers  (2024-12-16T13:48:54Z)
• Polynomial time and space quantum algorithm for the simulation of non-Markovian quantum dynamics [5.19702850808286]
  We developed an efficient quantum algorithm for the simulation of non-Markovian quantum dynamics, based on the Feynman path. It demonstrates the quantum advantage by overcoming the exponential cost on classical computers. The algorithm is efficient regardless of whether entanglement due to non-Markovianity is low or high, making it a unified framework for non-Markovian dynamics in open quantum system.
  arXiv  Detail & Related papers  (2024-11-27T09:25:17Z)
• An Efficient Classical Algorithm for Simulating Short Time 2D Quantum Dynamics [2.891413712995642]
  We introduce an efficient classical algorithm for simulating short-time dynamics in 2D quantum systems. Our results reveal the inherent simplicity in the complexity of short-time 2D quantum dynamics. This work advances our understanding of the boundary between classical and quantum computation.
  arXiv  Detail & Related papers  (2024-09-06T09:59:12Z)
• 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)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms [0.0]
  We propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics.
  arXiv  Detail & Related papers  (2022-08-01T16:00:20Z)
• 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)
• 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)

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.