Entanglement Devised Barren Plateau Mitigation

• URL: http://arxiv.org/abs/2012.12658v1
• Date: Tue, 22 Dec 2020 17:49:38 GMT
• Title: Entanglement Devised Barren Plateau Mitigation
• Authors: Taylor L. Patti, Khadijeh Najafi, Xun Gao, Susanne F. Yelin
• Abstract summary: We implicate random entanglement as the source of barren plateaus and characterize them in terms of many-body entanglement dynamics. We propose and demonstrate a number of barren plateau ameliorating techniques. We find that entanglement limiting, both automatic and engineered, is a hallmark of high-accuracy training.
• Score: 1.382143546774115
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hybrid quantum-classical variational algorithms are one of the most propitious implementations of quantum computing on near-term devices, offering classical machine learning support to quantum scale solution spaces. However, numerous studies have demonstrated that the rate at which this space grows in qubit number could preclude learning in deep quantum circuits, a phenomenon known as barren plateaus. In this work, we implicate random entanglement as the source of barren plateaus and characterize them in terms of many-body entanglement dynamics, detailing their formation as a function of system size, circuit depth, and circuit connectivity. Using this comprehension of entanglement, we propose and demonstrate a number of barren plateau ameliorating techniques, including: initial partitioning of cost function and non-cost function registers, meta-learning of low-entanglement circuit initializations, selective inter-register interaction, entanglement regularization, the addition of Langevin noise, and rotation into preferred cost function eigenbases. We find that entanglement limiting, both automatic and engineered, is a hallmark of high-accuracy training, and emphasize that as learning is an iterative organization process while barren plateaus are a consequence of randomization, they are not necessarily unavoidable or inescapable. Our work forms both a theoretical characterization and a practical toolbox; first defining barren plateaus in terms of random entanglement and then employing this expertise to strategically combat them.

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)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• A Survey of Methods for Mitigating Barren Plateaus for Parameterized Quantum Circuits [0.0]
  Barren Plateaus are a formidable challenge for hybrid quantum-classical algorithms that lead to flat plateaus in the loss function. This paper provides a conceptual perspective between classical interpretations of vanishing gradients as well as dive into techniques of cost functions, entanglement, strategies to barren plateaus.
  arXiv  Detail & Related papers  (2024-06-20T13:10:26Z)
• Avoiding barren plateaus via Gaussian Mixture Model [6.0599055267355695]
  Variational quantum algorithms are one of the most representative algorithms in quantum computing. They face challenges when dealing with large numbers of qubits, deep circuit layers, or global cost functions, making them often untrainable.
  arXiv  Detail & Related papers  (2024-02-21T03:25:26Z)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• Does provable absence of barren plateaus imply classical simulability? Or, why we need to rethink variational quantum computing [0.0]
  We ask: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We present strong evidence that commonly used models with provable absence of barren plateaus are also classically simulable. Our analysis sheds serious doubt on the non-classicality of the information processing capabilities of parametrized quantum circuits for barren plateau-free landscapes.
  arXiv  Detail & Related papers  (2023-12-14T16:54:57Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms [0.7462336024223667]
  Barren plateaus are a notorious problem in the optimization of variational quantum algorithms. We propose an alternative strategy which initializes the parameters of a unitary gate by drawing from a beta distribution. We empirically show that our proposed framework significantly reduces the possibility of a complex quantum neural network getting stuck in a barren plateau.
  arXiv  Detail & Related papers  (2022-04-28T19:46:10Z)
• 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)
• 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)
• Barren plateaus preclude learning scramblers [2.442224099834475]
  Scrambling processes rapidly spread entanglement through many-body quantum systems. We ask if quantum machine learning (QML) could be used to investigate such processes.
  arXiv  Detail & Related papers  (2020-09-30T17:31:36Z)

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.