Laziness, Barren Plateau, and Noise in Machine Learning

• URL: http://arxiv.org/abs/2206.09313v1
• Date: Sun, 19 Jun 2022 02:58:14 GMT
• Title: Laziness, Barren Plateau, and Noise in Machine Learning
• Authors: Junyu Liu, Zexi Lin, Liang Jiang
• Abstract summary: We discuss the difference between laziness and emphbarren plateau in quantum machine learning. We show that variational quantum algorithms are noise-resilient in the overparametrization regime.
• Score: 10.058827198658252
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We define \emph{laziness} to describe a large suppression of variational parameter updates for neural networks, classical or quantum. In the quantum case, the suppression is exponential in the number of qubits for randomized variational quantum circuits. We discuss the difference between laziness and \emph{barren plateau} in quantum machine learning created by quantum physicists in \cite{mcclean2018barren} for the flatness of the loss function landscape during gradient descent. We address a novel theoretical understanding of those two phenomena in light of the theory of neural tangent kernels. For noiseless quantum circuits, without the measurement noise, the loss function landscape is complicated in the overparametrized regime with a large number of trainable variational angles. Instead, around a random starting point in optimization, there are large numbers of local minima that are good enough and could minimize the mean square loss function, where we still have quantum laziness, but we do not have barren plateaus. However, the complicated landscape is not visible within a limited number of iterations, and low precision in quantum control and quantum sensing. Moreover, we look at the effect of noises during optimization by assuming intuitive noise models, and show that variational quantum algorithms are noise-resilient in the overparametrization regime. Our work precisely reformulates the quantum barren plateau statement towards a precision statement and justifies the statement in certain noise models, injects new hope toward near-term variational quantum algorithms, and provides theoretical connections toward classical machine learning. Our paper provides conceptual perspectives about quantum barren plateaus, together with discussions about the gradient descent dynamics in \cite{together}.

Related papers

• Noise-induced shallow circuits and absence of barren plateaus [2.5295633594332334]
  We show that any noise truncates' most quantum circuits to effectively logarithmic depth. We then prove that quantum circuits under any non-unital noise exhibit lack of barren plateaus for cost functions composed of local observables.
  arXiv  Detail & Related papers  (2024-03-20T19:00:49Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps [0.0]
  We show that variational quantum models are untrainable if no good initial guess is known. We also show that noisy variety of quantum models is impossible with a sub-exponential number of queries.
  arXiv  Detail & Related papers  (2022-05-11T21:55:42Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Schr\"odinger-Heisenberg Variational Quantum Algorithms [1.9887498823918806]
  Recent breakthroughs have opened the possibility to intermediate-scale quantum computing with tens to hundreds of qubits. The extremely high accuracy needed to surpass classical computers poses a critical demand to the circuit depth. Here, we propose a paradigm of Schr"odinger-Heisenberg variational quantum algorithms to resolve this problem.
  arXiv  Detail & Related papers  (2021-12-15T04:53:01Z)
• 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)
• Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols [0.0]
  algorithmic classes such as variational quantum algorithms have been shown to suffer from barren plateaus. We present an approach to quantum algorithm optimization that is based on trainable Fourier coefficients of Hamiltonian system parameters.
  arXiv  Detail & Related papers  (2021-11-15T21:13:10Z)
• 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 Noise Sensing by generating Fake Noise [5.8010446129208155]
  We propose a framework to characterize noise in a realistic quantum device. Key idea is to learn about the noise by mimicking it in a way that one cannot distinguish between the real (to be sensed) and the fake (generated) one. We find that, when applied to the benchmarking case of Pauli channels, the SuperQGAN protocol is able to learn the associated error rates even in the case of spatially and temporally correlated noise.
  arXiv  Detail & Related papers  (2021-07-19T09:42:37Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)

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.