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.
Shadow hamiltonian simulation,
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative citing papers
Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.
Quadratic bosonic Hamiltonian simulation is BQP-complete for a broad class that includes classical oscillator networks and continuous-time quantum walks, but becomes PostBQP-hard when extended to more general quadratic interactions.
citing papers explorer
-
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.
-
Particle-preserving fermionic shadows with mode-independent sample complexity
Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.
-
Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness
Quadratic bosonic Hamiltonian simulation is BQP-complete for a broad class that includes classical oscillator networks and continuous-time quantum walks, but becomes PostBQP-hard when extended to more general quadratic interactions.