Ancilla-train quantum algorithm for simulating non-Markovian open quantum systems

• URL: http://arxiv.org/abs/2509.12717v1
• Date: Tue, 16 Sep 2025 06:18:06 GMT
• Title: Ancilla-train quantum algorithm for simulating non-Markovian open quantum systems
• Authors: Hans Michael Christensen, Johannes Agerskov, Frederik Nathan,
• Abstract summary: We present a quantum algorithm for simulating open quantum systems coupled to Gaussian environments valid for any configuration and coupling strength.<n>We show that the algorithm can reproduce the true dynamics of such problems at arbitrary accuracy and, for a broad range of problems, only adds a minor resource cost relative to Trotterized time evolution.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a quantum algorithm for simulating open quantum systems coupled to Gaussian environments valid for any configuration and coupling strength. The algorithm is for instance applicable to problems with strongly coupled, or non-Markovian, environments; problems with multiple environments out of mutual equilibrium; and problems with time-dependent Hamiltonians. We show that the algorithm can reproduce the true dynamics of such problems at arbitrary accuracy and, for a broad range of problems, only adds a minor resource cost relative to Trotterized time evolution; the cost is polynomial in the inverse target accuracy. The algorithm is based on the insight that any Gaussian environment can be represented as a train of ancillary qubits that sequentially interact with the system through a time-local coupling, given by the convolution square root of the bath correlation function; this is a secondary result of our work. Our results open up new applications of quantum computers for efficient simulation of non-equilibrium and open quantum systems.

Related papers

• Direct Equivalence between Dynamics of Quantum Walks and Coupled Classical Oscillators [0.0]
  Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing.<n>In this work, we establish a direct and transparent mapping between these two classes of problems.
  arXiv  Detail & Related papers  (2025-12-03T11:20:52Z)
• 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.<n>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)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• 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)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• 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)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Simulating a ring-like Hubbard system with a quantum computer [0.0]
  We develop a workflow to use current quantum computing hardware for solving quantum many-body problems. We study a four-site Hubbard ring that exhibits a transition from a product state to an intrinsically interacting ground state as hopping amplitudes are changed. We locate this transition and solve for the ground state energy with high quantitative accuracy using a variational quantum algorithm executed on an IBM quantum computer.
  arXiv  Detail & Related papers  (2021-04-13T18:08:09Z)
• 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)
• 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)
• 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)
• Incoherent quantum algorithm dynamics of an open system with near-term devices [0.0]
  Hybrid quantum-classical algorithms are among the most promising systems to implement quantum computing. We investigate a quantum dynamics algorithm for the density matrix obeying the von Neumann equation. We consider the dynamics of the ensemble-averaged of disordered quantum systems.
  arXiv  Detail & Related papers  (2020-08-12T14:22:42Z)

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.