Abstract: We consider a pure two-state quantum system illuminated by two lasers. A photo-detector captures the fluorescence of the system. We build an invariant observer which yields a (local) estimation of the wave function (or density matrix) and the two key parameters (laser de-tuning and the atomlaser coupling strength) of the hamiltonian. The design exploits the symmetries of the system and can be interpreted geometrically. The convergence proof is based on averaging arguments. Simulation with noise illustrates the robustness of the obtained estimation algorithm.
Learning an interacting many-body Hamiltonian at the Heisenberg limit generally requires control that preserves local information for evolution times of order
1/ε to attain
ε precision. To achieve this, existing protocols often rely on trusted many-qubit operations or increasingly rapid control pulses, creating a precision barrier when gates involve unknown multi-qubit interaction or have finite duration. We show that neither resource is necessary for geometrically local Hamiltonians. Our protocol applies only static single-qubit fields, whose strength is independent of system size and grows polylogarithmically with
1/ε. These fields generate emergent prethermal symmetries that suppress thermalization for the entire learning experiment while retaining informative symmetry-preserving dynamics. On a
d-dimensional lattice of
n qubits, this enables learning every coefficient to accuracy
ε, with failure probability at most
δ, using total evolution time
O(logd(1/ε)log2(n/δ)/ε). Thus, our learning protocol attains the information-theoretically optimal
1/ε dependence up to polylogarithmic factors using product-state preparation, single-qubit measurements, and non-adaptive experiments. More broadly, our results establish emergent prethermal symmetries as a resource for quantum learning, opening a route to Heisenberg-limited characterization of many-body systems where fast or trusted many-qubit control is unavailable.
The identifiability of a system is concerned with whether the unknown parameters in the system can be uniquely determined with all the possible data generated by a certain experimental setting. A test of quantum Hamiltonian identifiability is an important tool to save time and cost when exploring the identification capability of quantum probes and experimentally implementing quantum identification schemes. In this article, we generalize the identifiability test based on the similarity transformation approach (STA) in classical control theory and extend it to the domain of quantum Hamiltonian identification. We employ the STA to prove the identifiability of spin-1/2 chain systems with arbitrary dimension assisted by single-qubit probes. We further extend the traditional STA method by proposing a structure preserving transformation (SPT) method for nonminimal systems. We use the SPT method to introduce an indicator for the existence of economic quantum Hamiltonian identification algorithms, whose computational complexity directly depends on the number of unknown parameters (which could be much smaller than the system dimension). Finally, we give an example of such an economic Hamiltonian identification algorithm and perform simulations to demonstrate its effectiveness.
Identification of the Hamiltonian is vital for characterizing the dynamical evolution of a quantum system. The dimension of a multi-qubit system increases exponentially with the qubit number, which usually leads to daunting computational complexity for general Hamiltonian identification algorithms. In this paper, we design an efficient quantum Hamiltonian identification method based on periodical sampling. The computational complexity is O(M2 + MN2), where M is the number of unknown parameters to be identified in the Hamiltonian and N is the length of the sampling data. Numerical results with different data lengths demonstrate the effectiveness of the proposed identification algorithm.