Polynomial time and space quantum algorithm for the simulation of non-Markovian quantum dynamics

• URL: http://arxiv.org/abs/2411.18168v1
• Date: Wed, 27 Nov 2024 09:25:17 GMT
• Title: Polynomial time and space quantum algorithm for the simulation of non-Markovian quantum dynamics
• Authors: Avin Seneviratne, Peter L. Walters, Fei Wang,
• Abstract summary: 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.
• Score: 5.19702850808286
• License:
• Abstract: In this work, we developed an efficient quantum algorithm for the simulation of non-Markovian quantum dynamics, based on the Feynman path integral formulation. The algorithm scales polynomially with the number of native gates and the number of qubits, and has no classical overhead. It demonstrates the quantum advantage by overcoming the exponential cost on classical computers. In addition, the algorithm is efficient regardless of whether the temporal entanglement due to non-Markovianity is low or high, making it a unified framework for simulating non-Markovian dynamics in open quantum system.

Related papers

• Variational quantum algorithm for non-Markovian quantum dynamics [5.19702850808286]
  We have developed a variational quantum algorithm that is capable of simulating non-Markovian quantum dynamics. The algorithm naturally fits into the parallel computing platform of the NISQ devices and is well suited for anharmonic system-bath interactions and multi-state systems.
  arXiv  Detail & Related papers  (2024-11-30T09:25:23Z)
• 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)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics [42.29248343585333]
  We benchmark quantum hardware and error mitigation techniques on up to 133 qubits. We show reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates. Results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning.
  arXiv  Detail & Related papers  (2024-04-11T18:00:05Z)
• Low-Rank Variational Quantum Algorithm for the Dynamics of Open Quantum Systems [0.5120567378386615]
  A variational quantum algorithm is developed to simulate the real-time evolution of the density matrix governed by the Lindblad master equation. The algorithm encodes each pure state of the statistical mixture as a parametrized quantum circuit. Two variational Ans"atze are proposed, and their effectiveness is assessed in the simulation of the dynamics of a 2D dissipative transverse field Ising model.
  arXiv  Detail & Related papers  (2024-03-09T13:23:14Z)
• Classical simulation of short-time quantum dynamics [0.0]
  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.
  arXiv  Detail & Related papers  (2022-10-20T18:00:04Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Succinct Description and Efficient Simulation of Non-Markovian Open Quantum Systems [1.713291434132985]
  Non-Markovian open quantum systems represent the most general dynamics when the quantum system is coupled with a bath environment. We provide a succinct representation of the dynamics of non-Markovian open quantum systems with quantifiable error. We also develop an efficient quantum algorithm for simulating such dynamics.
  arXiv  Detail & Related papers  (2021-11-05T03:35:50Z)
• 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)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48: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.