Heisenberg-limited Hamiltonian learning without short-time control

• URL: http://arxiv.org/abs/2604.27838v1
• Date: Thu, 30 Apr 2026 13:23:41 GMT
• Title: Heisenberg-limited Hamiltonian learning without short-time control
• Abstract summary: Heisenberg-limited Hamiltonian learning can be achieved without short-time control.<n>Key ingredient is a method for emulating the continuous quantum control required by iterative learning algorithms.
• Score: 3.0410860009594463
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterizing quantum systems by learning their underlying Hamiltonians is a central task in quantum information science. While recent algorithmic advances have achieved near-optimal efficiency in this task, they critically rely on accessing arbitrarily short-time dynamics. This reliance poses severe experimental challenges due to finite control bandwidth and transient pulse errors. In this work, we demonstrate that Heisenberg-limited Hamiltonian learning can be achieved without short-time control. We introduce a framework in which every query to the unknown dynamics has duration at least a prescribed minimum time $T$, and show that this restriction does not preclude Heisenberg-limited scaling. The key ingredient is a method for emulating the continuous quantum control required by iterative learning algorithms using only such lower-bounded evolution times. This reduces the learning task to sparse pure-state tomography. Notably, for logarithmically sparse Hamiltonians, our algorithm achieves the information-theoretically optimal $1/\varepsilon$ scaling in total evolution time for any arbitrary constant minimum evolution time $T$. For many-body (polynomially sparse) systems, we uncover a rigorous quantitative tradeoff, showing that the minimum required evolution time can be significantly relaxed from the standard limit at a polynomial cost in total evolution time. Our results affirmatively resolve a prominent open problem in the field and reveal that high-bandwidth, ultra-short pulses are not fundamentally necessary for optimal quantum learning.

Related papers

• Optimal Ansatz-free Hamiltonian Learning In Situ [3.3230675313521716]
  We show that an algorithm can learn an ansatz-free Hamiltonian $H$ in total evolution time of $(frac2log(frac))$.<n>Our results demonstrate the fundamental cost of experimentally friendly Hamiltonian learning and provide a practical route to rigorous in situ characterization of near-term quantum platforms.
  arXiv  Detail & Related papers  (2026-06-17T18:21:30Z)
• Quantum Imaginary-Time Evolution with Polynomial Resources in Time [10.929463111602232]
  We present a quantum algorithm that prepares normalized imaginary-time states using an adaptive normalization factor to maintain stable success probability over large imaginary times.<n>Our algorithm approximates the target state to small errors in inverse imaginary time using elementaryly many quantum gates and a single ancilla qubit.<n> Numerical experiments validate our theoretical results for evolution time up to 50, demonstrating the algorithm's effectiveness for long-time evolution.
  arXiv  Detail & Related papers  (2025-07-01T16:11:47Z)
• 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)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Q-Newton: Hybrid Quantum-Classical Scheduling for Accelerating Neural Network Training with Newton's Gradient Descent [37.59299233291882]
  We propose Q-Newton, a hybrid quantum-classical scheduler for accelerating neural network training with Newton's GD.<n>Q-Newton utilizes a streamlined scheduling module that coordinates between quantum and classical linear solvers.<n>Our evaluation showcases the potential for Q-Newton to significantly reduce the total training time compared to commonly used quantum machines.
  arXiv  Detail & Related papers  (2024-04-30T23:55:03Z)
• 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)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• The advantage of quantum control in many-body Hamiltonian learning [0.11704154007740832]
  We study the problem of learning the Hamiltonian of a many-body quantum system from experimental data. We show that the rate of learning depends on the amount of control available during the experiment.
  arXiv  Detail & Related papers  (2023-04-14T14:46:52Z)
• Quantum speed limit for complex dynamics [4.491423699780532]
  Most existing tools for the depiction of quantum speed limit are the lower-bound-type tools. We propose a three-step (classification-regression-calibration) methodology based on machine learning to evaluate the true minimum time in complex dynamics.
  arXiv  Detail & Related papers  (2023-01-02T08:59:22Z)
• 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)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

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.