Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Frontiers in Optics

Quantum Approximate Optimization for Continuous Problems on a Programmable Photonic Quantum Computer

Yutaro Enomoto, Keitaro Anai, Kenta Udagawa, Shuntaro Takeda

Published Jan 1, 2022• 0 citations
Publisher

Abstract

We demonstrate a continuous-variable version of the quantum approximate optimization algorithm on a programmable single-mode photonic quantum computer, minimizing one-variable continuous functions. The results highlight the potential of continuous-variable quantum computing in near-term applications.
DOI
10.1364/fio.2022.fm5b.3

Related papers

Continuous-variable quantum approximate optimization on a programmable photonic quantum processor

Yutaro Enomoto, Keitaro Anai, Kenta Udagawa +1 more

Variational quantum algorithms (VQAs) provide a promising approach to achieving quantum advantage for practical problems on near-term noisy intermediate-scale quantum (NISQ) devices. Thus far, most studies on VQAs have focused on qubit-based systems, but the power of VQAs can be potentially boosted by exploiting infinite-dimensional continuous-variable (CV) systems. Here, we implement the CV version of one VQA, a quantum approximate optimization algorithm, by developing an automated collaborative computing system between a programmable photonic quantum computer and a classical computer. We experimentally demonstrate that this algorithm solves the minimization problem of simple continuous functions by implementing the quantum version of gradient descent to localize an initially broadly distributed wave function to the minimum. This method allows the execution of a practical CV quantum algorithm on a physical platform. Our work can be extended to the minimization of more general functions, providing an alternative to achieve the quantum advantage in practical problems.

arXiv:2206.07214•Physical Review Research•Oct 3, 2023•13 citations

Photonic counterdiabatic quantum optimization algorithm

Pranav Chandarana, Koushik Paul, Mikel Garcia de Andoin +3 more

One of the key applications of near-term quantum computers has been the development of quantum optimization algorithms. However, these algorithms have largely been focused on qubit-based technologies. Here, we propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm reduces the required quantum operations for optimization compared to adiabatic protocols. This reduction enables us to tackle non-convex continuous optimization within the near-term era of quantum computing. Through illustrative benchmarking, we show that our approach can outperform existing state-of-the-art hybrid adiabatic quantum algorithms in terms of convergence and implementability. Our algorithm offers a practical and accessible experimental realization, bypassing the need for high-order operations and overcoming experimental constraints. We conduct a proof-of-principle demonstration on Xanadu’s eight-mode nanophotonic quantum chip, successfully showcasing the feasibility and potential impact of the algorithm. The authors introduce a hybrid quantum-classical algorithm for photonic quantum computing that focuses on tackling continuous-variable optimization problems using fewer quantum operations than existing methods. The approach shows better performance and practical implementation potential, demonstrated on Xanadu’s quantum chip.

arXiv:2307.14853•Communications Physics•Sep 30, 2024•8 citations

Time-multiplexed programmable continuous-variable photonic quantum computing

Shuntaro Takeda

Photonic quantum computing has been dramatically scaled up recently by the promising approach of combining the continuous-variable" and time-multiplexing" schemes. We report on our recent development of time-multiplexed programmable continuous-variable photonic quantum computing, including a programmable loop-based quantum processor for single-mode multi-step Gaussian gates and a programmable time-multiplexed squeezed light source for initial state preparation. Our works pave the way to large-scale programmable continuous-variable quantum computing.

Quantum Communications and Quantum Imaging•Oct 3, 2023•0 citations

A Quantum Approximate Optimization Algorithm for continuous problems

Guillaume Verdon, Juan Miguel Arrazola, Kamil Brádler +1 more

We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating the dynamics at finite time steps, the algorithm can be expressed as alternating evolution under two non-commuting Hamiltonians. We show that each step of the algorithm updates the wavefunction in the direction of its local gradient, with an additional momentum-dependent displacement. For initial states in a superposition over many points, this method can therefore be interpreted as a coherent version of gradient descent, i.e., 'gradient descent in superposition.' This approach can be used for both constrained and unconstrained optimization. In terms of computational complexity, we show how variants of the algorithm can recover continuous-variable Grover search, and how a single iteration can replicate continuous-variable instantaneous quantum polynomial circuits. We also discuss how the algorithm can be adapted to solve discrete optimization problems. Finally, we test the algorithm through numerical simulation in optimizing the Styblinski-Tang function.

arXiv:1902.00409•Feb 1, 2019•25 citations

A Complex-Valued Continuous-Variable Quantum Approximation Optimization Algorithm (CCV-QAOA)

Raneem Madani, Abdel Lisser, Zeno Toffano

