REVIEW 9 cited by
Efficient Quantum Algorithms for Simulating Lindblad Evolution
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Efficient Quantum Algorithms for Simulating Lindblad Evolution
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.
Forward citations
Cited by 9 Pith papers
-
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems
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.
-
Randomized simulation of quantum channels using small ancilla
Any unital quantum channel on d dimensions admits exact simulation with ancilla dimension k and success probability Ω(k/log d) via randomization and postselection; the bound is tight and fails for strongly non-unital ...
-
Semantic Prompting: Agentic Incremental Narrative Refinement through Spatial Semantic Interaction
Semantic Prompting enables LLMs to perform precise incremental narrative revisions by perceiving semantic interactions in spatial layouts, addressing misalignment gaps in existing methods.
-
Semantic Prompting: Agentic Incremental Narrative Refinement through Spatial Semantic Interaction
The paper extends KMS-detailed-balance Lindbladian constructions beyond Gibbs states to prepare general stationary states σ=f(H)/Tr[f(H)], including microcanonical window states, with polynomial-time quantum circuit i...
-
Hamiltonian dynamics from pure dissipation
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.
-
Quantum algorithms based on quantum trajectories
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
-
Dissipative microcanonical ensemble preparation from KMS-detailed balance
Extends KMS-detailed balance constructions from open quantum systems to prepare microcanonical ensembles and other stationary states with criteria for efficient implementation.
-
QuTiP 5: The Quantum Toolbox in Python
QuTiP 5 updates the Quantum Toolbox in Python with data layer changes for JAX and CuPy support, new solvers, QuTiP-QIP for circuits, and QuTiP-QOC for control.
-
Quantum simulation of out-of-equilibrium dynamics in gauge theories
The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.