Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality

• URL: http://arxiv.org/abs/2601.06298v1
• Date: Fri, 09 Jan 2026 20:24:49 GMT
• Title: Quantum algorithm for dephasing of coupled systems: decoupling and IQP duality
• Authors: Sabrina Yue Wang, Raul A. Santos,
• Abstract summary: We introduce a quantum algorithm for simulating unital Lindbladian dynamics by sampling unitary quantum channels without extra ancillas.<n>We show that this algorithm allows approximating general Lindbladians as well.<n>We demonstrate our approach by studying a model of bosons coupled to fermions via dephasing, which naturally arises from anharmonic effects in an electron-phonon system coupled to a bath.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Noise and decoherence are ubiquitous in the dynamics of quantum systems coupled to an external environment. In the regime where environmental correlations decay rapidly, the evolution of a subsytem is well described by a Lindblad quantum master equation. In this work, we introduce a quantum algorithm for simulating unital Lindbladian dynamics by sampling unitary quantum channels without extra ancillas. Using ancillary qubits we show that this algorithm allows approximating general Lindbladians as well. For interacting dephasing Lindbladians coupling two subsystems, we develop a decoupling scheme that reduces the circuit complexity of the simulation. This is achieved by sampling from a time-correlated probability distribution - determined by the evolution of one subsystem, which specifies the stochastic circuit implemented on the complementary subsystem. We demonstrate our approach by studying a model of bosons coupled to fermions via dephasing, which naturally arises from anharmonic effects in an electron-phonon system coupled to a bath. Our method enables tracing out the bosonic degrees of freedom, reducing part of the dynamics to sampling an instantaneous quantum polynomial (IQP) circuit. The sampled bitstrings then define a corresponding fermionic problem, which in the non-interacting case can be solved efficiently classically. We comment on the computational complexity of this class of dissipative problems, using the known fact that sampling from IQP circuits is believed to be difficult classically.

Related papers

• Ancilla-train quantum algorithm for simulating non-Markovian open quantum systems [0.0]
  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.
  arXiv  Detail & Related papers  (2025-09-16T06:18:06Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Bath Dynamical Decoupling with a Quantum Channel [44.99833362998488]
  We find that bath dynamical decoupling works if and only if the kick is ergodic.<n>We study in which circumstances CPTP kicks on a mono-partite quantum system induce quantum Zeno dynamics with its Hamiltonian cancelled out.
  arXiv  Detail & Related papers  (2024-09-27T07:47:52Z)
• Efficiency of Dynamical Decoupling for (Almost) Any Spin-Boson Model [44.99833362998488]
  We analytically study the dynamical decoupling of a two-level system coupled with a structured bosonic environment.<n>We find sufficient conditions under which dynamical decoupling works for such systems.<n>Our bounds reproduce the correct scaling in various relevant system parameters.
  arXiv  Detail & Related papers  (2024-09-24T04:58:28Z)
• Quantum Dissipative Search via Lindbladians [0.0]
  We analyze a purely dissipative quantum random walk on an unstructured classical search space.<n>We show that certain jump operators make the quantum process replicate a classical one, while others yield differences between open quantum (OQRW) and classical random walks.<n>We also clarify a previously observed quadratic speedup, demonstrating that OQRWs are no more efficient than classical search.
  arXiv  Detail & Related papers  (2024-07-16T14:39:18Z)
• A quantum algorithm to simulate Lindblad master equations [1.104960878651584]
  We present a quantum algorithm for simulating a family of Markovian master equations. Our approach employs a second-order product formula for the Lindblad master equation.
  arXiv  Detail & Related papers  (2024-06-18T16:08:11Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Optimal Control of Closed Quantum Systems via B-Splines with Carrier Waves [0.0]
  We consider the optimal control problem of determining electromagnetic pulses for implementing logical gates in a closed quantum system. A novel parameterization of the control functions based on B-splines with carrier waves is introduced. We present numerical examples of how the proposed technique can be combined with an interior point L-BFGS algorithm for realizing quantum gates.
  arXiv  Detail & Related papers  (2021-06-27T18:41:39Z)
• Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits [0.0]
  We show that random circuits provide tailor-made building blocks for simulating quantum many-body systems. Specifically, we propose an algorithm consisting of a random circuit followed by a trotterized Hamiltonian time evolution. We numerically demonstrate the algorithm by simulating the buildup of correlation functions in one- and two-dimensional quantum spin systems.
  arXiv  Detail & Related papers  (2020-12-04T19:00:00Z)
• Assessment of weak-coupling approximations on a driven two-level system under dissipation [58.720142291102135]
  We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation. We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
  arXiv  Detail & Related papers  (2020-11-11T22:45:57Z)

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.