ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2111.04695v1
• Date: Mon, 8 Nov 2021 18:17:59 GMT
• Title: ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms
• Authors: Manuel S. Rudolph, Sukin Sim, Asad Raza, Michal Stechly, Jarrod R. McClean, Eric R. Anschuetz, Luis Serrano, Alejandro Perdomo-Ortiz
• Abstract summary: 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.
• Score: 51.02972483763309
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational Quantum Algorithms (VQAs) are promising candidates for finding practical applications of near to mid-term quantum computers. There has been an increasing effort to study the intricacies of VQAs, such as the presence or absence of barren plateaus and the design of good quantum circuit ans\"atze. Many of these studies can be linked to the loss landscape that is optimized as part of the algorithm, and there is high demand for quality software tools for flexibly studying these loss landscapes. In our work, we collect a variety of techniques that have been used to visualize the training of deep artificial neural networks and apply them to visualize the high-dimensional loss landscapes of VQAs. We review and apply the techniques to three types of VQAs: the Quantum Approximate Optimization Algorithm, the Quantum Circuit Born Machine, and the Variational Quantum Eigensolver. Additionally, we investigate the impact of noise due to finite sampling in the estimation of loss functions. For each case, we demonstrate how our visualization techniques can verify observations from past studies and provide new insights. This work is accompanied by the release of the open-source Python package $\textit{orqviz}$, which provides code to compute and flexibly plot 1D and 2D scans, Principal Component Analysis scans, Hessians, and the Nudged Elastic Band algorithm. $\textit{orqviz}$ enables flexible visual analysis of high-dimensional VQA landscapes and can be found at: $\textbf{github.com/zapatacomputing/orqviz}$.

Related papers

• Variational Quantum Algorithm Landscape Reconstruction by Low-Rank Tensor Completion [2.2707451850269456]
  Variational quantum algorithms (VQAs) are a broad class of algorithms with many applications in science and industry. A particular challenge associated with VQAs is understanding the properties of associated cost functions. We propose a low-rank tensor-completion-based approach for local landscape reconstruction.
  arXiv  Detail & Related papers  (2024-05-17T17:53:38Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Quantum Architecture Search with Unsupervised Representation Learning [24.698519892763283]
  Unsupervised representation learning presents new opportunities for advancing Quantum Architecture Search (QAS) QAS is designed to optimize quantum circuits for Variational Quantum Algorithms (VQAs)
  arXiv  Detail & Related papers  (2024-01-21T19:53:17Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• qLEET: Visualizing Loss Landscapes, Expressibility, Entangling Power and Training Trajectories for Parameterized Quantum Circuits [0.0]
  qLEET is an open-source Python package for studying parameterized quantum circuits (PQCs) It enables the computation of properties such as expressibility and entangling power of a PQC. It supports quantum circuits and noise models built using popular quantum computing libraries such as Qiskit, Cirq, and Pyquil.
  arXiv  Detail & Related papers  (2022-05-04T14:47:23Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• The Variational Quantum Eigensolver: a review of methods and best practices [3.628860803653535]
  The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian. This review aims to provide an overview of the progress that has been made on the different parts of the algorithm.
  arXiv  Detail & Related papers  (2021-11-09T14:40:18Z)
• Variational Quantum Classifiers Through the Lens of the Hessian [0.0]
  In quantum computing, variational quantum algorithms (VQAs) are well suited for finding optimal combinations of things. The training of VQAs with gradient descent optimization algorithm has shown a good convergence. Just like classical deep learning, variational quantum circuits suffer from vanishing gradient problems.
  arXiv  Detail & Related papers  (2021-05-21T06:57:34Z)
• Efficient measure for the expressivity of variational quantum algorithms [72.59790225766777]
  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.
  arXiv  Detail & Related papers  (2021-04-20T13:51:08Z)
• 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.