Machine learning framework for predicting the entangling capability of parameterized quantum circuits
- URL: http://arxiv.org/abs/2406.01997v1
- Date: Tue, 4 Jun 2024 06:28:05 GMT
- Title: Machine learning framework for predicting the entangling capability of parameterized quantum circuits
- Authors: Shikun Zhang, Yang Zhou, Zheng Qin, Rui Li, Chunxiao Du, Zhisong Xiao, Yongyou Zhang,
- Abstract summary: Variational quantum algorithms (VQAs) are promising solutions, but their performance heavily depends on the parameterized quantum circuits (PQCs)
entanglement of PQCs is an important metric for constructing PQCs.
We propose a machine learning framework that utilizes a long short-term memory (LSTM) model and gate encoding technology to predict the entangling capability of PQCs.
- Score: 17.975555487972166
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the noisy intermediate-scale quantum (NISQ) era, quantum devices face significant limitations. Variational quantum algorithms (VQAs) are promising solutions, but their performance heavily depends on the parameterized quantum circuits (PQCs) they utilize. The entanglement of PQCs is an important metric for constructing PQCs. This is because entanglement is not only a key property that distinguishes quantum from classical computing, but it also affects the computational performance of VQAs. However, due to the extensive quantum state sampling required, its computational cost is very high. To address this challenge, we propose a machine learning framework that utilizes a long short-term memory (LSTM) model and gate encoding technology to predict the entangling capability of PQCs. By encoding PQCs into matrix sequences via gate encoding technology and feeding them into an LSTM model at different time steps, our method effectively simulates quantum dynamic evolution. We trained the LSTM model on a dataset of random PQCs. For testing scenarios, our model achieved a pearson correlation coefficient (Pc) of 0.9791 and an root mean square error (RMSE) of 0.05, demonstrating high prediction accuracy and validating the framework's effectiveness. This approach significantly reduces the entanglement computational cost associated with sampling quantum states and provides a practical tool for designing PQC structures and theoretically analyzing the role of entanglement in PQCs.
Related papers
- Predicting Expressibility of Parameterized Quantum Circuits using Graph
Neural Network [5.444441239596186]
We propose a novel method based on Graph Neural Networks (GNNs) for predicting the expressibility of Quantum Circuits (PQCs)
By leveraging the graph-based representation of PQCs, our GNN-based model captures intricate relationships between circuit parameters and their resulting expressibility.
Experimental evaluation on a four thousand random PQC dataset and IBM Qiskit's hardware efficient ansatz sets demonstrates the superior performance of our approach.
arXiv Detail & Related papers (2023-09-13T14:08:01Z) - A Novel Spatial-Temporal Variational Quantum Circuit to Enable Deep
Learning on NISQ Devices [12.873184000122542]
This paper proposes a novel spatial-temporal design, namely ST-VQC, to integrate non-linearity in quantum learning.
ST-VQC can achieve over 30% accuracy improvement compared with existing VQCs on actual quantum computers.
arXiv Detail & Related papers (2023-07-19T06:17:16Z) - Classical-to-Quantum Transfer Learning Facilitates Machine Learning with Variational Quantum Circuit [62.55763504085508]
We prove that a classical-to-quantum transfer learning architecture using a Variational Quantum Circuit (VQC) improves the representation and generalization (estimation error) capabilities of the VQC model.
We show that the architecture of classical-to-quantum transfer learning leverages pre-trained classical generative AI models, making it easier to find the optimal parameters for the VQC in the training stage.
arXiv Detail & Related papers (2023-05-18T03:08:18Z) - Quantum Imitation Learning [74.15588381240795]
We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL.
We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL)
Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
arXiv Detail & Related papers (2023-04-04T12:47:35Z) - Evaluation of Parameterized Quantum Circuits with Cross-Resonance
Pulse-Driven Entanglers [0.27998963147546146]
Variational Quantum Algorithms (VQAs) have emerged as a powerful class of algorithms that is highly suitable for noisy quantum devices.
Previous works have shown that choosing an effective parameterized quantum circuit (PQC) or ansatz for VQAs is crucial to their overall performance.
In this paper, we utilize pulse-level access to quantum machines and our understanding of their two-qubit interactions to optimize the design of two-qubit entanglers.
arXiv Detail & Related papers (2022-11-01T09:46:34Z) - Efficient Mean-Field Simulation of Quantum Circuits Inspired by Density
Functional Theory [1.3561290928375374]
Exact simulations of quantum circuits (QCs) are currently limited to $sim$50 qubits.
Here we show simulations of QCs with a method inspired by density functional theory (DFT)
Our calculations can predict marginal single-qubit probabilities with over 90% accuracy in several classes of QCs with universal gate sets.
arXiv Detail & Related papers (2022-10-29T02:12:15Z) - Potential and limitations of quantum extreme learning machines [55.41644538483948]
We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements.
Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
arXiv Detail & Related papers (2022-10-03T09:32:28Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
Self-Attention Mechanism (SAM) is good at capturing the internal connections of features.
A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
arXiv Detail & Related papers (2022-07-14T12:22:51Z) - Quantum Federated Learning with Quantum Data [87.49715898878858]
Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems.
This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
arXiv Detail & Related papers (2021-05-30T12:19:27Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.