Root-sparsity scaling for Hamiltonian simulation, differential equations and linear-system solvers
quant-ph
Submitted: 2026-10-02
Updated: 2026-10-02
Comments: 67 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Time-Dependent Hamiltonian Simulation with Optimal Query Complexity
- An Optimal Quantum Linear Systems Algorithm
- A shortcut to an optimal quantum linear system solver
- Simultaneously Query-Optimal Quantum Linear-System Algorithm
- A Near-Optimal Joint Lower Bound for Sparse Quantum Linear System Solvers
- Optimal quantum simulation of linear non-unitary dynamics
- The Multiplicative Quantum Adversary
- Constant-Factor Improvements in Quantum Algorithms for Linear Differential Equations
- Query-Optimal and Gate-Efficient Lindbladian Simulation
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