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

arXiv:2210.06227 · Quantum Science and Technology

Quantum optimisation for continuous multivariable functions by a structured search

Edric Matwiejew, Jason Pye, Jingbo B. Wang

Published Jul 12, 2023• 11 citations
arXivHTMLPDF

Abstract

Abstract Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms (QVAs) leverage quantum superposition and entanglement to optimise over exponentially large solution spaces using an alternating sequence of classically tunable unitaries. However, prior work has primarily addressed discrete optimisation problems. In addition, these algorithms have been designed generally under the assumption of an unstructured solution space, which constrains their speedup to the theoretical limits for the unstructured Grover’s quantum search algorithm. In this paper, we show that QVAs can efficiently optimise continuous multivariable functions by exploiting general structural properties of a discretised continuous solution space with a convergence that exceeds the limits of an unstructured quantum search. We present the quantum multivariable optimisation algorithm and demonstrate its advantage over pre-existing methods, particularly when optimising high-dimensional and oscillatory functions.

DOI
10.1088/2058-9565/ace6cc

Related papers

Towards Efficient Function Optimisation with Quantum–Classical Hybrid Search

Mansur Ziatdinov, Fedor Levkovich-Maslyuk, Emmanuel M. Pothos

Finding the global minimum of a function with many local extrema is well known to be a challenging computational task. We propose a hybrid quantum-classical algorithm for this optimisation problem, based on a combination of Grover quantum search and the classical Newton-Raphson method. The approach is tailored to situations with a large number of false minima. The main idea is to use quantum search to efficiently locate the vicinity of the true optimum, after which a classical algorithm can solve the problem in only a few iterations. We specifically address the nontrivial question of choosing the discretisation of the function domain, which is critical for quantum approaches to optimisation of continuous functions. While we do not expect that this method will always be superior, we identify a paradigmatic case of a function for which we demonstrate that, remarkably, our hybrid method quadratically outperforms a purely classical approach (measuring performance by the number of function/oracle calls). We evaluate key performance metrics of the algorithm in numerical experiments. We furthermore discuss its possible extensions as well as the potential relevance of hybrid approaches in the context of quantum cognition.

Entropy•Sep 26, 2026•0 citations

A quantum unstructured search algorithm for discrete optimisation: the use case of portfolio optimisation

Matsakos, Titos, Lomas, Adrian

We propose a quantum unstructured search algorithm to find the extrema or roots of discrete functions, $f(\mathbf{x})$, such as the objective functions in combinatorial and other discrete optimisation problems. The first step of the Quantum Search for Extrema and Roots Algorithm (QSERA) is to translate conditions of the form $f(\mathbf{x}_*) \simeq f_*$, where $f_*$ is the extremum or zero, to an unstructured search problem for $\mathbf{x}_*$. This is achieved by mapping $f(\mathbf{x})$ to a function $u(z)$ to create a quantum oracle, such that $u(z_*) = 1$ and $u(z \neq z_*) = 0$. The next step is to employ Grover's algorithm to find $z_*$, which offers a quadratic speed-up over classical algorithms. The number of operations needed to map $f(\mathbf{x})$ to $u(z)$ determines the accuracy of the result and the circuit depth. We describe the implementation of QSERA by assembling a quantum circuit for portfolio optimisation, which can be formulated as a combinatorial problem. QSERA can handle objective functions with higher order terms than the commonly-used Quadratic Unconstrained Binary Optimisation (QUBO) framework. Moreover, while QSERA requires some a priori knowledge of the extrema of $f(\mathbf{x})$, it can still find approximate solutions even if the conditions are not exactly satisfied.

arXiv:2505.14645•May 20, 2025•0 citations

Adiabatic quantum search algorithm for structured problems

Jérémie Roland, Nicolas J. Cerf

The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size.

arXiv:quant-ph/0304039•Physical Review A•Dec 15, 2003•31 citations

Quantum walk informed variational algorithm design

