Efficient measure for the expressivity of variational quantum algorithms

• URL: http://arxiv.org/abs/2104.09961v2
• Date: Sun, 27 Feb 2022 06:27:07 GMT
• Title: Efficient measure for the expressivity of variational quantum algorithms
• Authors: Yuxuan Du, Zhuozhuo Tu, Xiao Yuan, Dacheng Tao
• Abstract summary: We exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of variational quantum algorithms. We first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable. We then explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered.
• Score: 72.59790225766777
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The superiority of variational quantum algorithms (VQAs) such as quantum neural networks (QNNs) and variational quantum eigen-solvers (VQEs) heavily depends on the expressivity of the employed ansatze. Namely, a simple ansatze is insufficient to capture the optimal solution, while an intricate ansatze leads to the hardness of the trainability. Despite its fundamental importance, an effective strategy of measuring the expressivity of VQAs remains largely unknown. Here, we exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of VQAs. In particular, we first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable. We next explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered. We observe an exponential decay of the expressivity with increasing circuit depth. We also utilize the achieved expressivity to analyze the generalization of QNNs and the accuracy of VQE. We numerically verify our theory employing VQAs with different levels of expressivity. Our work opens the avenue for quantitative understanding of the expressivity of VQAs.

Related papers

• An Evidence of Addressing Coherence Errors in VQE Observables by Pulse-level VQE Approach [0.0]
  This research focuses on Variational Quantum Eigensolvers (VQEs) in the Noisy Intermediate Scale Quantum (NISQ) era. We introduce and evaluate over-rotation and under-rotation errors in the measurement process, which are critical for obtaining accurate expectation values of Hamiltonians. Our findings indicate that the pulse-level VQE algorithm exhibits resilience to quantum errors in terms of accuracy.
  arXiv  Detail & Related papers  (2024-10-25T03:41:48Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• 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)
• Measurement optimization of variational quantum simulation by classical shadow and derandomization [0.0]
  Variational quantum simulation (VQS) gives us a tool to achieve the goal in near-term devices by distributing the computation load to both classical and quantum computers. One of the most severe challenges is the drastic increase in the number of measurements. This work aims to dramatically decrease the number of measurements in VQS by recently proposed shadow-based strategies.
  arXiv  Detail & Related papers  (2022-08-30T00:10:06Z)
• A Convergence Theory for Over-parameterized Variational Quantum Eigensolvers [21.72347971869391]
  The Variational Quantum Eigensolver (VQE) is a promising candidate for quantum applications on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. We provide the first rigorous analysis of the convergence of VQEs in the over- parameterization regime.
  arXiv  Detail & Related papers  (2022-05-25T04:06:50Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms [51.02972483763309]
  Variational Quantum Algorithms (VQAs) are promising candidates for finding practical applications of quantum computers. This work is accompanied by the release of the open-source Python package $textitorqviz$, which provides code to compute and flexibly plot 1D and 2D scans.
  arXiv  Detail & Related papers  (2021-11-08T18:17:59Z)
• Variational Quantum-Neural Hybrid Eigensolver [13.32712801349521]
  We introduce the variational quantum-neural hybrid eigensolver (VQNHE) in which the shallow-circuit quantum ansatz can be further enhanced by classical post-processing with neural networks. We show that VQNHE consistently and significantly outperforms VQE in simulating ground-state energies of quantum spins and molecules.
  arXiv  Detail & Related papers  (2021-06-09T14:31:45Z)
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers [5.644434841659249]
  We propose an iterative Layer VQE (L-VQE) approach, inspired by the Variational Quantum Eigensolver (VQE) We show that L-VQE is more robust to finite sampling errors and has a higher chance of finding the solution as compared with standard VQE approaches. Our simulation results show that L-VQE performs well under realistic hardware noise.
  arXiv  Detail & Related papers  (2021-02-10T16:53:22Z)
• 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.