Quantum fast multipole method yields electronic structure simulation gate complexity t(η^{4/3}N^{1/3} + η^{1/3}N^{2/3})(η N t / ε)^{o(1)}, providing roughly O(η) speedup over prior work for N < η^7.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2025 2roles
background 1polarities
background 1representative citing papers
The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.
citing papers explorer
-
Quantum simulation of electronic structure via quantum fast multipole method
Quantum fast multipole method yields electronic structure simulation gate complexity t(η^{4/3}N^{1/3} + η^{1/3}N^{2/3})(η N t / ε)^{o(1)}, providing roughly O(η) speedup over prior work for N < η^7.
-
Mind the gaps: The fraught road to quantum advantage
The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.