Papers
Topics
Authors
Recent
Search
2000 character limit reached

Expectation-Free Hamiltonian Learning

Updated 19 February 2026
  • Expectation-Free Hamiltonian is a method for quantum Hamiltonian learning that uses only single-shot projective measurements, avoiding expectation value estimation.
  • It employs local randomization and scheduled short-time evolutions to reconstruct Hamiltonians in a local Pauli basis, surpassing the standard quantum limit.
  • The approach achieves transient Heisenberg-limited scaling for parallel multi-parameter estimation without relying on entanglement or coherent joint measurements.

An expectation-free Hamiltonian refers to an approach for quantum Hamiltonian learning that eliminates the need for expectation value estimation—relying exclusively on single-shot, projective measurement data. In the context of recent research, specifically "Resource-Free Quantum Hamiltonian Learning Below the Standard Quantum Limit" (Baran et al., 28 Jul 2025), this term characterizes protocols that reconstruct an unknown Hamiltonian, decomposed in a local Pauli basis, using only short-time product-state trajectories, one-local randomized pre-processing, and projective measurements, and implements a single-shot maximum-likelihood estimator (MLE). These methods require neither entanglement, coherent measurements, nor dynamical control, yet can surpass the standard quantum limit (SQL) and achieve a transient Heisenberg-limited regime for parameter estimation.

1. Trajectory-Based Expectation-Free Protocol

The protocol begins by fixing a reference product state ψ0=0n\ket{\psi_0} = \ket{0}^{\otimes n}. Each experimental run generates a "spread" state via local random unitaries:

ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),

where {ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\} are sampled independently from the single-qubit Haar measure. This local randomization delocalizes the spectral support and ensures sensitivity to each Pauli term at short times.

A schedule of evolution times {tk}\{t_k\} is chosen according to tk=Δtkαt_k = \Delta t\,k^\alpha (k{1,...,mt}k \in \{1,...,m_t\}, α>1\alpha > -1), with the total evolution time Ttot=ktkT_{\rm tot} = \sum_k t_k acting as the resource budget. For each spread state, time, and a fixed set of KK random product-Pauli measurement bases p{X,Y,Z}np_\ell \in \{X,Y,Z\}^n, the state is evolved under the target Hamiltonian and measured once in basis ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),0, yielding single-shot outcomes ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),1. No expectation values over measurement outcomes are formed at any stage.

2. Maximum-Likelihood Estimation without Expectation Values

Given a dataset of single-shot outcomes ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),2, the trial Hamiltonian ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),3 is parametrized as a Hermitian matrix via a complex lower-triangular embedding ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),4:

ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),5

ensuring Hermiticity for all ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),6. For each datum, the likelihood is

ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),7

The total (negative) log-likelihood,

ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),8

is minimized using gradient-based optimization (with backpropagation through the "extended-parameter embedding" neural network mapping). Importantly, all inference is performed directly from single-shot data—there is no construction of empirical expectation values at any point.

3. Transient Heisenberg-Limited Scaling and Error Analysis

The protocol exhibits error scaling that supersedes the SQL in total time for short-time probes. For an unknown Pauli-decomposed Hamiltonian,

ψ0(r)=Uspread(r)ψ0,Uspread(r)=j=1nRz(ξj)Ry(χj)Rz(ϕj),\ket{\psi_0^{(r)}} = U_{\rm spread}^{(r)}\ket{\psi_0},\quad U_{\rm spread}^{(r)} = \bigotimes_{j=1}^n R_z(\xi_j)R_y(\chi_j)R_z(\phi_j),9

the single-parameter Fisher information at probe time {ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}0 is given by

{ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}1

Averaging over randomizations, {ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}2 in the short-time regime ({ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}3), indicating Heisenberg-limited scaling: from the Cramér–Rao bound, {ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}4.

For a protocol summing over {ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}5 times {ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}6, the total Fisher information satisfies

{ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}7

Consequently,

{ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}8

