Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3representative citing papers
Variational compression of Trotterized circuits preserves reaction rate coefficients in nonadiabatic dynamics simulations while reducing circuit depth.
citing papers explorer
-
Quantum algorithms based on quantum trajectories
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
-
Variationally Compressing Quantum Circuits to Approximate Nonadiabatic Molecular Quantum Dynamics
Variational compression of Trotterized circuits preserves reaction rate coefficients in nonadiabatic dynamics simulations while reducing circuit depth.
- Split-Evolution Quantum Phase Estimation for Particle-Conserving Hamiltonians