Pith. sign in

REVIEW 2 cited by

Robust and Efficient Hamiltonian Learning

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 2201.00190 v4 pith:32XAZB43 submitted 2022-01-01 quant-ph

Robust and Efficient Hamiltonian Learning

classification quant-ph
keywords hamiltonianmethodquantumlearningassumptionsdynamicsefficientinformation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

With the fast development of quantum technology, the sizes of both digital and analog quantum systems increase drastically. In order to have better control and understanding of the quantum hardware, an important task is to characterize the interaction, i.e., to learn the Hamiltonian, which determines both static and dynamic properties of the system. Conventional Hamiltonian learning methods either require costly process tomography or adopt impractical assumptions, such as prior information on the Hamiltonian structure and the ground or thermal states of the system. In this work, we present a robust and efficient Hamiltonian learning method that circumvents these limitations based only on mild assumptions. The proposed method can efficiently learn any Hamiltonian that is sparse on the Pauli basis using only short-time dynamics and local operations without any information on the Hamiltonian or preparing any eigenstates or thermal states. The method has a scalable complexity and a vanishing failure probability regarding the qubit number. Meanwhile, it performs robustly given the presence of state preparation and measurement errors and resiliently against a certain amount of circuit and shot noise. We numerically test the scaling and the estimation accuracy of the method for transverse field Ising Hamiltonian with random interaction strengths and molecular Hamiltonians, both with varying sizes and manually added noise. All these results verify the robustness and efficacy of the method, paving the way for a systematic understanding of the dynamics of large quantum systems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Benchmarking Digital-Analog Quantum Computation

    quant-ph 2023-07 unverdicted novelty 7.0

    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.

  2. Reconstructing the Hamiltonian from the local density of states using neural networks

    cond-mat.dis-nn 2025-09 conditional novelty 5.0

    A CNN maps single-energy LDOS maps back to the disorder potential in tight-binding models with test MSE 0.016 (1D) and 0.005 (2D).