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.
arXiv preprint arXiv:2305.04908 , url=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
Brillouin-Wigner perturbation theory plus Hartree-Fock mean-field approximation upgrades quasiparticle nuclear Hamiltonians, yielding <0.2% and ~2% ground-state energy errors versus exact shell-model results in the sd shell while preserving qubit efficiency.
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.
-
Improved quasiparticle nuclear Hamiltonians for quantum computing
Brillouin-Wigner perturbation theory plus Hartree-Fock mean-field approximation upgrades quasiparticle nuclear Hamiltonians, yielding <0.2% and ~2% ground-state energy errors versus exact shell-model results in the sd shell while preserving qubit efficiency.