Comparing Classical Simulation and Sample-Based Learning of Quantum Systems: Learning the Hardness of Quantum Systems from Samples

• URL: http://arxiv.org/abs/2605.28986v1
• Date: Wed, 27 May 2026 18:44:36 GMT
• Title: Comparing Classical Simulation and Sample-Based Learning of Quantum Systems: Learning the Hardness of Quantum Systems from Samples
• Abstract summary: We investigate the relationship between two distinct classical approaches to quantum systems.<n>We use a fixed deep energy-based generative model trained on measurement samples from controlled families of quantum states.
• Score: 41.99844472131922
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the relationship between two distinct classical approaches to quantum systems: direct simulation from a classical description and sample-based learning from measurement data. While both tasks ultimately aim to reproduce Born-rule statistics, complexity-theoretic results suggest that simulability and learnability need not coincide in general. Here we study this relationship empirically using a fixed deep energy-based generative model trained on measurement samples from controlled families of quantum states. We independently tune two quantum resources associated with classical simulation cost: entanglement, through the bond dimension of random matrix product states, and non-stabilizerness, through the number of T gates in Clifford-dominated circuits. Learning difficulty is characterized using two probes of neural-network complexity: the largest Hessian eigenvalue at convergence and Random Subspace Optimization. For both quantum resources, increasing simulation hardness systematically correlates with sharper loss landscapes and degraded reconstruction performance under constrained capacity. Our results indicate that, within the regimes studied here, classical learnability tracks known simulation complexity measures, suggesting that neural-network training dynamics can provide an empirical probe of quantum computational hardness.

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)
• Bounded-Error Quantum Simulation via Hamiltonian and Lindbladian Learning [1.7515811671331791]
  We introduce a general framework for bounded-error quantum simulation.<n>It provides predictions for many-body observables with experimentally quantifiable uncertainties.<n>We demonstrate this framework on trapped-ion quantum simulators implementing long-range Ising interactions with up to 51 ions.
  arXiv  Detail & Related papers  (2025-11-28T17:33:59Z)
• Direct probing of the simulation complexity of open quantum many-body dynamics [42.085941481155295]
  We study the role of dissipation in simulating open-system dynamics using both quantum and classical methods.<n>Our results show that dissipation affects correlation length and mixing time in distinct ways at intermediate and long timescales.
  arXiv  Detail & Related papers  (2025-08-27T15:14:36Z)
• Dynamical simulations of many-body quantum chaos on a quantum computer [3.731709137507907]
  We study a class of maximally chaotic circuits known as dual unitary circuits. We show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators. We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point.
  arXiv  Detail & Related papers  (2024-11-01T17:57:13Z)
• 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)
• Lie-algebraic classical simulations for quantum computing [0.3774866290142281]
  We present a framework for classical simulations, dubbed "$mathfrakg$-sim"<n>We show that $mathfrakg$-sim enables new regimes for classical simulations.<n>We report large-scale noiseless and noisy simulations on benchmark problems.
  arXiv  Detail & Related papers  (2023-08-02T21:08:18Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00: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.