Active Learning of Quantum System Hamiltonians yields Query Advantage

• URL: http://arxiv.org/abs/2112.14553v1
• Date: Wed, 29 Dec 2021 13:45:12 GMT
• Title: Active Learning of Quantum System Hamiltonians yields Query Advantage
• Authors: Arkopal Dutt, Edwin Pednault, Chai Wah Wu, Sarah Sheldon, John Smolin, Lev Bishop, Isaac L. Chuang
• Abstract summary: 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.
• Score: 3.07869141026886
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hamiltonian learning is an important procedure in quantum system identification, calibration, and successful operation of quantum computers. Through queries to the quantum system, this procedure seeks to obtain the parameters of a given Hamiltonian model and description of noise sources. 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. With the goal of efficiently and accurately estimating the Hamiltonian parameters within learning error $\epsilon$ through minimal queries, 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. We formally specify and experimentally assess the performance of this Hamiltonian active learning (HAL) algorithm for learning the six parameters of a two-qubit cross-resonance Hamiltonian on four different superconducting IBM Quantum devices. Compared with standard techniques for the same problem and a specified learning error, HAL achieves up to a $99.8\%$ reduction in queries required, and a $99.1\%$ reduction over the comparable non-adaptive learning algorithm. Moreover, with access to prior information on a subset of Hamiltonian parameters and given the ability to select queries with linearly (or exponentially) longer system interaction times during learning, HAL can exceed the standard quantum limit and achieve Heisenberg (or super-Heisenberg) limited convergence rates during learning.

Related papers

• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• 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. 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. We establish a rigorous theoretical framework proving that, given access to an unknown spin-boson type Hamiltonian, our algorithm achieves Heisenberg-limited estimation. 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)
• Ansatz-free Hamiltonian learning with Heisenberg-limited scaling [4.185787832868736]
  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.
  arXiv  Detail & Related papers  (2025-02-17T15:23:59Z)
• 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. We develop a quantum algorithm for coherent function simulation on two quantum signal processing structures. 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)
• 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)
• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• 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. Q-Newton utilizes a streamlined scheduling module that coordinates between quantum and classical linear solvers. 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)
• Truncation technique for variational quantum eigensolver for Molecular Hamiltonians [0.0]
  variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for noisy quantum devices. We propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian. This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer.
  arXiv  Detail & Related papers  (2024-02-02T18:45:12Z)
• Variational Denoising for Variational Quantum Eigensolver [0.28675177318965045]
  The variational quantum eigensolver (VQE) is a hybrid algorithm that has the potential to provide a quantum advantage in practical chemistry problems. VQE faces challenges in task-specific design and machine-specific architecture, particularly when running on noisy quantum devices. We propose variational denoising, an unsupervised learning method that employs a parameterized quantum neural network to improve the solution of VQE.
  arXiv  Detail & Related papers  (2023-04-02T14:56:15Z)
• Quantum variational learning for entanglement witnessing [0.0]
  This work focuses on the potential implementation of quantum algorithms allowing to properly classify quantum states defined over a single register of $n$ qubits. We exploit the notion of "entanglement witness", i.e., an operator whose expectation values allow to identify certain specific states as entangled. We made use of Quantum Neural Networks (QNNs) in order to successfully learn how to reproduce the action of an entanglement witness.
  arXiv  Detail & Related papers  (2022-05-20T20:14:28Z)
• An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
  Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
  arXiv  Detail & Related papers  (2022-05-11T12:10:52Z)
• Robustly learning the Hamiltonian dynamics of a superconducting quantum processor [0.5564835829075486]
  We robustly estimate the free Hamiltonian parameters of bosonic excitations in a superconducting-qubit analog quantum simulator. Our results constitute an accurate implementation of a dynamical quantum simulation.
  arXiv  Detail & Related papers  (2021-08-18T18:01:01Z)
• A Hybrid Quantum-Classical Hamiltonian Learning Algorithm [6.90132007891849]
  Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators. We propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator of the Hamiltonian.
  arXiv  Detail & Related papers  (2021-03-01T15:15:58Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.