Implementation of a Quantum Approximate Optimization Algorithm for Continuous Variables with Qiskit
Authors:
- Miguel LunaMLMiguel Luna
- Vedant PatareVPVedant Patare
- Gamzepelin AksoyGAGamzepelin Aksoy
- Grégoire CattanGCGrégoire Cattan
- Gregoire CattanGCGregoire Cattan
Preprint
Abstract
In this paper, we propose a quantum approximate optimization algorithm (QAOA) for solving continuous-variable optimization problems on gate-based universal quantum computers. Our approach exploits the power of quantum computing to explore the solution space efficiently and find approximate optima. We demonstrate the effectiveness of our algorithm by solving a quadratic program, testing different combinations of mixer operators, numbers of repetitions and optimizers. The optimizer and the number of repetitions had the greatest effect size. The best performance was achieved using the SPSA optimizer, three repetitions, and the binary X mixer.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Evidence for the utility of quantum computing before fault toleranceNature, 2023
- First Attempts at Cryptanalyzing a (Toy) Block Cipher by Means of Quantum Optimization ApproachesJournal of Computational Science, 2023
- Digital Quantum Information Processing with Continuous-Variable Systems2023
- A study of the performance of classical minimizers in the Quantum Approximate Optimization AlgorithmJournal of Computational and Applied Mathematics, 2022
- Quantum Machine Learning: An Applied Approach2021
- Domain wall encoding of discrete variables for quantum annealing and QAOAQuantum Science and Technology, 2019
- A variational eigenvalue solver on a photonic quantum processorNature Communications, 2014
- Surface codes: Towards practical large-scale quantum computationPhysical Review A, 2012
- A one-measurement form of simultaneous perturbation stochastic approximationAutomatica, 1997
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation1994