REVIEW 6 cited by
Scalably learning quantum many-body Hamiltonians from dynamical data
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
read the original abstract
The physics of a closed quantum mechanical system is governed by its Hamiltonian. However, in most practical situations, this Hamiltonian is not precisely known, and ultimately all there is are data obtained from measurements on the system. In this work, we introduce a highly scalable, data-driven approach to learning families of interacting many-body Hamiltonians from dynamical data, by bringing together techniques from gradient-based optimization from machine learning with efficient quantum state representations in terms of tensor networks. Our approach is highly practical, experimentally friendly, and intrinsically scalable to allow for system sizes of above 100 spins. In particular, we demonstrate on synthetic data that the algorithm works even if one is restricted to one simple initial state, a small number of single-qubit observables, and time evolution up to relatively short times. For the concrete example of the one-dimensional Heisenberg model our algorithm exhibits an error constant in the system size and scaling as the inverse square root of the size of the data set.
Forward citations
Cited by 6 Pith papers
-
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.
-
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.
-
Benchmarking Digital-Analog Quantum Computation
Except for a few specific cases, digital-analog quantum computation is disadvantageous compared to digital quantum computation based on scaling analysis across three quantum algorithms.
-
The power and limitations of learning quantum dynamics incoherently
The paper proves sample complexity bounds showing that any efficiently representable unitary can be learned incoherently with arbitrary measurements, but only low-entangling unitaries with shallow-depth measurements, ...
-
Structure-Agnostic Unitary Learning from Quantum Observable Dynamics with Application to Hamiltonian Identification
A variational circuit learns unknown quantum unitaries from time-resolved observables, then Hamiltonians are recovered classically by matrix logarithm without assuming Pauli structure.
-
Heisenberg-Limited Quantum Hamiltonian Learning via Randomly Spread Product-States
Randomly spread product states and random Pauli measurements activate all spectral gaps of a Hamiltonian, giving a finite-time quadratic Fisher-information window and enabling simultaneous, beyond-Standard-Quantum-Lim...
Discussion (0). Sign in to comment.