enabling continuous interpolation from SQL error scaling ({ξj,χj,ϕj}\{\xi_j, \chi_j, \phi_j\}9) to the Heisenberg limit ({tk}\{t_k\}0) by tuning {tk}\{t_k\}1.

4. Parallel Multi-Parameter Estimation without Structural Priors

Each short-time probability is generically sensitive to all Hamiltonian parameters. For Pauli string {tk}\{t_k\}2 and measurement outcome {tk}\{t_k\}3,

{tk}\{t_k\}4

Owing to full support under Haar randomness, all overlaps {tk}\{t_k\}5 are nonzero with probability one, yielding generic sensitivity.

Averaging the multi-parameter Fisher matrix over many spread states,

{tk}\{t_k\}6

the protocol statistically diagonalizes the Fisher matrix, ensuring all parameters are uncorrelated and recoverable in parallel at the Heisenberg rate. No term isolation or assumptions (e.g., sparsity, commutativity) are required.

5. Empirical Validation on One-Dimensional Spin Chains

The method was benchmarked on disordered, anisotropic Heisenberg models for 1D spin-{tk}\{t_k\}7 chains, including:

  • XYZ nearest-neighbor: {tk}\{t_k\}8.
  • XYZ2: Incorporates arbitrary local fields and next-nearest-neighbor couplings {tk}\{t_k\}9.
  • XYZ3: Adds three-body couplings tk=Δtkαt_k = \Delta t\,k^\alpha0.
  • Gapless XXZ: tk=Δtkαt_k = \Delta t\,k^\alpha1, tk=Δtkαt_k = \Delta t\,k^\alpha2.

The probe ensemble utilized tk=Δtkαt_k = \Delta t\,k^\alpha3 spread states, tk=Δtkαt_k = \Delta t\,k^\alpha4 evolution times tk=Δtkαt_k = \Delta t\,k^\alpha5, tk=Δtkαt_k = \Delta t\,k^\alpha6 random Pauli bases, and a single shot per basis. Reconstruction error tk=Δtkαt_k = \Delta t\,k^\alpha7 fit as tk=Δtkαt_k = \Delta t\,k^\alpha8 yields tk=Δtkαt_k = \Delta t\,k^\alpha9 at k{1,...,mt}k \in \{1,...,m_t\}0, exceeding the SQL value (k{1,...,mt}k \in \{1,...,m_t\}1). Varying k{1,...,mt}k \in \{1,...,m_t\}2 produces error scaling k{1,...,mt}k \in \{1,...,m_t\}3, matching theoretical predictions. Increasing k{1,...,mt}k \in \{1,...,m_t\}4 pushes k{1,...,mt}k \in \{1,...,m_t\}5 toward the single-parameter bound (k{1,...,mt}k \in \{1,...,m_t\}6 for k{1,...,mt}k \in \{1,...,m_t\}7), confirming statistical independence of the parameters.

Crucially, only one shot per measurement is sufficient to achieve these super-SQL scalings in practice.

6. Experimental Considerations and Implementation

The expectation-free Hamiltonian learning protocol does not require entanglement, coherent joint measurements, or dynamical multi-qubit control. Random local pre-rotations are sufficient, implemented independently on each qubit. The method’s minimal experimental requirements—short-time product-state trajectories, local randomization, scheduled single-shot Pauli measurements, and single-shot MLE—make it suitable for near-term quantum hardware. The associated codebase is online and open-source (Baran et al., 28 Jul 2025).

7. Significance and Conceptual Distinction

By avoiding any post-processing to form expectation values, the expectation-free Hamiltonian learning paradigm provides a streamlined, statistically efficient route to quantum Hamiltonian identification. Its analytic and numerical validation of transient Heisenberg scaling without quantum resources such as entanglement or dynamical control distinguishes it from prior resource-intensive schemes. The ability to learn all Hamiltonian parameters in parallel without structural priors further underscores the generality and potential impact of this class of protocols for characterizing complex quantum systems (Baran et al., 28 Jul 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Expectation-Free Hamiltonian.