Digital Quantum Simulation of the Nonlinear Lindblad Master Equation Based on Quantum Trajectory Averaging

• URL: http://arxiv.org/abs/2504.00121v1
• Date: Mon, 31 Mar 2025 18:11:48 GMT
• Title: Digital Quantum Simulation of the Nonlinear Lindblad Master Equation Based on Quantum Trajectory Averaging
• Authors: Yu-Guo Liu, Heng Fan, Shu Chen,
• Abstract summary: We propose a 2-dilation digital simulation scheme for the non-linear Lindblad master equation (NLME) based on quantum trajectory averaging.<n>Our scheme allows efficient long-time simulations of LMEs with multiple jump operators.<n>As a demonstration, we present numerical experiments simulating novel theoretical predictions in open quantum systems.
• Score: 10.600125493291289
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Since precisely controlling dissipation in realistic environments is challenging, digital simulation of the Lindblad master equation (LME) is of great significance for understanding nonequilibrium dynamics in open quantum systems. However, achieving long-time simulations for complex systems with multiple dissipation channels remains a major challenge, both theoretically and experimentally. Here, we propose a 2-dilation digital simulation scheme for the non-linear Lindblad master equation (NLME) based on quantum trajectory averaging. The NLME continuously interpolates between full LME and the dynamical equation governed by the effective non-Hermitian Hamiltonian. Remarkably, for standard LMEs, our scheme reduces to a 1-dilation method that enables deterministic realizations without postselection. This deterministic nature overcomes a key limitation in some existing simulation methods, where repeated postselections lead to exponentially vanishing implementation probabilities. Consequently, our scheme allows efficient long-time simulations of LMEs with multiple jump operators. As a demonstration, we present numerical experiments simulating novel theoretical predictions in open quantum systems, including localization in open quantum systems and the postselected skin effect.

Related papers

• Towards robust variational quantum simulation of Lindblad dynamics via stochastic Magnus expansion [10.144001671935907]
  We introduce a novel and general framework for the variational quantum simulation of Lindblad equations.<n>We demonstrate the effectiveness of our algorithm through numerical examples.
  arXiv  Detail & Related papers  (2025-03-28T02:37:56Z)
• Large-scale stochastic simulation of open quantum systems [2.2627671295262215]
  We introduce the tensor jump method (TJM), a scalable, embarrassingly parallel algorithm for simulating large-scale open quantum systems.<n>This work represents a significant step forward in the simulation of large-scale open quantum systems.
  arXiv  Detail & Related papers  (2025-01-29T19:00:00Z)
• Exponentially reduced circuit depths in Lindbladian simulation [11.176767117446696]
  Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more.<n>Existing methods face a critical trade-off: either relying on resource-intensive multi-qubit operations or employing deep quantum circuits to suppress simulation errors using experimentally friendly methods.<n>We propose an efficient Lindbladian simulation framework that minimizes circuit depths while remaining experimentally accessible.
  arXiv  Detail & Related papers  (2024-12-30T16:31:25Z)
• Differentiable Quantum Computing for Large-scale Linear Control [26.118874431217165]
  We introduce an end-to-end quantum algorithm for linear-quadratic control with provable speedups. Our algorithm, based on a policy gradient method, incorporates a novel quantum subroutine for solving the matrix Lyapunov equation.
  arXiv  Detail & Related papers  (2024-11-03T00:54:33Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Potential quantum advantage for simulation of fluid dynamics [1.4046104514367475]
  We show that a potential quantum exponential speedup can be achieved to simulate the Navier-Stokes equations governing turbulence using quantum computing. This work suggests that an exponential quantum advantage may exist for simulating nonlinear multiscale transport phenomena.
  arXiv  Detail & Related papers  (2023-03-29T09:14:55Z)
• Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels [26.888629265226264]
  An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor. We study the challenging setting in which the channel to be simulated varies adversarially with time.
  arXiv  Detail & Related papers  (2022-12-09T23:37:55Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• 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)
• 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)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• 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.