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

Springer eBooks

Quantum Algorithms and Complexity for Continuous Problems

Anargyros Papageorgiou, Joseph F. Traub

Published Nov 2, 2011• 0 citations
Publisher
DOI
10.1007/978-1-4614-1800-9_145

Related papers

Quantum Algorithms for Continuous Problems and Their Applications

Anargyros Papageorgiou, Joseph F. Traub

This chapter summarizes the model of computation that is used for classical algorithms solving continuous problems. It talks about the quantum model of computation. In the study of the classical complexity of continuous problems, the real number model with oracles is often used. The information operations are represented as black-box or oracle calls. This model of computation is an abstraction of fixed precision floating point arithmetic used in science and engineering. It has also been used in the study of the complexity of algebraic problems such as matrix multiplication. Inputs to quantum algorithms are often given using quantum queries. Classical algorithms for integration have been extensively studied in the literature and optimal algorithms are known for numerous classes of functions. Quantum algorithms for integration have been used to derive optimal quantum algorithms for other continuous problems, such as path integration, certain approximation problems, and the solution of ordinary differential equations.

Advances in chemical physics•Feb 14, 2014•6 citations

Computational complexity and applications of quantum algorithm

Satoshi Iriyama, Makoto Ohya

Applied Mathematics and Computation•Jun 24, 2011•2 citations

Recent Developments in Quantum Algorithms and Complexity

Andris Ambainis

Lecture notes in computer science•Jan 1, 2014•1 citation

Quantum Algorithms and Complexity for Continuous Problems

Anargyros Papageorgiou, Joseph F. Traub

Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two major motivations for studying quantum algorithms and complexity for continuous problems. 1. Are quantum computers more powerful than classical computers for important scientific problems? How much more powerful? 2. Many important scientific and engineering problems have continuous formulations. To answer the first question we must know the classical computational complexity of the problem. Knowing the classical complexity of a continuous problem we obtain the quantum computation speedup if we know the quantum complexity. If we know an upper bound on the quantum complexity through the cost of a particular quantum algorithm then we can obtain a lower bound on the quantum speedup. Regarding the second motivation, in this article we'll report on high-dimensional integration, path integration, Feynman path integration, the smallest eigenvalue of a differential equation, approximation, partial differential equations, ordinary differential equations and gradient estimation. We'll also briefly report on the simulation of quantum systems on a quantum computer.

arXiv:0712.1211•Dec 7, 2007•1 citation

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•1 citation

Qubit complexity of continuous problems

Anargyros Papageorgiou, Joseph F. Traub

arXiv:quant-ph/0512082•Journal of Fixed Point Theory and Applications•Dec 1, 2009•8 citations
This chapter summarizes the model of computation that is used for classical algorithms solving continuous problems. It talks about the quantum model of computation. In the study of the classical complexity of continuous problems, the real number model with oracles is often used. The information operations are represented as black-box or oracle calls. This model of computation is an abstraction of fixed precision floating point arithmetic used in science and engineering. It has also been used in the study of the complexity of algebraic problems such as matrix multiplication. Inputs to quantum algorithms are often given using quantum queries. Classical algorithms for integration have been extensively studied in the literature and optimal algorithms are known for numerous classes of functions. Quantum algorithms for integration have been used to derive optimal quantum algorithms for other continuous problems, such as path integration, certain approximation problems, and the solution of ordinary differential equations.
Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two major motivations for studying quantum algorithms and complexity for continuous problems. 1. Are quantum computers more powerful than classical computers for important scientific problems? How much more powerful? 2. Many important scientific and engineering problems have continuous formulations. To answer the first question we must know the classical computational complexity of the problem. Knowing the classical complexity of a continuous problem we obtain the quantum computation speedup if we know the quantum complexity. If we know an upper bound on the quantum complexity through the cost of a particular quantum algorithm then we can obtain a lower bound on the quantum speedup. Regarding the second motivation, in this article we'll report on high-dimensional integration, path integration, Feynman path integration, the smallest eigenvalue of a differential equation, approximation, partial differential equations, ordinary differential equations and gradient estimation. We'll also briefly report on the simulation of quantum systems on a quantum computer.
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.