Quantum Probe Tomography

• URL: http://arxiv.org/abs/2510.08499v1
• Date: Thu, 09 Oct 2025 17:39:37 GMT
• Title: Quantum Probe Tomography
• Authors: Sitan Chen, Jordan Cotler, Hsin-Yuan Huang,
• Abstract summary: Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science.<n>We introduce and formalize the problem of quantum probe tomography, where one seeks to learn the parameters of a many-body Hamiltonian using a single local probe access to a small subsystem of a many-body thermal state undergoing time evolution.
• Score: 12.775745159752427
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science. While significant progress has been made, many existing Hamiltonian learning protocols demand digital quantum control over the entire system, creating a disconnect from many real-world settings that provide access only through small, local probes. Motivated by this, we introduce and formalize the problem of quantum probe tomography, where one seeks to learn the parameters of a many-body Hamiltonian using a single local probe access to a small subsystem of a many-body thermal state undergoing time evolution. We address the identifiability problem of determining which Hamiltonians can be distinguished from probe data through a new combination of tools from algebraic geometry and smoothed analysis. Using this approach, we prove that generic Hamiltonians in various physically natural families are identifiable up to simple, unavoidable structural symmetries. Building on these insights, we design the first efficient end-to-end algorithm for probe tomography that learns Hamiltonian parameters to accuracy $\varepsilon$, with query complexity scaling polynomially in $1/\varepsilon$ and classical post-processing time scaling polylogarithmically in $1/\varepsilon$. In particular, we demonstrate that translation- and rotation-invariant nearest-neighbor Hamiltonians on square lattices in one, two, and three dimensions can be efficiently reconstructed from single-site probes of the Gibbs state, up to inversion symmetry about the probed site. Our results demonstrate that robust Hamiltonian learning remains achievable even under severely constrained experimental access.

Related papers

• 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)
• Hamiltonian Learning at Heisenberg Limit for Hybrid Quantum Systems [0.7499722271664147]
  Hybrid quantum systems with different particle species are fundamental in quantum materials and quantum information science.<n>We establish a rigorous theoretical framework proving that, given access to an unknown spin-boson type Hamiltonian, our algorithm achieves Heisenberg-limited estimation.<n>Our results provide a scalable and robust framework for precision Hamiltonian characterization in hybrid quantum platforms.
  arXiv  Detail & Related papers  (2025-02-27T18:47:47Z)
• 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)
• Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
  A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
  arXiv  Detail & Related papers  (2024-05-28T18:00:32Z)
• Dissipation-enabled bosonic Hamiltonian learning via new information-propagation bounds [1.0499611180329802]
  We show that a bosonic Hamiltonian can be efficiently learned from simple quantum experiments. Our work demonstrates that a broad class of bosonic Hamiltonians can be efficiently learned from simple quantum experiments.
  arXiv  Detail & Related papers  (2023-07-27T17:35:07Z)
• Quantum-Inspired Tempering for Ground State Approximation using Artificial Neural Networks [0.0]
  We propose a parallel tempering method that facilitates escape from local minima. We show that augmenting the training with quantum parallel tempering becomes useful to finding good approximations to the ground states of problem instances.
  arXiv  Detail & Related papers  (2022-10-20T16:50:32Z)
• Scalably learning quantum many-body Hamiltonians from dynamical data [1.702884126441962]
  We introduce a highly scalable, data-driven approach to learning families of interacting many-body Hamiltonians from dynamical data. Our approach is highly practical, experimentally friendly, and intrinsically scalable to allow for system sizes of above 100 spins.
  arXiv  Detail & Related papers  (2022-09-28T18:00:57Z)
• Neural network enhanced measurement efficiency for molecular groundstates [63.36515347329037]
  We adapt common neural network models to learn complex groundstate wavefunctions for several molecular qubit Hamiltonians. We find that using a neural network model provides a robust improvement over using single-copy measurement outcomes alone to reconstruct observables.
  arXiv  Detail & Related papers  (2022-06-30T17:45:05Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Scalable approach to many-body localization via quantum data [69.3939291118954]
  Many-body localization is a notoriously difficult phenomenon from quantum many-body physics. We propose a flexible neural network based learning approach that circumvents any computationally expensive step. Our approach can be applied to large-scale quantum experiments to provide new insights into quantum many-body physics.
  arXiv  Detail & Related papers  (2022-02-17T19:00:09Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)

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.