Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation
arXiv:2405.08100 · doi:10.1109/QCE60285.2024.00181
Abstract
Parameterized quantum circuits (PQCs) are fundamental to quantum machine learning (QML), quantum optimization, and variational quantum algorithms (VQAs). The expressibility of PQCs is a measure that determines their capability to harness the full potential of the quantum state space. It is thus a crucial guidepost to know when selecting a particular PQC ansatz. However, the existing technique for expressibility computation through statistical estimation requires a large number of samples, which poses significant challenges due to time and computational resource constraints. This paper introduces a novel approach for expressibility estimation of PQCs using Graph Neural Networks (GNNs). We demonstrate the predictive power of our GNN model with a dataset consisting of 25,000 samples from the noiseless IBM QASM Simulator and 12,000 samples from three distinct noisy quantum backends. The model accurately estimates expressibility, with root mean square errors (RMSE) of 0.05 and 0.06 for the noiseless and noisy backends, respectively. We compare our model's predictions with reference circuits [Sim and others, QuTe'2019] and IBM Qiskit's hardware-efficient ansatz sets to further evaluate our model's performance. Our experimental evaluation in noiseless and noisy scenarios reveals a close alignment with ground truth expressibility values, highlighting the model's efficacy. Moreover, our model exhibits promising extrapolation capabilities, predicting expressibility values with low RMSE for out-of-range qubit circuits trained solely on only up to 5-qubit circuit sets. This work thus provides a reliable means of efficiently evaluating the expressibility of diverse PQCs on noiseless simulators and hardware.
References in corpus (27)
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- 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
- Error mitigation for short-depth quantum circuits
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Circuit-centric quantum classifiers
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Quantum optimization using variational algorithms on near-term quantum devices
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Hybrid quantum-classical algorithms and quantum error mitigation
- Quantum autoencoders for efficient compression of quantum data
- Continuous-variable quantum neural networks
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Average fidelity between random quantum states
- Expressibility of the alternating layered ansatz for quantum computation
- Topological Quantum Compiling with Reinforcement Learning
- Statistical Methods for Quantum State Verification and Fidelity Estimation
- Direct Fidelity Estimation of Quantum States using Machine Learning
- Expressibility and trainability of parameterized analog quantum systems for machine learning applications
- Compiler Optimization for Quantum Computing Using Reinforcement Learning
- Overfitting in quantum machine learning and entangling dropout
- Predicting Expressibility of Parameterized Quantum Circuits using Graph Neural Network