Edric Matwiejew, Jingbo B. Wang

We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time quantum walk (CTQW) representation and the theory of graph automorphism groups. This framework leads to a heuristic for designing efficient problem-specific QVAs. Using this heuristic, we develop novel algorithms for unconstrained and constrained optimisation. We outline their implementation with polynomial gate complexity and simulate their application to the parallel machine scheduling and portfolio rebalancing combinatorial optimisation problems, showing significantly improved convergence over preexisting QVAs. Based on our analysis, we derive metrics for evaluating the suitability of graph structures for specific problem instances, and for establishing bounds on the convergence supported by different graph structures. For mixing unitaries characterised by a CTQW over a Hamming graph on $m$-tuples of length $n$, our results indicate that the amplification upper bound increases with problem size like $\mathcal{O}(e^{n \log m})$.

arXiv:2406.11620•Jun 17, 2024•7 citations

Quantum algorithms for combinatorial optimisation

Lennart Binkowski

Combinatorial optimisation constitutes a central class of computational problems with broad relevance across science and industry, combining foundational theoretical interest with significant real-world impact. Many problems of practical importance admit concise mathematical formulations, yet resist efficient classical solution methods due to their NP-hard structure. Quantum computing offers several algorithmic paradigms that promise structural speedups for such problems. Most quantum and hybrid frameworks fall into one of the following three categories: algorithms based on continuous adiabatic evolution, such as quantum annealing; circuit-based variational quantum algorithms; circuit-based approaches based on Grover's algorithm. These three algorithmic families are conceptualised for different kinds and generations of quantum architectures, often studied in isolation from each other and from preexisting sophisticated classical methods. This thesis develops a unified, predominantly circuit-based treatment of quantum algorithms for combinatorial optimisation, with a particular focus on principled design transfers between near-term parametric algorithms and far-term fault-tolerant approaches. Starting from the Boolean circuit model, reversible and quantum circuit formulations are derived that allow for precise size and depth analysis of classical control logic, reversible embeddings, and quantum realisations of Boolean and pseudo-Boolean functions. These constructions form a common backbone for optimisation algorithms based on adiabatic evolution, variational principles, and amplitude amplification. Adiabatic quantum computation is analysed within this circuit framework, leading to explicit convergence conditions and resource bounds for discretised adiabatic evolutions driven by pseudo-Boolean cost functions of bounded degree. Variational quantum algorithms are then revisited with an emphasis on feasibility-preserving operations and mixing families. In this context, a novel class of exhaustive variational quantum algorithms is introduced, characterised by finite parameterisations that provably reach optimal solutions. These constructions naturally induce state-preparation routines that guarantee to generate superpositions of all feasible solutions. Finally, Grover’s algorithm and its generalisations are studied as optimisation methods, highlighting their structural dependence on feasible-state preparation and their conceptual proximity to variational and adiabatic approaches. By establishing explicit design transfer principles between these paradigms, this thesis provides a unified perspective on quantum optimisation algorithms, accompanied by concrete circuit constructions and quantitative resource analyses.

•Jan 1, 2026•0 citations

Quantum Optimization Algorithms and Application

N. Manglani, Dhruv Solanki, Ankit Das

Optimization problems are fundamental across various scientific and industrial domains, from logistics and finance to machine learning and drug discovery. Classical optimization algorithms, such as gradient-based methods and heuristic approaches, often struggle with issues like slow convergence, getting trapped in local minima, and inefficiency in handling high-dimensional or combinatorial problems. Applying the concepts of quantum optimization with quantum mechanics algorithms presents viable substitutes with the potential for speedups and better solution quality. Among the significant quantum optimization techniques investigated in this paper are Grover's Search Algorithm, Variational Quantum Eigensolver (VQE), Quantum Annealing, and the Quantum Approximate Optimization Algorithm (QAOA). QAOA is designed for combinatorial optimization problems, blending quantum and classical techniques to approximate optimal solutions. VQE, widely used in quantum chemistry, employs a hybrid quantum-classical approach to determine ground-state energies efficiently. Grover's algorithm fastens up searching databases, indirectly aiding optimization tasks. Quantum annealing, implemented by systems like D-Wave, solves optimization problems by exploiting quantum tunneling to escape local minima. Despite their advantages, these quantum approaches face challenges, including hardware limitations, noise in quantum systems, and scalability concerns. However, these algorithms are expected to be essential in solving complicated optimization problems that are currently intractable by classical approaches when quantum technology develops.

