Provable learning separation for predicting time-evolution of quantum many-body systems

• URL: http://arxiv.org/abs/2607.06472v1
• Date: Tue, 07 Jul 2026 16:30:09 GMT
• Title: Provable learning separation for predicting time-evolution of quantum many-body systems
• Abstract summary: We study the learnability of quantum many-body dynamics from the perspective of probably approximately correct (PAC)<n>We show that the classically hard instance maintains quantum learnability.<n>We also give an interpretation of our results in learning-assisted certified quantum simulation.
• Score: 19.701166175423747
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Given that quantum computers are naturally suited to simulate the behavior of quantum many-body systems, an immediate question arises: can one formulate physically motivated quantum machine learning (QML) tasks that exhibit learning separations? We address this problem by studying the learnability of quantum many-body dynamics from the perspective of probably approximately correct (PAC)-learning. Concretely, we devise a supervised learning problem where the training set consists of specifications of randomized stabilizer probe states, evolution times sampled uniformly from a polynomially large time interval $[0,T]$, coupled with expectation values of certain observables evaluated on the resulting time-evolved state under an unknown Hamiltonian. For this learning task, we provide an efficient quantum procedure whose training phase learns the underlying Hamiltonian from short-time training samples, and whose deployment phase combines Hamiltonian simulation with the classical shadows protocol to perform inference on a newly given data point. By contrast, the existence of $O(\mathsf{poly}(n))$-time instances ensures classical hardness: by embedding a $\mathsf{BQP}$-complete computation into the polynomially long time-dynamics of a low-intersection variant of the Feynman-Kitaev clock Hamiltonian construction, we show that, for a certain family of input distributions, no randomized classical polynomial-time algorithm can fulfill our learning condition, unless $\mathsf{BQP}\subseteq\mathsf{P/poly}$. Furthermore, we show that the classically hard instance maintains quantum learnability. We also give an interpretation of our results in learning-assisted certified quantum simulation. Taken together, our results demonstrate a rigorous learning separation for a natural ML task based on Hamiltonian evolution, while building connections between quantum learning theory, quantum simulation, and QML.

Related papers

• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Quantum Advantage in Learning Quantum Dynamics via Fourier coefficient extraction [1.1999555634662633]
  We tackle the supervised learning version of the problem of learning unknown Hamiltonian dynamics.<n>We prove that this task can yield provable exponential classical-quantum learning advantages under common complexity assumptions in natural settings.<n>We discuss the limitations of generalizing our method to arbitrary quantum dynamics while maintaining provable guarantees.
  arXiv  Detail & Related papers  (2025-06-20T15:51:27Z)
• 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)
• Dense outputs from quantum simulations [5.295277584890625]
  The quantum dense output problem is the process of evaluating time-accumulated observables from time-dependent quantum dynamics. This problem arises frequently in applications such as quantum control and spectroscopic computation. We present a range of algorithms designed to operate on both early and fully fault-tolerant quantum platforms.
  arXiv  Detail & Related papers  (2023-07-26T18:16:51Z)
• 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)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [48.491303218786044]
  TeD-Q is an open-source software framework for quantum machine learning.<n>It seamlessly integrates classical machine learning libraries with quantum simulators.<n>It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix [0.0]
  Learning about physical systems from quantum-enhanced experiments can outperform learning from experiments in which only classical memory and processing are available. We show that a quantum memory allows to efficiently solve the following tasks. Our results highlight the power of quantum-enhanced experiments for learning highly complex quantum dynamics.
  arXiv  Detail & Related papers  (2022-12-08T18:46:06Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• A quantum generative model for multi-dimensional time series using Hamiltonian learning [0.0]
  We propose using the inherent nature of quantum computers to simulate quantum dynamics as a technique to encode such features. We use the learned model to generate out-of-sample time series and show that it captures unique and complex features of the learned time series. We experimentally demonstrate the proposed algorithm on an 11-qubit trapped-ion quantum machine.
  arXiv  Detail & Related papers  (2022-04-13T03:06:36Z)
• Quantum Algorithmic Measurement [0.32228025627337864]
  We define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms and interactive protocols. We use the QUALM framework to study two important experimental problems in quantum many-body physics. Our work suggests that quantum computers can provide a new type of exponential advantage: exponential savings in resources in quantum experiments.
  arXiv  Detail & Related papers  (2021-01-12T17:43:17Z)

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.