Machine-Learning Insights on Entanglement-trainability Correlation of Parameterized Quantum Circuits

• URL: http://arxiv.org/abs/2406.01997v2
• Date: Sat, 19 Oct 2024 14:36:56 GMT
• Title: Machine-Learning Insights on Entanglement-trainability Correlation 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) have emerged as the leading strategy to obtain quantum advantage on the current noisy intermediate-scale devices. Their entanglement-trainability correlation, as the major reason for the barren plateau (BP) phenomenon, poses a challenge to their applications. In this Letter, we suggest a gate-to-tensor (GTT) encoding method for parameterized quantum circuits (PQCs) Two long short-term memory networks (L-G networks) are trained to predict both entanglement and trainability.
• Score: 17.975555487972166
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms (VQAs) have emerged as the leading strategy to obtain quantum advantage on the current noisy intermediate-scale devices. However, their entanglement-trainability correlation, as the major reason for the barren plateau (BP) phenomenon, poses a challenge to their applications. In this Letter, we suggest a gate-to-tensor (GTT) encoding method for parameterized quantum circuits (PQCs), with which two long short-term memory networks (L-G networks) are trained to predict both entanglement and trainability. The remarkable capabilities of the L-G networks afford a statistical way to delve into the entanglement-trainability correlation of PQCs within a dataset encompassing millions of instances. This machine-learning-driven method first confirms that the more entanglement, the more possible the BP problem. Then, we observe that there still exist PQCs with both high entanglement and high trainability. Furthermore, the trained L-G networks result in an impressive increase in time efficiency by about one million times when constructing a PQC with specific entanglement and trainability, demonstrating their practical applications in VQAs.

Related papers

• Improving thermal state preparation of Sachdev-Ye-Kitaev model with reinforcement learning on quantum hardware [0.0]
  This paper integrates reinforcement learning with convolutional neural networks to prepare thermal states on near-term quantum processors. We demonstrate the effectiveness of the framework in both noiseless and noisy quantum hardware environments.
  arXiv  Detail & Related papers  (2025-01-20T12:41:17Z)
• PPO-Q: Proximal Policy Optimization with Parametrized Quantum Policies or Values [5.260281988042923]
  PPO-Q integrates hybrid quantum-classical networks into the actor or critic part of the proximal policy optimization (PPO) algorithm. The PPO-Q achieves state-of-the-art performance in a range of complex environments with significantly reduced training parameters.
  arXiv  Detail & Related papers  (2025-01-13T06:40:40Z)
• Programming Variational Quantum Circuits with Quantum-Train Agent [3.360429911727189]
  The Quantum-Train Quantum Fast Weight Programmer (QT-QFWP) framework is proposed, which facilitates the efficient and scalable programming of variational quantum circuits (VQCs) This approach offers a significant advantage over conventional hybrid quantum-classical models by optimizing both quantum and classical parameter management. QT-QFWP outperforms related models in both efficiency and predictive accuracy, providing a pathway toward more practical and cost-effective quantum machine learning applications.
  arXiv  Detail & Related papers  (2024-12-02T06:26:09Z)
• Scalable quantum dynamics compilation via quantum machine learning [7.31922231703204]
  variational quantum compilation (VQC) methods employ variational optimization to reduce gate costs while maintaining high accuracy. We show that our approach exceeds state-of-the-art compilation results in both system size and accuracy in one dimension ($1$D) For the first time, we extend VQC to systems on two-dimensional (2D) strips with a quasi-1D treatment, demonstrating a significant resource advantage over standard Trotterization methods.
  arXiv  Detail & Related papers  (2024-09-24T18:00:00Z)
• Analysis of Parameterized Quantum Circuits: on The Connection Between Expressibility and Types of Quantum Gates [2.527892855172764]
  Expressibility is a crucial factor of aationalized Quantum Circuit (PQC) In this paper, we analyze the connection between expressibility and the types of quantum gates within PQCs. The findings of our analysis provide guidance for designing highly expressible PQCs.
  arXiv  Detail & Related papers  (2024-08-02T06:20:36Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Non-asymptotic Approximation Error Bounds of Parameterized Quantum Circuits [16.460585387762478]
  ized quantum circuits (PQCs) have emerged as a promising approach for quantum neural networks. This paper investigates the expressivity of PQCs for approximating general function classes. We establish the first non-asymptotic approximation error bounds for these functions in terms of the number of qubits, quantum circuit depth, and number of trainable parameters.
  arXiv  Detail & Related papers  (2023-10-11T14:29:11Z)
• Weight Re-Mapping for Variational Quantum Algorithms [54.854986762287126]
  We introduce the concept of weight re-mapping for variational quantum circuits (VQCs) We employ seven distinct weight re-mapping functions to assess their impact on eight classification datasets. Our results indicate that weight re-mapping can enhance the convergence speed of the VQC.
  arXiv  Detail & Related papers  (2023-06-09T09:42:21Z)
• Pre-training Tensor-Train Networks Facilitates Machine Learning with Variational Quantum Circuits [70.97518416003358]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning on noisy intermediate-scale quantum (NISQ) devices. While tensor-train networks (TTNs) can enhance VQC representation and generalization, the resulting hybrid model, TTN-VQC, faces optimization challenges due to the Polyak-Lojasiewicz (PL) condition. To mitigate this challenge, we introduce Pre+TTN-VQC, a pre-trained TTN model combined with a VQC.
  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)
• 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)
• Reducing Unitary Coupled Cluster Circuit Depth by Classical Stochastic Amplitude Pre-Screening [0.0]
  Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations. We present a combined classical-quantum approach where a classical UCC pre-processing step is used to determine the important excitations in the UCC ansatz.
  arXiv  Detail & Related papers  (2021-08-24T18:34:14Z)
• 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.