REVIEW 12 cited by
Learning k-body Hamiltonians via compressed sensing
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
Learning k-body Hamiltonians via compressed sensing
read the original abstract
We study the problem of learning a $k$-body Hamiltonian with $M$ unknown Pauli terms that are not necessarily geometrically local. We propose a protocol that learns the Hamiltonian to precision $\epsilon$ with total evolution time ${\mathcal{O}}(M^{1/2+1/p}/\epsilon)$ up to logarithmic factors, where the error is quantified by the $\ell^p$-distance between Pauli coefficients. Our learning protocol uses only single-qubit control operations and a GHZ state initial state, is non-adaptive, is robust against SPAM errors, and performs well even if $M$ and $k$ are not precisely known in advance or if the Hamiltonian is not exactly $M$-sparse. Methods from the classical theory of compressed sensing are used for efficiently identifying the $M$ terms in the Hamiltonian from among all possible $k$-body Pauli operators. We also provide a lower bound on the total evolution time needed in this learning task, and we discuss the operational interpretations of the $\ell^1$ and $\ell^2$ error metrics. In contrast to most previous works, our learning protocol requires neither geometric locality nor any other relaxed locality conditions.
Forward citations
Cited by 12 Pith papers
-
Characterizing Arbitrary Lindbladian Dynamics with a Few Pauli Measurements
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...
-
Near-Optimal Learning of Local Lindbladians
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.
-
Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning
An ansatz-free Lindbladian learning algorithm via Bell sampling with a SPAM-robust extension for gauge-independent parts of sparse Lindbladians under constant noise.
-
Multiparameter function estimation for general Hamiltonians
Derives the ultimate quantum limit for estimating functions of multiple parameters in general Hamiltonians, showing it reduces to an optimized single-parameter quantum Cramér-Rao bound with an attaining protocol.
-
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.
-
Lower Bounds for Learning Hamiltonians from Time Evolution
Establishes n^{Ω(k)} lower bounds for learning k-local Hamiltonians from time evolution, including single-coefficient and effective Hamiltonian learning, via a new connection to Boolean function analysis.
-
Near-Optimal Learning of Local Lindbladians
Local Lindbladians can be learned with Õ(Λ²/ε²) channel uses and Õ(Λ/ε²) total time; matching lower bounds prove this optimal even for adaptive, entangling strategies.
-
Optimal Ansatz-free Hamiltonian Learning In Situ
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.
-
Optimal Ansatz-free Hamiltonian Learning In Situ
A new randomized-sampling algorithm for ansatz-free Hamiltonian learning achieves optimal control-free evolution time Θ(Λ/ε² log(Λ/ε)) with a proven matching lower bound.
-
Provable learning separation for predicting time-evolution of quantum many-body systems
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.
-
Compressed Sensing for Efficient Fidelity Estimation of GHZ States
Compressed sensing exploits sparsity in GHZ states to reduce measurement overhead for fidelity estimation while maintaining accuracy, as shown in simulations and Quantinuum trapped-ion experiments with error detection.
-
Pairwise Liouvillian learning from randomized measurements: practical aspects and guidelines for operating the protocol in large-scale experiments
A complete workflow for pairwise extraction of Liouvillian coefficients from randomized measurements is described for two-body long-range interactions with single-body noise, including parameter guidelines to minimize...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.