Hamiltonian learning via quantum Zeno effect

• URL: http://arxiv.org/abs/2509.15713v2
• Date: Mon, 27 Oct 2025 15:49:56 GMT
• Title: Hamiltonian learning via quantum Zeno effect
• Authors: Giacomo Franceschetto, Egle Pagliaro, Luciano Pereira, Leonardo Zambrano, Antonio Acín,
• Abstract summary: We propose a scalable and experimentally friendly Hamiltonian learning protocol for Hamiltonian operators made of local interactions.<n>We derive theoretical performance guarantees and demonstrate the feasibility of our protocol both with numerical simulations and through an experimental implementation on IBM's superconducting quantum hardware.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Determining the Hamiltonian of a quantum system is essential for understanding its dynamics and validating its behavior. Hamiltonian learning provides a data-driven approach to reconstruct the generator of the dynamics from measurements on the evolved system. Among its applications, it is particularly important for benchmarking and characterizing quantum hardware, such as quantum computers and simulators. However, as these devices grow in size and complexity, this task becomes increasingly challenging. To address this, we propose a scalable and experimentally friendly Hamiltonian learning protocol for Hamiltonian operators made of local interactions. It leverages the quantum Zeno effect as a reshaping tool to localize the system's dynamics and then applies quantum process tomography to learn the coefficients of a local subset of the Hamiltonian acting on selected qubits. Unlike existing approaches, our method does not require complex state preparations and uses experimentally accessible, coherence-preserving operations. We derive theoretical performance guarantees and demonstrate the feasibility of our protocol both with numerical simulations and through an experimental implementation on IBM's superconducting quantum hardware, successfully learning the coefficients of a 109-qubit Hamiltonian.

Related papers

• Digitized Counterdiabatic Quantum Feature Extraction [35.670314643295036]
  We introduce a Hamiltonian-based quantum feature extraction method that generates complex features via the dynamics of $k$-local many-body spins Hamiltonians.<n>We assess the approach on high-dimensional, real-world datasets, including molecular toxicity classification and image recognition.<n>The results suggest that combining quantum and classical feature extraction can provide consistent improvements across diverse machine learning tasks.
  arXiv  Detail & Related papers  (2025-10-15T17:59:35Z)
• Hamiltonian Dynamics Learning: A Scalable Approach to Quantum Process Characterization [6.741097425426473]
  We introduce an efficient quantum process learning method specifically designed for short-time Hamiltonian dynamics.<n>We demonstrate applications in quantum machine learning, where our protocol enables efficient training of variational quantum neural networks by directly learning unitary transformations.<n>This work establishes a new theoretical foundation for practical quantum dynamics learning, paving the way for scalable quantum process characterization in both near-term and fault-tolerant quantum computing.
  arXiv  Detail & Related papers  (2025-03-31T14:50:00Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Programmable Simulations of Molecules and Materials with Reconfigurable Quantum Processors [0.3320294284424914]
  We introduce a simulation framework for strongly correlated quantum systems that can be represented by model spin Hamiltonians. Our approach leverages reconfigurable qubit architectures to programmably simulate real-time dynamics. We show how this method can be used to compute key properties of a polynuclear transition-metal catalyst and 2D magnetic materials.
  arXiv  Detail & Related papers  (2023-12-04T19:00:01Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Robust Hamiltonian Engineering for Interacting Qudit Systems [50.591267188664666]
  We develop a formalism for the robust dynamical decoupling and Hamiltonian engineering of strongly interacting qudit systems. We experimentally demonstrate these techniques in a strongly-interacting, disordered ensemble of spin-1 nitrogen-vacancy centers.
  arXiv  Detail & Related papers  (2023-05-16T19:12:41Z)
• Efficient and robust estimation of many-qubit Hamiltonians [0.0]
  Characterizing the interactions and dynamics of quantum mechanical systems is an essential task in development of quantum technologies. We propose an efficient protocol for characterizing the underlying Hamiltonian dynamics and the noise of a multi-qubit device. This protocol can be used to parallelize to learn the Hamiltonian, rendering it applicable for the characterization of both current and future quantum devices.
  arXiv  Detail & Related papers  (2022-05-19T13:52:32Z)
• 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)
• Quantum-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.