Provably Efficient Adiabatic Learning for Quantum-Classical Dynamics

• URL: http://arxiv.org/abs/2408.00276v2
• Date: Thu, 8 Aug 2024 14:47:23 GMT
• Title: Provably Efficient Adiabatic Learning for Quantum-Classical Dynamics
• Authors: Changnan Peng, Jin-Peng Liu, Gia-Wei Chern, Di Luo,
• Abstract summary: We develop a generic theoretical framework for analyzing quantum-classical adiabatic dynamics with learning algorithms. Based on quantum information theory, we develop a provably efficient adiabatic learning (PEAL) algorithm with logarithmic system size sampling complexity. We benchmark PEAL on the Holstein model, and demonstrate its accuracy in predicting single-path dynamics and ensemble dynamics observables as well as transfer learning over a family of Hamiltonians.
• Score: 4.381980584443765
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum-classical hybrid dynamics is crucial for accurately simulating complex systems where both quantum and classical behaviors need to be considered. However, coupling between classical and quantum degrees of freedom and the exponential growth of the Hilbert space present significant challenges. Current machine learning approaches for predicting such dynamics, while promising, remain unknown in their error bounds, sample complexity, and generalizability. In this work, we establish a generic theoretical framework for analyzing quantum-classical adiabatic dynamics with learning algorithms. Based on quantum information theory, we develop a provably efficient adiabatic learning (PEAL) algorithm with logarithmic system size sampling complexity and favorable time scaling properties. We benchmark PEAL on the Holstein model, and demonstrate its accuracy in predicting single-path dynamics and ensemble dynamics observables as well as transfer learning over a family of Hamiltonians. Our framework and algorithm open up new avenues for reliable and efficient learning of quantum-classical dynamics.

Related papers

• Quantum reservoir computing on random regular graphs [0.0]
  Quantum reservoir computing (QRC) is a low-complexity learning paradigm that combines input-driven many-body quantum systems with classical learning techniques. We study information localization, dynamical quantum correlations, and the many-body structure of the disordered Hamiltonian. Our findings thus provide guidelines for the optimal design of disordered analog quantum learning platforms.
  arXiv  Detail & Related papers  (2024-09-05T16:18:03Z)
• 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)
• Spectral chaos bounds from scaling theory of maximally efficient quantum-dynamical scrambling [49.1574468325115]
  A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient. We develop a single- parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics. We establish that scaling predictions are matched by a privileged process, and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all timescales.
  arXiv  Detail & Related papers  (2023-10-17T15:41:50Z)
• 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)
• Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum Circuit [62.55763504085508]
  We prove that a classical-to-quantum transfer learning architecture using a Variational Quantum Circuit (VQC) improves the representation and generalization (estimation error) capabilities of the VQC model. We show that the architecture of classical-to-quantum transfer learning leverages pre-trained classical generative AI models, making it easier to find the optimal parameters for the VQC in the training stage.
  arXiv  Detail & Related papers  (2023-05-18T03:08:18Z)
• Mixed Quantum-Classical Dynamics for Near Term Quantum Computers [0.0]
  Mixed quantum-classical dynamics is often used to understand systems too complex to treat fully quantum mechanically. We present a modular algorithm for general mixed quantum-classical dynamics where the quantum subsystem is coupled with the classical subsystem.
  arXiv  Detail & Related papers  (2023-03-20T18:23:15Z)
• Mean-field dynamics of open quantum systems with collective operator-valued rates: validity and application [0.0]
  We consider a class of open quantum many-body Lindblad dynamics characterized by an all-to-all coupling Hamiltonian. We study the time evolution in the limit of infinitely large systems, and we demonstrate the exactness of the mean-field equations for the dynamics of average operators. Our results allow for a rigorous and systematic investigation of the impact of quantum effects on paradigmatic classical models.
  arXiv  Detail & Related papers  (2023-02-08T15:58:39Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Classical simulation of short-time quantum dynamics [0.0]
  We present classical algorithms for approximating the dynamics of local observables and nonlocal quantities. We establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
  arXiv  Detail & Related papers  (2022-10-20T18:00:04Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

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.