Ansatz-free Hamiltonian learning with Heisenberg-limited scaling

• URL: http://arxiv.org/abs/2502.11900v1
• Date: Mon, 17 Feb 2025 15:23:59 GMT
• Title: Ansatz-free Hamiltonian learning with Heisenberg-limited scaling
• Authors: Hong-Ye Hu, Muzhou Ma, Weiyuan Gong, Qi Ye, Yu Tong, Steven T. Flammia, Susanne F. Yelin,
• Abstract summary: We present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints. We establish a fundamental trade-off between total evolution time and control on learning arbitrary interactions. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems.
• Score: 4.185787832868736
• License:
• Abstract: Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term \emph{ansatz-free Hamiltonian learning}, remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system's real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

Related papers

• Simulating quantum chaos without chaos [1.7942265700058988]
  We introduce a novel class of quantum Hamiltonians that fundamentally challenges the conventional understanding of quantum chaos. Our ensemble is computationally indistinguishable from the Gaussian unitary ensemble (GUE) of strongly-interacting Hamiltonians. This stark contrast between efficient computational indistinguishability and traditional chaos indicators calls into question fundamental assumptions about the nature of quantum chaos.
  arXiv  Detail & Related papers  (2024-10-23T18:01:50Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Universal shot-noise limit for quantum metrology with local Hamiltonians [2.624076371876711]
  We derive a universal and fundamental bound for the growth of the quantum Fisher information. We prove that the precision cannot surpass the shot noise limit at all times in locally interacting quantum systems.
  arXiv  Detail & Related papers  (2023-08-07T16:13:01Z)
• 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 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)
• 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)
• Active Learning of Quantum System Hamiltonians yields Query Advantage [3.07869141026886]
  Hamiltonian learning is an important procedure in quantum system identification, calibration, and successful operation of quantum computers. Standard techniques for Hamiltonian learning require careful design of queries and $O(epsilon-2)$ queries in achieving learning error $epsilon$ due to the standard quantum limit. We introduce an active learner that is given an initial set of training examples and the ability to interactively query the quantum system to generate new training data.
  arXiv  Detail & Related papers  (2021-12-29T13:45:12Z)
• 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.