Causal Query Compression for Lindblad Dynamics: Optimal Queries and Nearly Linear Local Simulation
quant-ph
Submitted: 2026-09-25
Updated: 2026-09-25
Terminology
Sources
- Quantum algorithms based on quantum trajectories
- Time-Dependent Hamiltonian Simulation with Optimal Query Complexity
- Query-Optimal and Gate-Efficient Lindbladian Simulation
- Efficient Optimal Control of Open Quantum Systems
- Quantum query complexity of state conversion
- Exponential Lindbladian fast forwarding and exponential amplification of certain Gibbs state properties
- Adversary lower bounds in the Hamiltonian oracle model
- Gate-efficient discrete simulations of continuous-time quantum query algorithms
- The quantum regression theorem for out-of-time-ordered correlation functions
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- Lindbladian Simulation with Commutator Bounds
- Optimizing digital quantum simulation of open quantum lattice models
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity