Randomized sparse-QSVT reduces gate counts by up to 10x for inhomogeneous many-term Hamiltonians at moderate error (around 10^{-3}), but deterministic QSVT becomes cheaper for higher precision.
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 2roles
background 1polarities
background 1representative citing papers
Resource estimates for quantum simulation of pionless and pionful nuclear lattice EFTs, including time evolution and energy estimation, with new error bounds from symmetries and locality yielding orders-of-magnitude improvements for the pionless case.
citing papers explorer
-
When is randomization advantageous in quantum simulation?
Randomized sparse-QSVT reduces gate counts by up to 10x for inhomogeneous many-term Hamiltonians at moderate error (around 10^{-3}), but deterministic QSVT becomes cheaper for higher precision.
-
Quantum Algorithms for Simulating Nuclear Effective Field Theories
Resource estimates for quantum simulation of pionless and pionful nuclear lattice EFTs, including time evolution and energy estimation, with new error bounds from symmetries and locality yielding orders-of-magnitude improvements for the pionless case.