Entanglement entropy production in Quantum Neural Networks

Abstract

Quantum Neural Networks (QNN) are considered a candidate for achieving quantum advantage in the Noisy Intermediate Scale Quantum computer (NISQ) era. Several QNN architectures have been proposed and successfully tested on benchmark datasets for machine learning. However, quantitative studies of the QNN-generated entanglement have been investigated only for up to few qubits. Tensor network methods allow to emulate quantum circuits with a large number of qubits in a wide variety of scenarios. Here, we employ matrix product states to characterize recently studied QNN architectures with random parameters up to fifty qubits showing that their entanglement, measured in terms of entanglement entropy between qubits, tends to that of Haar distributed random states as the depth of the QNN is increased. We certify the randomness of the quantum states also by measuring the expressibility of the circuits, as well as using tools from random matrix theory. We show a universal behavior for the rate at which entanglement is created in any given QNN architecture, and consequently introduce a new measure to characterize the entanglement production in QNNs: the entangling speed. Our results characterise the entanglement properties of quantum neural networks, and provides new evidence of the rate at which these approximate random unitaries.

arXiv comment27 pages, 12 figures. Accepted in Quantum 2023-04-11. Code available at https://github.com/mballarin97/mps_qnn

References in corpus (54)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Average Entropy of a Subsystem
• Quantum Convolutional Neural Networks
• Evolution of Entanglement Entropy in One-Dimensional Systems
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• The power of quantum neural networks
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• The effect of data encoding on the expressive power of variational quantum machine learning models
• Power of data in quantum machine learning
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Time-evolution methods for matrix-product states
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Data re-uploading for a universal quantum classifier
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Global entanglement in multiparticle systems
• Aspects of generic entanglement
• Layerwise learning for quantum neural networks
• Random Quantum Circuits are Approximate 2-designs
• Local random quantum circuits are approximate polynomial-designs
• Emergent statistical mechanics of entanglement in random unitary circuits
• Information-theoretic bounds on quantum advantage in machine learning
• Effect of barren plateaus on gradient-free optimization
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Quantum machine learning beyond kernel methods
• Exploiting symmetry in variational quantum machine learning
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Entanglement Devised Barren Plateau Mitigation
• The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems
• Average fidelity between random quantum states
• Avoiding barren plateaus using classical shadows
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Quantum computing models for artificial neural networks
• Unitary quantum perceptron as efficient universal approximator
• On the Universality of the Quantum Approximate Optimization Algorithm
• Reformulation of the No-Free-Lunch Theorem for Entangled Data Sets
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage
• Entanglement of random vectors
• Entanglement, quantum randomness, and complexity beyond scrambling
• Distinguishability of generic quantum states
• Variational learning for quantum artificial neural networks
• An entanglement perspective on the quantum approximate optimization algorithm
• Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
• Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver
• Entanglement Diagnostics for Efficient Quantum Computation

Cited by in corpus (10)

• Calibrating the role of entanglement in variational quantum circuits
• A General Approach to Dropout in Quantum Neural Networks
• Dequantizing quantum machine learning models using tensor networks
• Noise effects on purity and quantum entanglement in terms of physical implementability
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement
• Machine-Learning Insights into the Entanglement-trainability Correlation of Parameterized Quantum Circuits
• Learning Fourier series with parametrized quantum circuits
• Error mitigation of entangled states using brainbox quantum autoencoders
• High-expressibility Quantum Neural Networks using only classical resources
• Transfer entropy and O-information to detect grokking in tensor network multi-class classification problems