Calibrating the role of entanglement in variational quantum circuits

Abstract

Entanglement is a key property of quantum computing that separates it from its classical counterpart, however, its exact role in the performance of quantum algorithms, especially variational quantum algorithms, is not well understood. In this work, we utilise tensor network methods to systematically probe the role of entanglement in the working of two variational quantum algorithms, the Quantum Approximate Optimisation Algorithm (QAOA) and Quantum Neural Networks (QNNs), on prototypical problems under controlled entanglement environments. We find that for the MAX-CUT problem solved using QAOA, the fidelity as a function of entanglement is highly dependent on the number of layers, layout of edges in the graph, and edge density, generally exhibiting that a high number of layers indicates a higher resilience to truncation of entanglement. This is in contrast to previous studies based on no more than four QAOA layers which show that the fidelity of QAOA follows a scaling law with respect to the entanglement per qubit of the system. Contrarily, in the case of QNNs, trained circuits with high test accuracies are underpinned by higher entanglement, with any enforced limitation in entanglement resulting in a sharp decline in test accuracy. This is corroborated by the entanglement entropy of these circuits which is consistently high suggesting that, unlike QAOA, QNNs may require quantum devices capable of generating highly entangled states. Overall our work provides a deeper understanding of the role of entanglement in the working of variational quantum algorithms which may help to implement these algorithms on NISQ-era quantum hardware in a way that maximises their accuracies.

arXiv comment19 pages, 16 figures

References in corpus (35)

• Quantum Computing in the NISQ era and beyond
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• Supervised learning with quantum enhanced feature spaces
• Efficient classical simulation of slightly entangled quantum computations
• Barren plateaus in quantum neural network training landscapes
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Challenges and Opportunities in Quantum Machine Learning
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Quantum computing for finance: overview and prospects
• Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
• Quantum autoencoders for efficient compression of quantum data
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Computing for Finance: State of the Art and Future Prospects
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Robust data encodings for quantum classifiers
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Hybrid quantum neural network for drug response prediction
• Applying the Quantum Approximate Optimization Algorithm to the Tail Assignment Problem
• Whole-device entanglement in a 65-qubit superconducting quantum computer
• Towards quantum enhanced adversarial robustness in machine learning
• Benchmarking Adversarially Robust Quantum Machine Learning at Scale
• Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
• Quantum variational optimization: The role of entanglement and problem hardness
• Training Saturation in Layerwise Quantum Approximate Optimisation
• Simulation of many-qubit quantum computation with matrix product states
• Entanglement entropy production in Quantum Neural Networks
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

Cited by in corpus (13)

• Stabilizer Tensor Networks with Magic State Injection
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Numerical solution of nonlinear Schrödinger equation by a hybrid pseudospectral-variational quantum algorithm
• Genuine Multipartite Entanglement in Quantum Optimization
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement
• Machine-Learning Insights into the Entanglement-trainability Correlation of Parameterized Quantum Circuits
• Entanglement of photonic modes from a continuously driven two-level system
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• Qubit-efficient quantum combinatorial optimization solver
• Adiabatic Dynamics of Entanglement
• GCAMPS: A Scalable Classical Simulator for Qudit Systems
• Quantum-assisted tracer dispersion in turbulent shear flow
• A New Scaling Function for QAOA Tensor Network Simulations