Dimensional Expressivity Analysis of Parametric Quantum Circuits

Abstract

Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, we develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.

arXiv comment37 pages, 13 figures, journal version

References in corpus (21)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• Error mitigation for short-depth quantum circuits
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Quantum algorithms: an overview
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Quantum computing for finance: overview and prospects
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Practical Quantum Error Mitigation for Near-Future Applications
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Quantum Simulation of Helium Hydride in a Solid-State Spin Register
• A resource efficient approach for quantum and classical simulations of gauge theories in particle physics
• Adaptive pruning-based optimization of parameterized quantum circuits
• Reducing the amount of single-qubit rotations in VQE and related algorithms
• Zeta-regularized vacuum expectation values
• Sampling and scrambling on a chain of superconducting qubits

Cited by in corpus (39)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Simulation for High Energy Physics
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• SU(2) hadrons on a quantum computer
• Efficient measure for the expressivity of variational quantum algorithms
• Recent advances for quantum classifiers
• Quantum Neural Network Classifiers: A Tutorial
• Hybrid Classical-Quantum Autoencoder for Anomaly Detection
• Towards Quantum Simulations in Particle Physics and Beyond on Noisy Intermediate-Scale Quantum Devices
• The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Connecting geometry and performance of two-qubit parameterized quantum circuits
• Towards the real-time evolution of gauge-invariant ${\mathbb{Z}}_2$ and $U(1)$ quantum link models on NISQ Hardware with error-mitigation
• Quantum Energy Landscape and VQA Optimization
• Critical behavior of Ising model by preparing thermal state on quantum computer
• Entanglement Diagnostics for Efficient Quantum Computation
• Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes
• Quantum computing Floquet energy spectra
• Studying the phase diagram of the three-flavor Schwinger model in the presence of a chemical potential with measurement- and gate-based quantum computing
• Quantum Computation for Predicting Electron and Phonon Properties of Solids
• Characterization of variational quantum algorithms using free fermions
• Hybrid Tree Tensor Networks for quantum simulation
• Computing Graph Edit Distance with Algorithms on Quantum Devices
• Parameterization and optimizability of pulse-level VQEs
• Diagrammatic Analysis for Parameterized Quantum Circuits
• Quantum Natural Gradient with Geodesic Corrections for Small Shallow Quantum Circuits
• Variational Quantum Imaginary Time Evolution for Matrix Product State Ansatz with Tests on Transcorrelated Hamiltonians
• Learning Fourier series with parametrized quantum circuits
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity
• Expressivity of deterministic quantum computation with one qubit
• On the Differential Topology of Expressivity of Parameterized Quantum Circuits
• A coherent approach to quantum-classical optimization
• Exploring exotic configurations with anomalous features using deep learning: Application of classical and quantum-classical hybrid anomaly detection
• Finding eigenvectors with a quantum variational algorithm
• Three-Qubit State Preparation: Classification and Explicit Circuits
• Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
• Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms
• Transformer fault diagnosis using an efficient simulation-driven variational quantum classifier with domain-aware feature encoding
• Hybrid Quantum-Classical Clustering for Preparing a Prior Distribution of Eigenspectrum