Variational quantum algorithm for non-Markovian quantum dynamics

• URL: http://arxiv.org/abs/2412.00407v1
• Date: Sat, 30 Nov 2024 09:25:23 GMT
• Title: Variational quantum algorithm for non-Markovian quantum dynamics
• Authors: Peter L. Walters, Mohammad U. Sherazi, Fei Wang,
• Abstract summary: We have developed a variational quantum algorithm that is capable of simulating non-Markovian quantum dynamics.<n>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.
• Score: 5.19702850808286
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The simulation of non-Markovian quantum dynamics plays an important role in the understanding of charge and exciton dynamics in the condensed phase environment, and yet it remains computationally expensive on classical computers. We have developed a variational quantum algorithm that is capable of simulating non-Markovian quantum dynamics. The algorithm captures the non-Markovian effect by employing the Ehrenfect trajectories in the path integral formulation and the Monte Carlo sampling of the thermal distribution. We tested the algorithm with the spin-boson model on the quantum simulator and the results match well with the exact ones. 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.

Related papers

• Real-time Sign-Problem-Suppressed Quantum Monte Carlo Algorithm For Noisy Quantum Circuit Simulations [3.6733372067077954]
  We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems. Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution.
  arXiv  Detail & Related papers  (2025-02-26T08:31:23Z)
• 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.<n>It demonstrates the quantum advantage by overcoming the exponential cost on classical computers.<n>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)
• qHEOM: A Quantum Algorithm for Simulating Non-Markovian Quantum Dynamics Using the Hierarchical Equations of Motion [0.0]
  We introduce a quantum algorithm designed to simulate non-Markovian dynamics of open quantum systems. Our approach enables the implementation of arbitrary quantum master equations on noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2024-11-18T20:41:10Z)
• 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)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Ensemble Variational Quantum Algorithm for Non-Markovian Quantum Dynamics [5.84093922354671]
  We develop a variational quantum algorithm capable of simulating non-Markovian dynamics on NISQ devices. We validated the algorithm on the simulator and demonstrated its performance on the IBM quantum device. The framework is naturally adapted to any anharmonic bath with non-linear coupling to the system, and is also well suited for simulating spin chain dynamics in a dissipative environment.
  arXiv  Detail & Related papers  (2024-03-07T20:27:40Z)
• Digital quantum simulation of non-perturbative dynamics of open systems with orthogonal polynomials [0.0]
  We propose the use of the Time Evolving Density operator with Orthogonal Polynomials Algorithm (TEDOPA) on a quantum computer. We show that exponential scalings of computational resources can potentially be avoided for time-evolution simulations of the systems considered in this work.
  arXiv  Detail & Related papers  (2022-03-28T11:16:33Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• 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)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21: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.