Wiley eBooks•Oct 30, 2026•0 citations
Abstract Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms (QVAs) leverage quantum superposition and entanglement to optimise over exponentially large solution spaces using an alternating sequence of classically tunable unitaries. However, prior work has primarily addressed discrete optimisation problems. In addition, these algorithms have been designed generally under the assumption of an unstructured solution space, which constrains their speedup to the theoretical limits for the unstructured Grover’s quantum search algorithm. In this paper, we show that QVAs can efficiently optimise continuous multivariable functions by exploiting general structural properties of a discretised continuous solution space with a convergence that exceeds the limits of an unstructured quantum search. We present the quantum multivariable optimisation algorithm and demonstrate its advantage over pre-existing methods, particularly when optimising high-dimensional and oscillatory functions.
Finding the global minimum of a function with many local extrema is well known to be a challenging computational task. We propose a hybrid quantum-classical algorithm for this optimisation problem, based on a combination of Grover quantum search and the classical Newton-Raphson method. The approach is tailored to situations with a large number of false minima. The main idea is to use quantum search to efficiently locate the vicinity of the true optimum, after which a classical algorithm can solve the problem in only a few iterations. We specifically address the nontrivial question of choosing the discretisation of the function domain, which is critical for quantum approaches to optimisation of continuous functions. While we do not expect that this method will always be superior, we identify a paradigmatic case of a function for which we demonstrate that, remarkably, our hybrid method quadratically outperforms a purely classical approach (measuring performance by the number of function/oracle calls). We evaluate key performance metrics of the algorithm in numerical experiments. We furthermore discuss its possible extensions as well as the potential relevance of hybrid approaches in the context of quantum cognition.
We propose a quantum unstructured search algorithm to find the extrema or roots of discrete functions, f(x)f(\mathbf{x})f(x), such as the objective functions in combinatorial and other discrete optimisation problems. The first step of the Quantum Search for Extrema and Roots Algorithm (QSERA) is to translate conditions of the form f(x∗)≃f∗f(\mathbf{x}_*) \simeq f_*f(x∗​)≃f∗​, where f∗f_*f∗​ is the extremum or zero, to an unstructured search problem for x∗\mathbf{x}_*x∗​. This is achieved by mapping f(x)f(\mathbf{x})f(x) to a function u(z)u(z)u(z) to create a quantum oracle, such that u(z∗)=1u(z_*) = 1u(z∗​)=1 and u(z≠z∗)=0u(z \neq z_*) = 0u(z=z∗​)=0. The next step is to employ Grover's algorithm to find z∗z_*z∗​, which offers a quadratic speed-up over classical algorithms. The number of operations needed to map f(x)f(\mathbf{x})f(x) to u(z)u(z)u(z) determines the accuracy of the result and the circuit depth. We describe the implementation of QSERA by assembling a quantum circuit for portfolio optimisation, which can be formulated as a combinatorial problem. QSERA can handle objective functions with higher order terms than the commonly-used Quadratic Unconstrained Binary Optimisation (QUBO) framework. Moreover, while QSERA requires some a priori knowledge of the extrema of f(x)f(\mathbf{x})f(x), it can still find approximate solutions even if the conditions are not exactly satisfied.
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size.
We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time quantum walk (CTQW) representation and the theory of graph automorphism groups. This framework leads to a heuristic for designing efficient problem-specific QVAs. Using this heuristic, we develop novel algorithms for unconstrained and constrained optimisation. We outline their implementation with polynomial gate complexity and simulate their application to the parallel machine scheduling and portfolio rebalancing combinatorial optimisation problems, showing significantly improved convergence over preexisting QVAs. Based on our analysis, we derive metrics for evaluating the suitability of graph structures for specific problem instances, and for establishing bounds on the convergence supported by different graph structures. For mixing unitaries characterised by a CTQW over a Hamming graph on mmm-tuples of length nnn, our results indicate that the amplification upper bound increases with problem size like O(enlog⁡m)\mathcal{O}(e^{n \log m})O(enlogm).
Combinatorial optimisation constitutes a central class of computational problems with broad relevance across science and industry, combining foundational theoretical interest with significant real-world impact. Many problems of practical importance admit concise mathematical formulations, yet resist efficient classical solution methods due to their NP-hard structure. Quantum computing offers several algorithmic paradigms that promise structural speedups for such problems. Most quantum and hybrid frameworks fall into one of the following three categories: algorithms based on continuous adiabatic evolution, such as quantum annealing; circuit-based variational quantum algorithms; circuit-based approaches based on Grover's algorithm. These three algorithmic families are conceptualised for different kinds and generations of quantum architectures, often studied in isolation from each other and from preexisting sophisticated classical methods. This thesis develops a unified, predominantly circuit-based treatment of quantum algorithms for combinatorial optimisation, with a particular focus on principled design transfers between near-term parametric algorithms and far-term fault-tolerant approaches. Starting from the Boolean circuit model, reversible and quantum circuit formulations are derived that allow for precise size and depth analysis of classical control logic, reversible embeddings, and quantum realisations of Boolean and pseudo-Boolean functions. These constructions form a common backbone for optimisation algorithms based on adiabatic evolution, variational principles, and amplitude amplification. Adiabatic quantum computation is analysed within this circuit framework, leading to explicit convergence conditions and resource bounds for discretised adiabatic evolutions driven by pseudo-Boolean cost functions of bounded degree. Variational quantum algorithms are then revisited with an emphasis on feasibility-preserving operations and mixing families. In this context, a novel class of exhaustive variational quantum algorithms is introduced, characterised by finite parameterisations that provably reach optimal solutions. These constructions naturally induce state-preparation routines that guarantee to generate superpositions of all feasible solutions. Finally, Grover’s algorithm and its generalisations are studied as optimisation methods, highlighting their structural dependence on feasible-state preparation and their conceptual proximity to variational and adiabatic approaches. By establishing explicit design transfer principles between these paradigms, this thesis provides a unified perspective on quantum optimisation algorithms, accompanied by concrete circuit constructions and quantitative resource analyses.
Optimization problems are fundamental across various scientific and industrial domains, from logistics and finance to machine learning and drug discovery. Classical optimization algorithms, such as gradient-based methods and heuristic approaches, often struggle with issues like slow convergence, getting trapped in local minima, and inefficiency in handling high-dimensional or combinatorial problems. Applying the concepts of quantum optimization with quantum mechanics algorithms presents viable substitutes with the potential for speedups and better solution quality. Among the significant quantum optimization techniques investigated in this paper are Grover's Search Algorithm, Variational Quantum Eigensolver (VQE), Quantum Annealing, and the Quantum Approximate Optimization Algorithm (QAOA). QAOA is designed for combinatorial optimization problems, blending quantum and classical techniques to approximate optimal solutions. VQE, widely used in quantum chemistry, employs a hybrid quantum-classical approach to determine ground-state energies efficiently. Grover's algorithm fastens up searching databases, indirectly aiding optimization tasks. Quantum annealing, implemented by systems like D-Wave, solves optimization problems by exploiting quantum tunneling to escape local minima. Despite their advantages, these quantum approaches face challenges, including hardware limitations, noise in quantum systems, and scalability concerns. However, these algorithms are expected to be essential in solving complicated optimization problems that are currently intractable by classical approaches when quantum technology develops.