Continuous-variable (CV) quantum systems offer a natural framework for continuous optimization through their infinite-dimensional Hilbert spaces. In this paper, we propose the Complex Continuous-Variable Quantum Approximate Optimization Algorithm (CCV-QAOA), a variational framework operating in the complex domain that optimizes over complex decision variables. The method efficiently solves real and complex multivariate optimization problems. To demonstrate its versatility, we apply CCV-QAOA across a broad suite of optimization use cases, including convex quadratic minimization, scaling studies with circuit depth and cutoff dimension, constrained quadratic programs using penalty constructions, and non-convex benchmarks such as the Styblinski-Tang function and complex quartic landscapes.

quant-pharXiv:2604.25950•Apr 24, 2026•0 citations

Implementation of a Quantum Approximate Optimization Algorithm for Continuous Variables with Qiskit

Luna, Miguel, Vedant Patare, Gamzepelin Aksoy +1 more

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.

•Oct 1, 2025•0 citations
Variational quantum algorithms (VQAs) provide a promising approach to achieving quantum advantage for practical problems on near-term noisy intermediate-scale quantum (NISQ) devices. Thus far, most studies on VQAs have focused on qubit-based systems, but the power of VQAs can be potentially boosted by exploiting infinite-dimensional continuous-variable (CV) systems. Here, we implement the CV version of one VQA, a quantum approximate optimization algorithm, by developing an automated collaborative computing system between a programmable photonic quantum computer and a classical computer. We experimentally demonstrate that this algorithm solves the minimization problem of simple continuous functions by implementing the quantum version of gradient descent to localize an initially broadly distributed wave function to the minimum. This method allows the execution of a practical CV quantum algorithm on a physical platform. Our work can be extended to the minimization of more general functions, providing an alternative to achieve the quantum advantage in practical problems.
One of the key applications of near-term quantum computers has been the development of quantum optimization algorithms. However, these algorithms have largely been focused on qubit-based technologies. Here, we propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm reduces the required quantum operations for optimization compared to adiabatic protocols. This reduction enables us to tackle non-convex continuous optimization within the near-term era of quantum computing. Through illustrative benchmarking, we show that our approach can outperform existing state-of-the-art hybrid adiabatic quantum algorithms in terms of convergence and implementability. Our algorithm offers a practical and accessible experimental realization, bypassing the need for high-order operations and overcoming experimental constraints. We conduct a proof-of-principle demonstration on Xanadu’s eight-mode nanophotonic quantum chip, successfully showcasing the feasibility and potential impact of the algorithm. The authors introduce a hybrid quantum-classical algorithm for photonic quantum computing that focuses on tackling continuous-variable optimization problems using fewer quantum operations than existing methods. The approach shows better performance and practical implementation potential, demonstrated on Xanadu’s quantum chip.
Photonic quantum computing has been dramatically scaled up recently by the promising approach of combining the continuous-variable" and time-multiplexing" schemes. We report on our recent development of time-multiplexed programmable continuous-variable photonic quantum computing, including a programmable loop-based quantum processor for single-mode multi-step Gaussian gates and a programmable time-multiplexed squeezed light source for initial state preparation. Our works pave the way to large-scale programmable continuous-variable quantum computing.
We introduce a quantum approximate optimization algorithm (QAOA) for continuous optimization. The algorithm is based on the dynamics of a quantum system moving in an energy potential which encodes the objective function. By approximating the dynamics at finite time steps, the algorithm can be expressed as alternating evolution under two non-commuting Hamiltonians. We show that each step of the algorithm updates the wavefunction in the direction of its local gradient, with an additional momentum-dependent displacement. For initial states in a superposition over many points, this method can therefore be interpreted as a coherent version of gradient descent, i.e., 'gradient descent in superposition.' This approach can be used for both constrained and unconstrained optimization. In terms of computational complexity, we show how variants of the algorithm can recover continuous-variable Grover search, and how a single iteration can replicate continuous-variable instantaneous quantum polynomial circuits. We also discuss how the algorithm can be adapted to solve discrete optimization problems. Finally, we test the algorithm through numerical simulation in optimizing the Styblinski-Tang function.
Continuous-variable (CV) quantum systems offer a natural framework for continuous optimization through their infinite-dimensional Hilbert spaces. In this paper, we propose the Complex Continuous-Variable Quantum Approximate Optimization Algorithm (CCV-QAOA), a variational framework operating in the complex domain that optimizes over complex decision variables. The method efficiently solves real and complex multivariate optimization problems. To demonstrate its versatility, we apply CCV-QAOA across a broad suite of optimization use cases, including convex quadratic minimization, scaling studies with circuit depth and cutoff dimension, constrained quadratic programs using penalty constructions, and non-convex benchmarks such as the Styblinski-Tang function and complex quartic landscapes.
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.