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

A quantum view on convex optimization

Joran van Apeldoorn

Published Feb 6, 2020• 4 citations
OpenAlex

Abstract

Every day we need to make many decisions: what we should have for dinner, what to vote for, or whether to kiss that special person for the first time. There are also many decisions that need to be made at a larger scale, for example, groups, governments, and corporations have to make decisions in order to use their resources wisely. Every decision asks us to consider many possibilities and to try to get the optimal outcome (or more often than not, to simply avoid disaster). Making these decisions is further complicated by the constraints that are put on us. Even though people have become quite good at making decisions, the increasing complexity of the world around us means that `going with our guts' is often an ill-advised optimization strategy. The field of mathematics allows us to formulate an abstract version of some of the more complex problems we encounter, and allows us to quantify what the objectives and constraints are. For some problems mathematics even gives us a simple closed-form solution, e.g. many of us have learned in school how find the extreme points on a parabola. However, for many problems there is no such simple closed-form solution, the best we can do is to use a method, or algorithm, to construct a solution. This puts us in the realm of computer science. Computer science considers how to solve problems systematically, and more importantly how many steps the decision-making process has to take. Most optimization problems can be solved by simply listing all possible combinations of decisions and then searching for the best option, but as the number of decisions increases, so does the number of combinations. In fact, for many situations the number of possible combinations increases exponentially, making the process of writing down all the options impractical. Instead we often look for a smarter, more efficient algorithm, one that scales better with the problem size. It is not always easy (or even possible) to find an efficient algorithm. Consider the problem of finding the lowest place in the Swiss Alps. We may walk down into what seems the deepest valley, only to learn later that a farmer three valleys over has dug a really deep well. One of the problems in such a scenario is that we may find a local minimum, but due to a lack of structure in the problem we have no clear way of finding a global minimum. Some problems do have more structure, an important class of these is the class of convex optimization problems. Convex optimization problems have the useful property that local minima are also global minima. For our example about the Alps this means that, as long as we keep going down, we will always reach the lowest point. However, as anyone who ever went snowboarding can tell you, how you go down matters a lot for how fast you will get there. Apart from considering the structure of the problem we are trying to solve we should also consider what steps we can take to solve it. We may want to use pen and paper, use our laptop, or use a supercomputer, all of which function differently. However, these methods are not inherently different, with enough time we could perform the same computation as a supercomputer with nothing more than a pen and a piece of paper. Although this would be significantly slower, the scaling with the problem size would stay the same since the basic steps we can use are the same, only slower. What basic steps we may perform is ultimately dictated by the laws of physics: we can only change the state of our piece of paper, or our computer, in ways that are allowed by physics. Specifically, our piece of paper and our computers both follow the laws of classical physics, the physics that we see around us every day. During the 20th century our understanding of physics has changed and we now know that classical physics does not give a full description of the natural world. One of the places where classical physics breaks down is at the scale of atoms and elementary particles, at this small scale the universe is governed by the laws of quantum physics. Quantum physics predicts behavior that is not possible in classical physics. Particles might be in a superposition of many different classical states, only becoming a specific one of those states at random when interacting with our classical world via a measurement. Miraculously, and contrary to classical randomness, this quantum randomness does not stem from our inherent lack of knowledge about the particle, the different parts of the superposition are all present until we measure and can interfere with each other. A natural question to ask is whether these phenomena can be used to our benefit when performing computations. A computer that works according to the rules of quantum physics is called a Quantum computer, such devices have a wider range of basic operations that they can perform than classical computers do. This thesis asks the following central question can quantum computers solve convex optimization problems faster? In order to answer this question we consider a few different types of problem that we may encounter in convex optimization. If we have some black-box procedure to evaluate how good a proposed solution to a convex optimization problem is, for example a way of estimating the height of a point in the Alps or a method of estimating our profits given a business strategy, then a classical computer would have to try a lot of small changes in order to find the change that improves our objective the most. However, we show that a quantum computer can find the optimal direction for improvement exponentially faster. We then consider specific categories of convex optimization problems, mainly linear programming and semidefinite programming. These problem categories include many natural problems and have been widely used both for theoretical and practical purposes. For example, linear programming can be used for finding the optimal strategies of zero-sum games, coming up with a diet plan, or planning resources. Semidefinite programming is a generalization of linear programming and can additionally be useful for designing optimal experiments, approximately solving hard problems, or optimize processes involving quantum mechanics. Our quantum algorithms for these problems use a natural connection between quantum physics and semidefinite programming: the solutions to a semidefinite programming problem correspond to the states of a quantum system. We show that quantum computers can solve semidefinite programming problems and linear programming problems quadratically faster than a classical computer can. In fact, our algorithms take less time to solve the problem than that it would take to read through the whole input. We also take a more negative view and discuss the limitations of quantum computers. We show that, even though quantum computers can find the optimal direction of improvement exponentially faster, there is no general exponential speedup for finding the optimal value. We also show that in many ways our methods for solving linear and semidefinite programming problems are optimal: faster methods would not be able to read enough of the input to still get a good solution. To conclude, we showed that in a few different settings the answer to our central question is yes. The results in this dissertation show that quantum computers can solve some convex optimization problems faster, but there are also limits to this. There are still many open questions regarding convex optimization on quantum computers and we regard this topic as an important direction of future research.

Related papers

Low-Depth Mechanisms for Quantum Optimization

Jarrod R. McClean, Matthew P. Harrigan, Masoud Mohseni +6 more

By gaining intuition about the mechanisms by which quantum optimization algorithms solve problems, approaches are identified that substantially improve the performance of quantum algorithms for this task.

arXiv:2008.08615•PRX Quantum•Jul 21, 2021•51 citations

Slack-variable approach for variational quantum semidefinite programming

Jingxuan Chen, Hanna Westerheim, Zoë Holmes +6 more

Solving optimization problems is a key task for which quantum computers could possibly provide a speedup over the best known classical algorithms. Particular classes of optimization problems including semidefinite programming (SDP) and linear programming (LP) have wide applicability in many domains of computer science, engineering, mathematics, and physics. Here we focus on semidefinite and linear programs for which the dimensions of the variables involved are exponentially large, so that standard classical SDP and LP solvers are not helpful for such large-scale problems. We propose the QSlack and CSlack methods for estimating their optimal values, respectively, which work by (1) introducing slack variables to transform inequality constraints to equality constraints, (2) transforming a constrained optimization to an unconstrained one via the penalty method, and (3) replacing the optimizations over all possible nonnegative variables by optimizations over parameterized quantum states and parameterized probability distributions. Under the assumption that the SDP and LP inputs are efficiently measurable observables, it follows that all terms in the resulting objective functions are efficiently estimable by either a quantum computer in the SDP case or a quantum or probabilistic computer in the LP case. Furthermore, by making use of SDP and LP duality theory, we prove that these methods provide a theoretical guarantee that, if one could find global optima of the objective functions, then the resulting values sandwich the true optimal values from both above and below. Finally, we showcase the QSlack and CSlack methods on a variety of example optimization problems and discuss details of our implementation, as well as the resulting performance. We find that our implementations of both the primal and dual for these problems approach the ground truth, typically achieving errors of the order 10-2.

Physical Review A•Jun 20, 2025•8 citations

On the complexity of classical and quantum algorithms for numerical problems in quantum mechanics

Joseph F. Traub, Arvid J. Bessen

Our understanding of complex mechanical processes is by our inability to solve the equations that govern them except for simple cases. Numerical simulation of systems appears to be our best option to understand, design and improve systems. It turns out, however, that computational problems in mechanics are notoriously difficult to treat numerically. The computational time that is required often scales exponentially with the size of the problem. One of the most radical approaches for treating problems was proposed by Feytiman in 1982 [46]: he suggested that mechanics itself showed a promising way to simulate physics. This idea, the so called computer, showed its potential convincingly in one important regime with the development of Shor's integer factorization algorithm which improves exponentially on the best known classical algorithm. In this thesis we explore six different computational problems from mechanics, study their computational complexity and try to find ways to remedy them. In the first problem we investigate the reasons behind the improved performance of Shor's and similar algorithms. We show that the key part in Shor's algorithm, the phase estimation algorithm, achieves its good performance through the use of power queries and we give lower bounds for all phase estimation algorithms that use power queries that match the known upper bounds. Our research indicates that problems that allow the use of power queries will achieve similar exponential improvements over classical algorithms. We then apply our lower bound technique for power queries to the Sturm-Liouville eigenvalue problem and show matching lower bounds to the upper bounds of Papageorgiou and Wozniakowski [85]. It seems to be very difficult, though, to find nontrivial instances of the Sturm-Lionville problem for which power queries can be simulated efficiently. A computer differs from a classical computer that uses randomness, because it allows negative probabilities that can cancel each other (destructive interference). Ideally we would like to transfer classical randomized algorithms to the computer and get speed improvements. One of the simplest classical randomized algorithm is the random walk and we study the behavior of the continuous-time random walk. We analyze this random walk in one dimension and give analytical formulas for its behavior that demonstrate its interference properties. Is interference or cancellation really the most important advantage that a computer has over a classical computer? To answer that question we study the class StociMA of stochastic quantum algorithms that only use classical gates, but are given a witness, i.e. an arbitrary state that can guide the algorithm in computing the correct answer, but should not be able to fool it. We show that there exists a complete problem for this class, which we call the stoquastic local Hamiltonian problem. In this problem we try to compute the lowest eigenvalue of a Hamiltonian with interactions that span only a fixed number of particles and all contribute negatively. With the help of this problem we prove that MA ⊆ StocIMA ⊆ SBP ∪ QMA. This shows that interference is one of the most important parts of computation. The simulation of the evolution of a general system in time requires a computational time that is exponential in the dimension of the system. But maybe the problem that we ask for is too general and we can simulate special systems in polynomial time. In particular it would be interesting to study systems of limited energy, i.e. for which the state at starting time consists mainly out of components with small energy. We model this in the theory of weighted reproducing kernel Hilbert spaces with two different sets of weights: product weights and finite-order weights. We will show that the information cost of computing the evolution for starting states from these spaces is tractable, i.e. the cost does not grow exponentially with the dimension of the problem. Finally we study a computational problem from lattice chromodynamics (QCD). In most popular algorithms that treat problems in QCD the (gauged) Dirac matrix has to be inverted numerous times. Since this matrix is large, sparse, and ill-conditioned, iterative approaches have to be used. Unfortunately a direct application of methods like conjugate gradient (CC) or minimal residual algorithms seem to give poor performance in practice. We study a newly proposed multigrid method, adaptive smoothed aggregation [29], that has promise to overcome these difficulties We show that while classical CG's convergence becomes worse as the matrix becomes almost singular, adaptive smoothed aggregation will still perform well.

•Jan 1, 2008•2 citations

Quantum variational optimization methods and their applications

Yagnik Chatterjee

Méthodes d'optimisation variationnelles quantiques et leurs applications L'informatique quantique est un domaine en plein essor qui a suscité un intérêt considérable au cours des deux dernières décennies en raison de sa promesse de révolutionner plusieurs domaines des affaires et de la science. Il s'agit d'une nouvelle façon d'effectuer des calculs en utilisant les propriétés fondamentales de la mécanique quantique telles que la superposition et l'intrication. L'optimisation, quant à elle, est un domaine omniprésent dans l'industrie et où de petites améliorations peuvent avoir un impact significatif. Cette thèse vise à résoudre des problèmes d'optimisation à l'aide d'algorithmes quantiques.Les problèmes d'optimisation NP-difficiles ne sont pas considérés comme pouvant être résolus exactement par des algorithmes généraux en temps polynomial. Les algorithmes quantiques variationnels (VQA en anglais) destinés à résoudre ces problèmes combinatoires ont récemment fait l'objet d'un grand intérêt. Ces algorithmes sont heuristiques et visent à obtenir une solution approximative. Cependant, le matériel en est encore à ses débuts et les ordinateurs quantiques bruyants à échelle intermédiaire (NISQ en anglais) actuels ne sont pas en mesure d'optimiser les problèmes d'intérêt industriel. De plus, le stockage des qubits et l'introduction de l'intrication nécessitent des conditions physiques extrêmes. Les algorithmes d'optimisation quantique contemporains, tels que le algorithme d'optimisation approximative quantique, Quantum Approximate Optimization Algorithm (QAOA) en anglais, posent un problème : leur échelle est linéaire en fonction de la taille du problème. Pour résoudre ce problème, nous présentons l'encodage LogQ, qui permet de concevoir des algorithmes variationnels quantiques dont l'échelle est logarithmique avec la taille du problème, ce qui ouvre la voie au traitement de problèmes d'optimisation d'une ampleur sans précédent sur des ordinateurs quantiques basés sur des portes. Nous montrons comment cet algorithme peut être appliqué à plusieurs problèmes d'optimisation combinatoire tels que Maximum Cut, Minimum Partition, Maximum Clique and Maximum Weighted Independent Set (MWIS). Ensuite, ces algorithmes sont testés sur un simulateur quantique avec des graphes de plus d'une centaine de nœuds et sur un véritable ordinateur quantique jusqu'à des graphes de taille 256. À notre connaissance, il s'agit des plus grands problèmes réalistes d'optimisation combinatoire jamais exécutés sur une machine NISQ, dépassant de près de dix fois la taille des problèmes résolus précédemment.Ensuite, nous appliquons le codage LogQ à deux cas d'utilisation pour de grandes entreprises telles que TotalEnergies. La conversion de la flotte est le processus de transition d'une flotte de véhicules vers des alternatives plus durables et plus respectueuses de l'environnement. Il est modélisé comme un schéma de génération de colonnes avec le problème MWIS comme sous-problème ou problème de travailleur. Nous utilisons la méthode LogQ pour résoudre le problème de travailleur MWIS et démontrons comment les solveurs quantiques et classiques peuvent être utilisés ensemble pour aborder un cas d'utilisation de taille industrielle. La segmentation de maillage fait référence au processus de division d'un maillage complexe (composé de sommets, d'arêtes et de faces) en parties ou régions significatives et sémantiquement cohérentes. La segmentation du maillage joue un rôle important dans la modélisation informatique, qui est largement utilisée dans les domaines clés des activités de TotalEnergies, tels que l'imagerie terrestre, la modélisation physique des réservoirs, etc. Nous définissons le problème comme un problème d'optimisation de graphe et utilisons l'encodage LogQ pour le résoudre.

•Oct 9, 2024•1 citation

Convex Analysis–Statistical Theory of Decisions and of Machine Learning: Classical and Quantum

Kalyan B. Sinha

Springer eBooks•Dec 14, 2025•0 citations

Complex quadratic optimization via semidefinite programming: models and applications

Shuzhong Zhang, Yongwei Huang

Quadratic optimization problems with complex-valued decision variables, in short called complex quadratic optimization problems, find many applications in engineering. In this dissertation, we study several instructive models of complex quadratic optimization, as well as its applications in combinatorial optimization. The tool that we use is a combination of semidefinite programming (SDP) relaxation and randomization technique, which has been well exploited in the last decade. Since most of the optimization models are NP-hard in nature, we shall design polynomial time approximation algorithms for a general model, or polynomial time exact algorithms for some restricted instances of a general model. To enable the analysis, we first develop two basic theoretical results: one is the probability formula for a bivariate complex normal distribution vector to be in a prescribed angular region, and the other one is the rank-one decomposition theorem for complex positive semidefinite matrices. The probability formula enables us to compute the expected value of a randomized (with a specific rounding rule) solution based on an optimal solution of the SDP relaxation problem, while the rank-one decomposition theorem provides a new proof of the complex S -lemma and leads to novel deterministic rounding procedures. With the above results in hand, we then investigate the models and applications of complex quadratic optimization via semidefinite programming in detail. We present an approximation algorithm for a convex quadratic maximization problem with discrete complex decision variables, where the approximation analysis is based on the probability formula. Besides, an approximation algorithm is proposed for a non-convex quadratic maximization problem with discrete complex decision variables. Then we study a limit of the model, i.e., a quadratic maximization problem with continuous unit module decision variables. The problem is shown to be strongly NP-hard. Approximation algorithms are described for the problem, including both convex case and non-convex case. Furthermore, if the objective matrix has a sign structure, then a stronger approximation result is shown to hold. In addition, we use the complex matrix decomposition theorem to solve complex quadratically constrained complex quadratic programming. We consider several interesting cases for which the corresponding SDP relaxation admits no gap with the true optimal value, and consequently, this yields polynomial time procedures for solving those special cases of complex quadratic optimization. Finally, as combinatorial applications of complex quadratic optimization; we consider Max 3-Cut with fixed nodes constraints, Max 3-Dicut with weight constraints, Max 3-XOR, and so on, and present corresponding bounds on the approximation ratios.

•Jan 1, 2005•0 citations
Every day we need to make many decisions: what we should have for dinner, what to vote for, or whether to kiss that special person for the first time. There are also many decisions that need to be made at a larger scale, for example, groups, governments, and corporations have to make decisions in order to use their resources wisely. Every decision asks us to consider many possibilities and to try to get the optimal outcome (or more often than not, to simply avoid disaster). Making these decisions is further complicated by the constraints that are put on us. Even though people have become quite good at making decisions, the increasing complexity of the world around us means that `going with our guts' is often an ill-advised optimization strategy. The field of mathematics allows us to formulate an abstract version of some of the more complex problems we encounter, and allows us to quantify what the objectives and constraints are. For some problems mathematics even gives us a simple closed-form solution, e.g. many of us have learned in school how find the extreme points on a parabola. However, for many problems there is no such simple closed-form solution, the best we can do is to use a method, or algorithm, to construct a solution. This puts us in the realm of computer science. Computer science considers how to solve problems systematically, and more importantly how many steps the decision-making process has to take. Most optimization problems can be solved by simply listing all possible combinations of decisions and then searching for the best option, but as the number of decisions increases, so does the number of combinations. In fact, for many situations the number of possible combinations increases exponentially, making the process of writing down all the options impractical. Instead we often look for a smarter, more efficient algorithm, one that scales better with the problem size. It is not always easy (or even possible) to find an efficient algorithm. Consider the problem of finding the lowest place in the Swiss Alps. We may walk down into what seems the deepest valley, only to learn later that a farmer three valleys over has dug a really deep well. One of the problems in such a scenario is that we may find a local minimum, but due to a lack of structure in the problem we have no clear way of finding a global minimum. Some problems do have more structure, an important class of these is the class of convex optimization problems. Convex optimization problems have the useful property that local minima are also global minima. For our example about the Alps this means that, as long as we keep going down, we will always reach the lowest point. However, as anyone who ever went snowboarding can tell you, how you go down matters a lot for how fast you will get there. Apart from considering the structure of the problem we are trying to solve we should also consider what steps we can take to solve it. We may want to use pen and paper, use our laptop, or use a supercomputer, all of which function differently. However, these methods are not inherently different, with enough time we could perform the same computation as a supercomputer with nothing more than a pen and a piece of paper. Although this would be significantly slower, the scaling with the problem size would stay the same since the basic steps we can use are the same, only slower. What basic steps we may perform is ultimately dictated by the laws of physics: we can only change the state of our piece of paper, or our computer, in ways that are allowed by physics. Specifically, our piece of paper and our computers both follow the laws of classical physics, the physics that we see around us every day. During the 20th century our understanding of physics has changed and we now know that classical physics does not give a full description of the natural world. One of the places where classical physics breaks down is at the scale of atoms and elementary particles, at this small scale the universe is governed by the laws of quantum physics. Quantum physics predicts behavior that is not possible in classical physics. Particles might be in a superposition of many different classical states, only becoming a specific one of those states at random when interacting with our classical world via a measurement. Miraculously, and contrary to classical randomness, this quantum randomness does not stem from our inherent lack of knowledge about the particle, the different parts of the superposition are all present until we measure and can interfere with each other. A natural question to ask is whether these phenomena can be used to our benefit when performing computations. A computer that works according to the rules of quantum physics is called a Quantum computer, such devices have a wider range of basic operations that they can perform than classical computers do. This thesis asks the following central question can quantum computers solve convex optimization problems faster? In order to answer this question we consider a few different types of problem that we may encounter in convex optimization. If we have some black-box procedure to evaluate how good a proposed solution to a convex optimization problem is, for example a way of estimating the height of a point in the Alps or a method of estimating our profits given a business strategy, then a classical computer would have to try a lot of small changes in order to find the change that improves our objective the most. However, we show that a quantum computer can find the optimal direction for improvement exponentially faster. We then consider specific categories of convex optimization problems, mainly linear programming and semidefinite programming. These problem categories include many natural problems and have been widely used both for theoretical and practical purposes. For example, linear programming can be used for finding the optimal strategies of zero-sum games, coming up with a diet plan, or planning resources. Semidefinite programming is a generalization of linear programming and can additionally be useful for designing optimal experiments, approximately solving hard problems, or optimize processes involving quantum mechanics. Our quantum algorithms for these problems use a natural connection between quantum physics and semidefinite programming: the solutions to a semidefinite programming problem correspond to the states of a quantum system. We show that quantum computers can solve semidefinite programming problems and linear programming problems quadratically faster than a classical computer can. In fact, our algorithms take less time to solve the problem than that it would take to read through the whole input. We also take a more negative view and discuss the limitations of quantum computers. We show that, even though quantum computers can find the optimal direction of improvement exponentially faster, there is no general exponential speedup for finding the optimal value. We also show that in many ways our methods for solving linear and semidefinite programming problems are optimal: faster methods would not be able to read enough of the input to still get a good solution. To conclude, we showed that in a few different settings the answer to our central question is yes. The results in this dissertation show that quantum computers can solve some convex optimization problems faster, but there are also limits to this. There are still many open questions regarding convex optimization on quantum computers and we regard this topic as an important direction of future research.
Solving optimization problems is a key task for which quantum computers could possibly provide a speedup over the best known classical algorithms. Particular classes of optimization problems including semidefinite programming (SDP) and linear programming (LP) have wide applicability in many domains of computer science, engineering, mathematics, and physics. Here we focus on semidefinite and linear programs for which the dimensions of the variables involved are exponentially large, so that standard classical SDP and LP solvers are not helpful for such large-scale problems. We propose the QSlack and CSlack methods for estimating their optimal values, respectively, which work by (1) introducing slack variables to transform inequality constraints to equality constraints, (2) transforming a constrained optimization to an unconstrained one via the penalty method, and (3) replacing the optimizations over all possible nonnegative variables by optimizations over parameterized quantum states and parameterized probability distributions. Under the assumption that the SDP and LP inputs are efficiently measurable observables, it follows that all terms in the resulting objective functions are efficiently estimable by either a quantum computer in the SDP case or a quantum or probabilistic computer in the LP case. Furthermore, by making use of SDP and LP duality theory, we prove that these methods provide a theoretical guarantee that, if one could find global optima of the objective functions, then the resulting values sandwich the true optimal values from both above and below. Finally, we showcase the QSlack and CSlack methods on a variety of example optimization problems and discuss details of our implementation, as well as the resulting performance. We find that our implementations of both the primal and dual for these problems approach the ground truth, typically achieving errors of the order 10-2.
Our understanding of complex mechanical processes is by our inability to solve the equations that govern them except for simple cases. Numerical simulation of systems appears to be our best option to understand, design and improve systems. It turns out, however, that computational problems in mechanics are notoriously difficult to treat numerically. The computational time that is required often scales exponentially with the size of the problem. One of the most radical approaches for treating problems was proposed by Feytiman in 1982 [46]: he suggested that mechanics itself showed a promising way to simulate physics. This idea, the so called computer, showed its potential convincingly in one important regime with the development of Shor's integer factorization algorithm which improves exponentially on the best known classical algorithm. In this thesis we explore six different computational problems from mechanics, study their computational complexity and try to find ways to remedy them. In the first problem we investigate the reasons behind the improved performance of Shor's and similar algorithms. We show that the key part in Shor's algorithm, the phase estimation algorithm, achieves its good performance through the use of power queries and we give lower bounds for all phase estimation algorithms that use power queries that match the known upper bounds. Our research indicates that problems that allow the use of power queries will achieve similar exponential improvements over classical algorithms. We then apply our lower bound technique for power queries to the Sturm-Liouville eigenvalue problem and show matching lower bounds to the upper bounds of Papageorgiou and Wozniakowski [85]. It seems to be very difficult, though, to find nontrivial instances of the Sturm-Lionville problem for which power queries can be simulated efficiently. A computer differs from a classical computer that uses randomness, because it allows negative probabilities that can cancel each other (destructive interference). Ideally we would like to transfer classical randomized algorithms to the computer and get speed improvements. One of the simplest classical randomized algorithm is the random walk and we study the behavior of the continuous-time random walk. We analyze this random walk in one dimension and give analytical formulas for its behavior that demonstrate its interference properties. Is interference or cancellation really the most important advantage that a computer has over a classical computer? To answer that question we study the class StociMA of stochastic quantum algorithms that only use classical gates, but are given a witness, i.e. an arbitrary state that can guide the algorithm in computing the correct answer, but should not be able to fool it. We show that there exists a complete problem for this class, which we call the stoquastic local Hamiltonian problem. In this problem we try to compute the lowest eigenvalue of a Hamiltonian with interactions that span only a fixed number of particles and all contribute negatively. With the help of this problem we prove that MA ⊆ StocIMA ⊆ SBP ∪ QMA. This shows that interference is one of the most important parts of computation. The simulation of the evolution of a general system in time requires a computational time that is exponential in the dimension of the system. But maybe the problem that we ask for is too general and we can simulate special systems in polynomial time. In particular it would be interesting to study systems of limited energy, i.e. for which the state at starting time consists mainly out of components with small energy. We model this in the theory of weighted reproducing kernel Hilbert spaces with two different sets of weights: product weights and finite-order weights. We will show that the information cost of computing the evolution for starting states from these spaces is tractable, i.e. the cost does not grow exponentially with the dimension of the problem. Finally we study a computational problem from lattice chromodynamics (QCD). In most popular algorithms that treat problems in QCD the (gauged) Dirac matrix has to be inverted numerous times. Since this matrix is large, sparse, and ill-conditioned, iterative approaches have to be used. Unfortunately a direct application of methods like conjugate gradient (CC) or minimal residual algorithms seem to give poor performance in practice. We study a newly proposed multigrid method, adaptive smoothed aggregation [29], that has promise to overcome these difficulties We show that while classical CG's convergence becomes worse as the matrix becomes almost singular, adaptive smoothed aggregation will still perform well.
Méthodes d'optimisation variationnelles quantiques et leurs applications L'informatique quantique est un domaine en plein essor qui a suscité un intérêt considérable au cours des deux dernières décennies en raison de sa promesse de révolutionner plusieurs domaines des affaires et de la science. Il s'agit d'une nouvelle façon d'effectuer des calculs en utilisant les propriétés fondamentales de la mécanique quantique telles que la superposition et l'intrication. L'optimisation, quant à elle, est un domaine omniprésent dans l'industrie et où de petites améliorations peuvent avoir un impact significatif. Cette thèse vise à résoudre des problèmes d'optimisation à l'aide d'algorithmes quantiques.Les problèmes d'optimisation NP-difficiles ne sont pas considérés comme pouvant être résolus exactement par des algorithmes généraux en temps polynomial. Les algorithmes quantiques variationnels (VQA en anglais) destinés à résoudre ces problèmes combinatoires ont récemment fait l'objet d'un grand intérêt. Ces algorithmes sont heuristiques et visent à obtenir une solution approximative. Cependant, le matériel en est encore à ses débuts et les ordinateurs quantiques bruyants à échelle intermédiaire (NISQ en anglais) actuels ne sont pas en mesure d'optimiser les problèmes d'intérêt industriel. De plus, le stockage des qubits et l'introduction de l'intrication nécessitent des conditions physiques extrêmes. Les algorithmes d'optimisation quantique contemporains, tels que le algorithme d'optimisation approximative quantique, Quantum Approximate Optimization Algorithm (QAOA) en anglais, posent un problème : leur échelle est linéaire en fonction de la taille du problème. Pour résoudre ce problème, nous présentons l'encodage LogQ, qui permet de concevoir des algorithmes variationnels quantiques dont l'échelle est logarithmique avec la taille du problème, ce qui ouvre la voie au traitement de problèmes d'optimisation d'une ampleur sans précédent sur des ordinateurs quantiques basés sur des portes. Nous montrons comment cet algorithme peut être appliqué à plusieurs problèmes d'optimisation combinatoire tels que Maximum Cut, Minimum Partition, Maximum Clique and Maximum Weighted Independent Set (MWIS). Ensuite, ces algorithmes sont testés sur un simulateur quantique avec des graphes de plus d'une centaine de nœuds et sur un véritable ordinateur quantique jusqu'à des graphes de taille 256. À notre connaissance, il s'agit des plus grands problèmes réalistes d'optimisation combinatoire jamais exécutés sur une machine NISQ, dépassant de près de dix fois la taille des problèmes résolus précédemment.Ensuite, nous appliquons le codage LogQ à deux cas d'utilisation pour de grandes entreprises telles que TotalEnergies. La conversion de la flotte est le processus de transition d'une flotte de véhicules vers des alternatives plus durables et plus respectueuses de l'environnement. Il est modélisé comme un schéma de génération de colonnes avec le problème MWIS comme sous-problème ou problème de travailleur. Nous utilisons la méthode LogQ pour résoudre le problème de travailleur MWIS et démontrons comment les solveurs quantiques et classiques peuvent être utilisés ensemble pour aborder un cas d'utilisation de taille industrielle. La segmentation de maillage fait référence au processus de division d'un maillage complexe (composé de sommets, d'arêtes et de faces) en parties ou régions significatives et sémantiquement cohérentes. La segmentation du maillage joue un rôle important dans la modélisation informatique, qui est largement utilisée dans les domaines clés des activités de TotalEnergies, tels que l'imagerie terrestre, la modélisation physique des réservoirs, etc. Nous définissons le problème comme un problème d'optimisation de graphe et utilisons l'encodage LogQ pour le résoudre.
Quadratic optimization problems with complex-valued decision variables, in short called complex quadratic optimization problems, find many applications in engineering. In this dissertation, we study several instructive models of complex quadratic optimization, as well as its applications in combinatorial optimization. The tool that we use is a combination of semidefinite programming (SDP) relaxation and randomization technique, which has been well exploited in the last decade. Since most of the optimization models are NP-hard in nature, we shall design polynomial time approximation algorithms for a general model, or polynomial time exact algorithms for some restricted instances of a general model. To enable the analysis, we first develop two basic theoretical results: one is the probability formula for a bivariate complex normal distribution vector to be in a prescribed angular region, and the other one is the rank-one decomposition theorem for complex positive semidefinite matrices. The probability formula enables us to compute the expected value of a randomized (with a specific rounding rule) solution based on an optimal solution of the SDP relaxation problem, while the rank-one decomposition theorem provides a new proof of the complex S -lemma and leads to novel deterministic rounding procedures. With the above results in hand, we then investigate the models and applications of complex quadratic optimization via semidefinite programming in detail. We present an approximation algorithm for a convex quadratic maximization problem with discrete complex decision variables, where the approximation analysis is based on the probability formula. Besides, an approximation algorithm is proposed for a non-convex quadratic maximization problem with discrete complex decision variables. Then we study a limit of the model, i.e., a quadratic maximization problem with continuous unit module decision variables. The problem is shown to be strongly NP-hard. Approximation algorithms are described for the problem, including both convex case and non-convex case. Furthermore, if the objective matrix has a sign structure, then a stronger approximation result is shown to hold. In addition, we use the complex matrix decomposition theorem to solve complex quadratically constrained complex quadratic programming. We consider several interesting cases for which the corresponding SDP relaxation admits no gap with the true optimal value, and consequently, this yields polynomial time procedures for solving those special cases of complex quadratic optimization. Finally, as combinatorial applications of complex quadratic optimization; we consider Max 3-Cut with fixed nodes constraints, Max 3-Dicut with weight constraints, Max 3-XOR, and so on, and present corresponding bounds on the approximation ratios.