Pith. sign in

REVIEW 4 cited by

Improved Hamiltonian learning and sparsity testing through Bell sampling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2509.07937 v1 pith:5KLWGRW5 submitted 2025-09-09 quant-ph

classification quant-ph
keywords hamiltonianlearningsparsitytestingbellsamplingepsilonevolution
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We consider the problem of learning an $M$-sparse Hamiltonian and the related problem of Hamiltonian sparsity testing. Through a detailed analysis of Bell sampling, we reduce the total evolution time required by the state-of-the-art algorithm for $M$-sparse Hamiltonian learning to $\widetilde{\mathcal{O}}(M/\epsilon)$, where $\epsilon$ denotes the $\ell^{\infty}$ error, achieving an improvement by a factor of $M$ (ignoring the logarithmic factor) while only requiring access to forward time-evolution. We then establish a connection between Hamiltonian learning and Hamiltonian sparsity testing through Bell sampling, which enables us to propose a Hamiltonian sparsity testing with state-of-the-art total evolution time scaling.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements

    quant-ph 2026-07 conditional novelty 8.0 of 10

    A control-free protocol using only product-Pauli preparations and measurements reconstructs arbitrary sparse Lindbladian generators, identifying supports from data with O~(Γ²M0²/ε⁴) samples and O~(ΓM0²/ε²) total evolu...

  2. Near-Optimal Learning of Local Lindbladians

    quant-ph 2026-06 unverdicted novelty 8.0 of 10

    Near-optimal algorithm learns local Lindbladians via finite-time probes and classical shadows with Õ(Λ²/ε²) channel uses and matching lower bounds showing dissipative terms block Heisenberg-limited scaling.

  3. Optimal Ansatz-free Hamiltonian Learning In Situ

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    Ansatz-free Hamiltonian learning with product Pauli states and no control achieves optimal total evolution time Θ(Λ/ε² log(Λ/ε)), with a matching new lower bound over all control-free protocols.

  4. Provable learning separation for predicting time-evolution of quantum many-body systems

    quant-ph 2026-07 accept novelty 6.0 of 10

    A provable exponential quantum-classical learning separation is established for predicting expectation values of time-evolved quantum states under unknown low-intersection Hamiltonians, assuming BQP ⊄ P/poly.

Pith tools