Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement
arXiv:2405.02265 · doi:10.1088/2058-9565/ad80be
Abstract
While scalable error correction schemes and fault tolerant quantum computing seem not to be universally accessible in the near sight, the efforts of many researchers have been directed to the exploration of the contemporary available quantum hardware. Due to these limitations, the depth and dimension of the possible quantum circuits are restricted. This motivates the study of circuits with parameterized operations that can be classically optimized in hybrid methods as variational quantum algorithms (VQAs), enabling the reduction of circuit depth and size. The characteristics of these Parameterized Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application, motivating the study of their intrinsic properties. In this work, we analyse the generation of random states in PQCs under restrictions on the qubits connectivities, justified by different quantum computer architectures. We apply the expressibility quantifier and the average entanglement as diagnostics for the characteristics of the generated states and classify the circuits depending on the topology of the quantum computer where they can be implemented. As a function of the number of layers and qubits, circuits following a Ring topology will have the highest entanglement and expressibility values, followed by Linear/All-to-all almost together and the Star topology. In addition to the characterization of the differences between the entanglement and expressibility of these circuits, we also place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement. Circuits generating average and standard deviation for entanglement closer to values obtained with the truly uniformly random ensemble of unitaries present a steeper evolution when compared to others.
14 pages, 13 figures
References in corpus (52)
- Quantum entanglement
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Entanglement detection
- Efficient classical simulation of slightly entangled quantum computations
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Demonstration of a small programmable quantum computer with atomic qubits
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Towards Practical Quantum Variational Algorithms
- Chaos in quantum channels
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Global entanglement in multiparticle systems
- Random Quantum Circuits
- Chaos and complexity by design
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Induced measures in the space of mixed quantum states
- Evenly distributed unitaries: on the structure of unitary designs
- Aspects of generic entanglement
- Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
- Random Quantum Circuits are Approximate 2-designs
- Local random quantum circuits are approximate polynomial-designs
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Group-Invariant Quantum Machine Learning
- Solving the sampling problem of the Sycamore quantum circuits
- Average fidelity between random quantum states
- Mixed state sensitivity of several quantum information benchmarks
- Entangling power of the quantum baker's map
- Optimizing quantum process tomography with unitary 2-designs
- Operational Classification and Quantification of Multipartite Entangled States
- Entangling power and quantum circuit complexity
- Generative model benchmarks for superconducting qubits
- Impact of qubit connectivity on quantum algorithm performance
- Entanglement, quantum randomness, and complexity beyond scrambling
- Building spatial symmetries into parameterized quantum circuits for faster training
- Parameters of Pseudo-Random Quantum Circuits
- Entanglement entropy production in Quantum Neural Networks
- Calibrating the role of entanglement in variational quantum circuits
- Variational quantum algorithm for ergotropy estimation in quantum many-body batteries
- Performance of Superconducting Quantum Computing Chips under Different Architecture Design
- Entanglement Diagnostics for Efficient Quantum Computation
- Estimating the randomness of quantum circuit ensembles up to 50 qubits
- Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction
- Quantum Chaos and Circuit Parameter Optimization