Teacher-student learning for a binary perceptron with quantum fluctuations

• URL: http://arxiv.org/abs/2102.08609v2
• Date: Thu, 22 Apr 2021 12:40:02 GMT
• Title: Teacher-student learning for a binary perceptron with quantum fluctuations
• Authors: Shunta Arai, Masayuki Ohzeki, Kazuyuki Tanaka
• Abstract summary: An exponential number of local minima dominate the energy landscape of the binary perceptron. Local search algorithms often fail to identify the ground state of a binary perceptron. Due to the quantum fluctuations, we can efficiently find robust solutions that have better generalisation performance than the classical model.
• Score: 0.966840768820136
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We analysed the generalisation performance of a binary perceptron with quantum fluctuations using the replica method. An exponential number of local minima dominate the energy landscape of the binary perceptron. Local search algorithms often fail to identify the ground state of a binary perceptron. In this study, we considered the teacher-student learning method and computed the generalisation error of a binary perceptron with quantum fluctuations. Due to the quantum fluctuations, we can efficiently find robust solutions that have better generalisation performance than the classical model. We validated our theoretical results through quantum Monte Carlo simulations. We adopted the replica symmetry (RS) ansatz assumption and static approximation. The RS solutions are consistent with our simulation results, except for the relatively low strength of the transverse field and high pattern ratio. These deviations are caused by the violation of ergodicity and static approximation. After accounting for the deviation between the RS solutions and numerical results, the enhancement of generalisation performance with quantum fluctuations holds.

Related papers

• 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 of Long-Range and Equivariant Quantum Systems [9.427635404752936]
  We consider a fundamental task in quantum many-body physics - finding and learning ground states of quantum Hamiltonians and their properties. Recent works have studied the task of predicting the ground state expectation value of sums of geometrically local observables by learning from data. We extend these results beyond the local requirements on both Hamiltonians and observables, motivated by the relevance of long-range interactions in molecular and atomic systems.
  arXiv  Detail & Related papers  (2023-12-28T13:42:59Z)
• Improved Digital Quantum Simulation by Non-Unitary Channels [0.5999777817331317]
  We study the performance of non-unitary simulation channels and consider the error structure of channels constructed from a weighted average of unitary circuits. We show that averaging over just a few simulation circuits can significantly reduce the Trotterization error for both single-step short-time and multi-step long-time simulations.
  arXiv  Detail & Related papers  (2023-07-24T18:00:02Z)
• Provably efficient variational generative modeling of quantum many-body systems via quantum-probabilistic information geometry [3.5097082077065003]
  We introduce a generalization of quantum natural gradient descent to parameterized mixed states. We also provide a robust first-order approximating algorithm, Quantum-Probabilistic Mirror Descent. Our approaches extend previously sample-efficient techniques to allow for flexibility in model choice.
  arXiv  Detail & Related papers  (2022-06-09T17:58:15Z)
• Assessment of the variational quantum eigensolver: application to the Heisenberg model [0.0]
  We present and analyze large-scale simulation results of a hybrid quantum-classical variational method to calculate the ground state energy of the anti-ferromagnetic Heisenberg model. We predict that a fully functional quantum computer with 100 qubits can calculate the ground state energy with a relatively small error.
  arXiv  Detail & Related papers  (2022-01-13T16:49:04Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30: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)
• Quantum Perceptron Revisited: Computational-Statistical Tradeoffs [4.791233143264229]
  We introduce a hybrid quantum-classical perceptron algorithm with lower complexity and better generalization ability than the classical perceptron. We derive a bound on the expected error of the hypothesis returned by our algorithm, which compares favorably to the one obtained with the classical online perceptron.
  arXiv  Detail & Related papers  (2021-06-04T14:05:54Z)
• Assessment of weak-coupling approximations on a driven two-level system under dissipation [58.720142291102135]
  We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation. We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
  arXiv  Detail & Related papers  (2020-11-11T22:45:57Z)

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.