Capacity and quantum geometry of parametrized quantum circuits

Abstract

To harness the potential of noisy intermediate-scale quantum devices, it is paramount to find the best type of circuits to run hybrid quantum-classical algorithms. Key candidates are parametrized quantum circuits that can be effectively implemented on current devices. Here, we evaluate the capacity and trainability of these circuits using the geometric structure of the parameter space via the effective quantum dimension, which reveals the expressive power of circuits in general as well as of particular initialization strategies. We assess the expressive power of various popular circuit types and find striking differences depending on the type of entangling gates used. Particular circuits are characterized by scaling laws in their expressiveness. We identify a transition in the quantum geometry of the parameter space, which leads to a decay of the quantum natural gradient for deep circuits. For shallow circuits, the quantum natural gradient can be orders of magnitude larger in value compared to the regular gradient; however, both of them can suffer from vanishing gradients. By tuning a fixed set of circuit parameters to randomized ones, we find a region where the circuit is expressive, but does not suffer from barren plateaus, hinting at a good way to initialize circuits. We show an algorithm that prunes redundant parameters of a circuit without affecting its effective dimension. Our results enhance the understanding of parametrized quantum circuits and can be immediately applied to improve variational quantum algorithms.

arXiv comment13 pages, 12 figures. Code available at https://github.com/txhaug/quantum-geometry

References in corpus (35)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum Circuit Learning
• Quantum Chemistry in the Age of Quantum Computing
• Quantum Convolutional Neural Networks
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• The power of quantum neural networks
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Quantum Fisher information matrix and multiparameter estimation
• Efficient variational quantum simulator incorporating active error minimisation
• Variational ansatz-based quantum simulation of imaginary time evolution
• Quantum Natural Gradient
• Theory of variational quantum simulation
• Direct estimations of linear and non-linear functionals of a quantum state
• Universal Quantum Estimator
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• The Expressive Power of Parameterized Quantum Circuits
• Reinforcement Learning in Different Phases of Quantum Control
• Estimating the gradient and higher-order derivatives on quantum hardware
• Large gradients via correlation in random parameterized quantum circuits
• Methodology for replacing indirect measurements with direct measurements
• Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
• Adaptive Variational Quantum Dynamics Simulations
• A variational toolbox for quantum multi-parameter estimation
• From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
• Geometry of learning neural quantum states
• Characterizing the loss landscape of variational quantum circuits
• Measurement cost of metric-aware variational quantum algorithms
• Sub-Quantum Fisher Information
• Reducing the amount of single-qubit rotations in VQE and related algorithms

Cited by in corpus (29)

• Noisy intermediate-scale quantum (NISQ) algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum circuit architecture search for variational quantum algorithms
• Theory of overparametrization in quantum neural networks
• Avoiding barren plateaus using classical shadows
• Fisher Information in Noisy Intermediate-Scale Quantum Applications
• Scalable measures of magic resource for quantum computers
• Recent advances for quantum classifiers
• Quantum machine learning of large datasets using randomized measurements
• Quantum variational optimization: The role of entanglement and problem hardness
• Quantum Instruction Set Design for Performance
• Error propagation in NISQ devices for solving classical optimization problems
• Progress toward favorable landscapes in quantum combinatorial optimization
• Quantum Transfer Learning for Real-World, Small, and High-Dimensional Datasets
• Noisy intermediate-scale quantum algorithm for semidefinite programming
• Hierarchical quantum circuit representations for neural architecture search
• Optimal training of variational quantum algorithms without barren plateaus
• Information geometry under hierarchical quantum measurement
• Quantum variational learning for quantum error-correcting codes
• Explaining Quantum Circuits with Shapley Values: Towards Explainable Quantum Machine Learning
• Stochastic noise can be helpful for variational quantum algorithms
• Connecting geometry and performance of two-qubit parameterized quantum circuits
• Natural parameterized quantum circuit
• Entanglement Diagnostics for Efficient Quantum Computation
• Automatic quantum circuit encoding of a given arbitrary quantum state
• Expressivity of Variational Quantum Machine Learning on the Boolean Cube
• Characterization of variational quantum algorithms using free fermions
• Learning Fourier series with parametrized quantum circuits
• On Assessing the Quantum Advantage for MaxCut Provided by Quantum Neural Network Ansätze