Answers are grounded in this paper and cite their sources.
Explores quantum unitary learning, achieving high fidelity in Hamiltonian identification.
We present a variational algorithm for learning an unknown quantum unitary from time-series observablemeasurements, with no structural assumption about the target. The core separation: a hardware-efficient parametrisedcircuit learns the evolution operator U via observable matching; Hamiltonian identification follows as classical post-processing via matrix logarithm, when the target happens to be e−iHτ .Three experiments establish the method’s generality. First, a noiseless proof of correctness with exact gradients(L-BFGS-B) achieves MSE 1.61×10−14 and recovers all Hamiltonian coefficients to six decimal places. Second, agate-learning experiment fits CNOT, iSWAP, and a Haar-random SU(4) element — none generated by any fixedHamiltonian — all to process fidelity 1.000000, confirming the method does not rely on Trotterisation structure.Third, quantum deployment via SPSA-Adam under Qiskit Aer depolarising noise (p1=0.001, p2= 0.01, Nshots= 1024)recovers all three Ising Hamiltonian terms with errors below 8%.The optimiser, SPSA-Adam, combines SPSA’s hardware-efficient two-point gradient estimation with Adam’sadaptive moment updates. A four-stage moment-warm curriculum progressively extends the training horizon, convertinga global non-convex problem into a sequence of well-posed local ones
No takes yet. Share an insight, caveat, or question.
Mohamed Berkani (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: