A dequantized classical algorithm solves the guided local Hamiltonian problem at constant accuracy for general k-local Hamiltonians, removing the previous operator-norm constraint, and at arbitrary constant accuracy when the guiding-state overlap is at least 1/sqrt(2).
Dequantizing algorithms to understand quantum advantage in machine learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Dequantized Algorithm for the Guided Local Hamiltonian Problem
A dequantized classical algorithm solves the guided local Hamiltonian problem at constant accuracy for general k-local Hamiltonians, removing the previous operator-norm constraint, and at arbitrary constant accuracy when the guiding-state overlap is at least 1/sqrt(2).