Practical optimization for hybrid quantum-classical algorithms

Abstract

A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial problems. These algorithms provide an approximate solution to the problem at hand by encoding it in the state of a quantum computer. The operations used to prepare the state are not a priori fixed but, quite the opposite, are subjected to a classical optimization procedure that modifies the quantum gates and improves the quality of the approximate solution. While the quantum hardware determines the size of the problem and what states are achievable (limited, respectively, by the number of qubits and by the kind and number of possible quantum gates), it is the classical optimization procedure that determines the way in which the quantum states are explored and whether the best available solution is actually reached. In addition, the quantities required in the optimization, for example the objective function itself, have to be estimated with finite precision in any experimental implementation. While it is desirable to have very precise estimates, this comes at the cost of repeating the state preparation and measurement multiple times. Here we analyze the competing requirements of high precision and low number of repetitions and study how the overall performance of the variational algorithm is affected by the precision level and the choice of the optimization method. Finally, this study introduces quasi-Newton optimization methods in the general context of hybrid variational algorithms and presents quantitative results for the Quantum Approximate Optimization Algorithm.

Cited by in corpus (49)

• Barren plateaus in quantum neural network training landscapes
• Quantum computational chemistry
• Circuit-centric quantum classifiers
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum generative adversarial networks
• Quantum Natural Gradient
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• PennyLane: Automatic differentiation of hybrid quantum-classical computations
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• Variational Quantum State Diagonalization
• Emerging quantum computing algorithms for quantum chemistry
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Methodology for replacing indirect measurements with direct measurements
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• Quantum Software Engineering: Landscapes and Horizons
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Recent advances for quantum classifiers
• Quantum Algorithms for Fixed Qubit Architectures
• A case study of variational quantum algorithms for a job shop scheduling problem
• QuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction
• Graph neural network initialisation of quantum approximate optimisation
• qTorch: The Quantum Tensor Contraction Handler
• Minimum Hardware Requirements for Hybrid Quantum-Classical DMFT
• Evaluation of QAOA based on the approximation ratio of individual samples
• Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits
• Comparison of QAOA with Quantum and Simulated Annealing
• Generalization of the output of variational quantum eigensolver by parameter interpolation with low-depth ansatz
• QVECTOR: an algorithm for device-tailored quantum error correction
• Reduction of finite sampling noise in quantum neural networks
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• Dementia Prediction Applying Variational Quantum Classifier
• Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms
• Variational quantum Gibbs state preparation with a truncated Taylor series
• Automatic Depth Optimization for Quantum Approximate Optimization Algorithm
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• On the Principles of Differentiable Quantum Programming Languages
• Qsun: an open-source platform towards practical quantum machine learning applications
• Forbidden subspaces for level-1 QAOA and IQP circuits
• A quantum algorithm to count weighted ground states of classical spin Hamiltonians
• QuOp_MPI: a framework for parallel simulation of quantum variational algorithms
• Addition and Differentiation of ZX-diagrams
• Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms
• Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm
• Simultaneous Quantum Machine Learning Training and Architecture Discovery
• Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles
• A loop Quantum Approximate Optimization Algorithm with Hamiltonian updating