pith. sign in

arxiv: 1612.09512 · v3 · pith:FF2UJSN5new · submitted 2016-12-30 · 🪐 quant-ph

Efficient Quantum Algorithms for Simulating Lindblad Evolution

classification 🪐 quant-ph
keywords evolutionmathrmoperatorssystemalgorithmconsistsepsilonlindblad
0
0 comments X
read the original abstract

We consider the natural generalization of the Schr\"{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an $n$-qubit system for time $t$ within precision $\epsilon$. If the Lindbladian consists of $\mathrm{poly}(n)$ operators that can each be expressed as a linear combination of $\mathrm{poly}(n)$ tensor products of Pauli operators then the gate cost of our algorithm is $O(t\, \mathrm{polylog}(t/\epsilon)\mathrm{poly}(n))$. We also obtain similar bounds for the cases where the Lindbladian consists of local operators, and where the Lindbladian consists of sparse operators. This is remarkable in light of evidence that we provide indicating that the above efficiency is impossible to attain by first expressing Lindblad evolution as Schr\"{o}dinger evolution on a larger system and tracing out the ancillary system: the cost of such a \textit{reduction} incurs an efficiency overhead of $O(t^2/\epsilon)$ even before the Hamiltonian evolution simulation begins. Instead, the approach of our algorithm is to use a novel variation of the "linear combinations of unitaries" construction that pertains to channels.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems

    quant-ph 2026-05 conditional novelty 8.0

    Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.

  2. Hamiltonian dynamics from pure dissipation

    quant-ph 2026-04 unverdicted novelty 6.0

    Purely dissipative Lindbladians without Hamiltonian part can approximate unitary dynamics to ε error in diamond norm with O(t²/ε) time, which is optimal for time-independent cases.

  3. Quantum algorithms based on quantum trajectories

    quant-ph 2025-09 unverdicted novelty 6.0

    Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.

  4. Dissipative microcanonical ensemble preparation from KMS-detailed balance

    quant-ph 2026-04 unverdicted novelty 5.0

    Extends KMS-detailed balance constructions from open quantum systems to prepare microcanonical ensembles and other stationary states with criteria for efficient implementation.

  5. Quantum simulation of out-of-equilibrium dynamics in gauge theories

    quant-ph 2025-09 unverdicted novelty 2.0

    The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.