ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms
arXiv:2111.04695
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ätze. 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 , which provides code to compute and flexibly plot 1D and 2D scans, Principal Component Analysis scans, Hessians, and the Nudged Elastic Band algorithm. enables flexible visual analysis of high-dimensional VQA landscapes and can be found at: .
arXiv comment32 pages, 17 figures
References in corpus (32)
- Deep Learning in Neural Networks: An Overview
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Barren plateaus in quantum neural network training landscapes
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- A Quantum Approximate Optimization Algorithm
- Quantum Circuit Learning
- Evaluating analytic gradients on quantum hardware
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Towards Practical Quantum Variational Algorithms
- Visualizing the Loss Landscape of Neural Nets
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- A generative modeling approach for benchmarking and training shallow quantum circuits
- Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
- Learning in Implicit Generative Models
- Is the Trotterized UCCSD Ansatz chemically well-defined?
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Methodology for replacing indirect measurements with direct measurements
- Machine learning quantum states in the NISQ era
- Quantum-assisted Helmholtz machines: A quantum-classical deep learning framework for industrial datasets in near-term devices
- On the Quantum versus Classical Learnability of Discrete Distributions
- Quantum-optimal-control-inspired ansatz for variational quantum algorithms
- Enhancing Generative Models via Quantum Correlations
- Minimizing estimation runtime on noisy quantum computers
- For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances
- Neural-network states for the classical simulation of quantum computing
- Evaluation of QAOA based on the approximation ratio of individual samples
- Variational Quantum Classifiers Through the Lens of the Hessian
- FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits
- Near-Term Quantum-Classical Associative Adversarial Networks