Expressibility and trainability of parameterized analog quantum systems for machine learning applications

• URL: http://arxiv.org/abs/2005.11222v1
• Date: Fri, 22 May 2020 14:59:42 GMT
• Title: Expressibility and trainability of parameterized analog quantum systems for machine learning applications
• Authors: Jirawat Tangpanitanon, Supanut Thanasilp, Ninnat Dangniam, Marc-Antoine Lemonde, Dimitris G. Angelakis
• Abstract summary: We show how interplay between external driving and disorder in the system dictates the trainability and expressibility of interacting quantum systems. Our work shows the fundamental connection between quantum many-body physics and its application in machine learning.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Parameterized quantum evolution is the main ingredient in variational quantum algorithms for near-term quantum devices. In digital quantum computing, it has been shown that random parameterized quantum circuits are able to express complex distributions intractable by a classical computer, leading to the demonstration of quantum supremacy. However, their chaotic nature makes parameter optimization challenging in variational approaches. Evidence of similar classically-intractable expressibility has been recently demonstrated in analog quantum computing with driven many-body systems. A thorough investigation of trainability of such analog systems is yet to be performed. In this work, we investigate how the interplay between external driving and disorder in the system dictates the trainability and expressibility of interacting quantum systems. We show that if the system thermalizes, the training fails at the expense of the a large expressibility, while the opposite happens when the system enters the many-body localized (MBL) phase. From this observation, we devise a protocol using quenched MBL dynamics which allows accurate trainability while keeping the overall dynamics in the quantum supremacy regime. Our work shows the fundamental connection between quantum many-body physics and its application in machine learning. We conclude our work with an example application in generative modeling employing a well studied analog many-body model of a driven Ising spin chain. Our approach can be implemented with a variety of available quantum platforms including cold ions, atoms and superconducting circuits

Related papers

• 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)
• Quantum Equilibrium Propagation for efficient training of quantum systems based on Onsager reciprocity [0.0]
  Equilibrium propagation (EP) is a procedure that has been introduced and applied to classical energy-based models which relax to an equilibrium. Here, we show a direct connection between EP and Onsager reciprocity and exploit this to derive a quantum version of EP. This can be used to optimize loss functions that depend on the expectation values of observables of an arbitrary quantum system.
  arXiv  Detail & Related papers  (2024-06-10T17:22:09Z)
• Simulation of open quantum systems on universal quantum computers [15.876768787615179]
  We present an innovative and scalable method to simulate open quantum systems using quantum computers. We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel. accurate long-time simulation can also be achieved as the adjoint density matrix and the true dissipated one converges to the same state.
  arXiv  Detail & Related papers  (2024-05-31T09:07:27Z)
• 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)
• Thermodynamics of quantum trajectories on a quantum computer [0.0]
  Open-system dynamics are simulated on a quantum computer by coupling a system of interest to ancilla. We show how to control the dynamics of the open system in order to enhance the probability of quantum trajectories with desired properties.
  arXiv  Detail & Related papers  (2023-01-17T19:00:03Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Efficient Quantum Simulation of Open Quantum System Dynamics on Noisy Quantum Computers [0.0]
  We show that quantum dissipative dynamics can be simulated efficiently across coherent-to-incoherent regimes. This work provides a new direction for quantum advantage in the NISQ era.
  arXiv  Detail & Related papers  (2021-06-24T10:37:37Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
  We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated. The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible. Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
  arXiv  Detail & Related papers  (2020-01-15T18:36:53Z)

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.