Heisenberg-limited Hamiltonian learning is achievable with any constant minimum evolution time T per query, attaining optimal 1/ε total-time scaling for logarithmically sparse Hamiltonians.
Cer- tifying and learning quantum ising hamiltonians
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A randomized algorithm detects dissipation of magnitude at least epsilon in unknown Lindbladian dynamics with optimal total evolution time O(epsilon^{-1}) under bounded strength and locality assumptions.
citing papers explorer
-
Heisenberg-limited Hamiltonian learning without short-time control
Heisenberg-limited Hamiltonian learning is achievable with any constant minimum evolution time T per query, attaining optimal 1/ε total-time scaling for logarithmically sparse Hamiltonians.
-
Optimal detection of dissipation in Lindbladian dynamics
A randomized algorithm detects dissipation of magnitude at least epsilon in unknown Lindbladian dynamics with optimal total evolution time O(epsilon^{-1}) under bounded strength and locality assumptions.