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.
Title resolution pending
3 Pith papers cite this work, alongside 5 external citations. Polarity classification is still indexing.
3
Pith papers citing it
5
external citations · OpenAlex
fields
quant-ph 3years
2026 3representative citing papers
Bloch-UPAW integrates Bloch orbitals and local UPAW corrections to enable lower-resource fault-tolerant quantum simulations of solids, showing roughly 10x Toffoli reduction for bulk diamond.
Quantum algorithms for element-wise polynomial matrix transforms achieve exponential space reduction in polynomial degree with corrections to prior constructions.
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.
-
Fault-tolerant simulation of the electronic structure using Projector Augmented-Waves and Bloch orbitals
Bloch-UPAW integrates Bloch orbitals and local UPAW corrections to enable lower-resource fault-tolerant quantum simulations of solids, showing roughly 10x Toffoli reduction for bulk diamond.
-
Quantum element-wise transforms
Quantum algorithms for element-wise polynomial matrix transforms achieve exponential space reduction in polynomial degree with corrections to prior constructions.