Fast convergence of propagation algorithms for open quantum systems
quant-ph
Submitted: 2026-10-05
Updated: 2026-10-05
Sources
- Efficient simulation of sparse Markovian quantum dynamics
- Efficient Quantum Algorithms for Simulating Lindblad Evolution
- Simulating Markovian open quantum systems using higher-order series expansion
- An efficient and exact noncommutative quantum Gibbs sampler
- Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
- Fast Mixing of Quantum Spin Chains at All Temperatures
- Fast mixing of all-to-all quantum systems at high temperatures
- A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations
- Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions
- Polynomial-time classical sampling of high-temperature quantum Gibbs states
- High-Temperature Fermionic Gibbs States are Mixtures of Gaussian States
- Simulation of Fermionic circuits using Majorana Propagation
- Classical surrogate simulation of quantum systems with LOWESA
- Fast convergence of Majorana Propagation for weakly interacting fermions
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
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians