Optimal and Robust In-situ Quantum Hamiltonian Learning through Parallelization

• URL: http://arxiv.org/abs/2510.07818v1
• Date: Thu, 09 Oct 2025 05:58:37 GMT
• Title: Optimal and Robust In-situ Quantum Hamiltonian Learning through Parallelization
• Authors: Suying Liu, Xiaodi Wu, Murphy Yuezhen Niu,
• Abstract summary: Hamiltonian learning is a cornerstone for advancing accurate many-body simulations, improving quantum device performance, and enabling quantum-enhanced sensing.<n>We present the first Hamiltonian learning algorithm that both Cramer-Rao lower bound saturated optimal precision and robustness to realistic noise.
• Score: 5.2946736439833595
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hamiltonian learning is a cornerstone for advancing accurate many-body simulations, improving quantum device performance, and enabling quantum-enhanced sensing. Existing readily deployable quantum metrology techniques primarily focus on achieving Heisenberg-limited precision in one- or two-qubit systems. In contrast, general Hamiltonian learning theories address broader classes of unknown Hamiltonian models but are highly inefficient due to the absence of prior knowledge about the Hamiltonian. There remains a lack of efficient and practically realizable Hamiltonian learning algorithms that directly exploit the known structure and prior information of the Hamiltonian, which are typically available for a given quantum computing platform. In this work, we present the first Hamiltonian learning algorithm that achieves both Cramer-Rao lower bound saturated optimal precision and robustness to realistic noise, while exploiting device structure for quadratic reduction in experimental cost for fully connected Hamiltonians. Moreover, this approach enables simultaneous in-situ estimation of all Hamiltonian parameters without requiring the decoupling of non-learnable interactions during the same experiment, thereby allowing comprehensive characterization of the system's intrinsic contextual errors. Notably, our algorithm does not require deep circuits and remains robust against both depolarizing noise and time-dependent coherent errors. We demonstrate its effectiveness with a detailed experimental proposal along with supporting numerical simulations on Rydberg atom quantum simulators, showcasing its potential for high-precision Hamiltonian learning in the NISQ era.

Related papers

• Towards Quantum Enhanced Adversarial Robustness with Rydberg Reservoir Learning [45.92935470813908]
  Quantum computing reservoir (QRC) leverages the high-dimensional, nonlinear dynamics inherent in quantum many-body systems.<n>Recent studies indicate that perturbation quantums based on variational circuits remain susceptible to adversarials.<n>We investigate the first systematic evaluation of adversarial robustness in a QR based learning model.
  arXiv  Detail & Related papers  (2025-10-15T12:17:23Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization [38.59115551211364]
  Existing compilation techniques for Hamiltonian simulation struggle to provide gate counts feasible on current quantum computers.<n>We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step.<n>We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.
  arXiv  Detail & Related papers  (2025-04-09T18:41:31Z)
• Enhanced Hamiltonian Learning Precision with Multi-Stage Neural Networks [10.285214278728528]
  We propose a multi-stage neural network framework that enhances Hamiltonian learning precision.<n>Our approach utilizes time-series data from single-qubit Pauli measurements of random initial states.<n>We demonstrate the framework on two-qubit systems, achieving orders-of-magnitude improvement in parameter accuracy.
  arXiv  Detail & Related papers  (2025-03-10T14:10:59Z)
• Hamiltonian Neural Networks approach to fuzzball geodesics [39.58317527488534]
  Hamiltonian Neural Networks (HNNs) are tools that minimize a loss function to solve Hamilton equations of motion.<n>In this work, we implement several HNNs trained to solve, with high accuracy, the Hamilton equations for a massless probe moving inside a smooth and horizonless geometry known as D1-D5 circular fuzzball.
  arXiv  Detail & Related papers  (2025-02-28T09:25:49Z)
• Ansatz-free Hamiltonian learning with Heisenberg-limited scaling [4.185787832868736]
  We present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints.<n>Our method is resilient to state-preparation-and-measurement errors.<n>These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems.
  arXiv  Detail & Related papers  (2025-02-17T15:23:59Z)
• Optimal Hamiltonian recognition of unknown quantum dynamics [9.075075598775758]
  We introduce Hamiltonian recognition, a framework to identify the Hamiltonian governing quantum dynamics from a known set of Hamiltonians.<n>We develop a quantum algorithm for coherent function simulation on two quantum signal processing structures.<n>We demonstrate the validity of our protocol on a superconducting quantum processor.
  arXiv  Detail & Related papers  (2024-12-17T16:31:35Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Coherence generation with Hamiltonians [44.99833362998488]
  We explore methods to generate quantum coherence through unitary evolutions. This quantity is defined as the maximum derivative of coherence that can be achieved by a Hamiltonian. We identify the quantum states that lead to the largest coherence derivative induced by the Hamiltonian.
  arXiv  Detail & Related papers  (2024-02-27T15:06:40Z)
• Hamiltonian truncation tensor networks for quantum field theories [42.2225785045544]
  We introduce a tensor network method for the classical simulation of continuous quantum field theories. The method is built on Hamiltonian truncation and tensor network techniques. One of the key developments is the exact construction of matrix product state representations of global projectors.
  arXiv  Detail & Related papers  (2023-12-19T19:00:02Z)
• Robust and Efficient Hamiltonian Learning [2.121963121603413]
  We present a robust and efficient Hamiltonian learning method that circumvents limitations based 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. We numerically test the scaling and the estimation accuracy of the method for transverse field Ising Hamiltonian with random interaction strengths and molecular Hamiltonians.
  arXiv  Detail & Related papers  (2022-01-01T13:48:15Z)
• Active Learning of Quantum System Hamiltonians yields Query Advantage [3.07869141026886]
  Hamiltonian learning is an important procedure in quantum system identification, calibration, and successful operation of quantum computers. Standard techniques for Hamiltonian learning require careful design of queries and $O(epsilon-2)$ queries in achieving learning error $epsilon$ due to the standard quantum limit. We introduce an active learner that is given an initial set of training examples and the ability to interactively query the quantum system to generate new training data.
  arXiv  Detail & Related papers  (2021-12-29T13:45:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.