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

Oxford University Press eBooks

Quantum optimisation

Steven Herbert

Published Dec 8, 2025• 0 citations
Publisher

Abstract

Abstract Optimisation appears in the workflow of virtually every application and is often a computationally expensive step. Therefore, exploring whether quantum computing can offer an advantage in optimisation – even if only in certain circumstances – is extremely well-motivated from a practical perspective. Unlike the other algorithms covered in the book, which are expressed and analysed as quantum circuits, the most natural starting point for understanding quantum optimisation is the adiabatic model of quantum computation, which is introduced in this chapter. The quantum approximate optimisation algorithm, a gate-based algorithm inspired by quantum annealing (itself closely-related to adiabatic quantum computation), is also covered.

DOI
10.1093/9780191964381.003.0012

Related papers

A practitioner’s guide to quantum algorithms for optimisation problems

Benjamin C. B. Symons, David Galvin, Emre Sahin +2 more

Abstract Quantum computing is gaining popularity across a wide range of scientific disciplines due to its potential to solve long-standing computational problems that are considered intractable with classical computers. One promising area where quantum computing has potential is in the speed-up of NP -hard optimisation problems that are common in industrial areas such as logistics and finance. Newcomers to the field of quantum computing who are interested in using this technology to solve optimisation problems do not have an easily accessible source of information on the current capabilities of quantum computers and algorithms. This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques and their practical application, focusing on their near-term potential for noisy intermediate scale quantum devices. The paper starts by drawing parallels between classical and quantum optimisation problems, highlighting their conceptual similarities and differences. Two main paradigms for quantum hardware are then discussed: analogue and gate-based quantum computers. While analog devices such as quantum annealers are effective for some optimisation problems, they have limitations and cannot be used for universal quantum computation. In contrast, gate-based quantum computers offer the potential for universal quantum computation, but they face challenges with hardware limitations and accurate gate implementation. The paper provides a detailed mathematical discussion with references to key works in the field, as well as a more practical discussion with relevant examples. The most popular techniques for quantum optimisation on gate-based quantum computers, the quantum approximate optimisation algorithm and the quantum alternating operator ansatz framework, are discussed in detail. However, it is still unclear whether these techniques will yield quantum advantage, even with advancements in hardware and noise reduction. The paper concludes with a discussion of the challenges facing quantum optimisation techniques and the need for further research and development to identify new, effective methods for achieving quantum advantage.

arXiv:2305.07323•Journal of Physics A Mathematical and Theoretical•Oct 6, 2023•43 citations

Introduction to quantum computing

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter introduces quantum computing as a new computational paradigm built on superposition, entanglement, interference, and measurement and establishes its relevance to quantum searching and optimization. It first defines the core information primitives—qubits, quantum gates, and quantum circuits—and explains how they enable nonclassical state manipulation compared with deterministic bit-based processing. This chapter then surveys three major models of quantum computation: the gate-based circuit model for algorithmic execution via unitary gate sequences, the measurement-based model using pre-entangled resource states with computation driven by adaptive measurements, and the adiabatic model that encodes solutions in the ground state of a gradually evolved system, aligning naturally with annealing-style optimization. A structured comparison between classical and quantum computing highlights differences in data representation, intrinsic parallelism, scalability constraints, and error behavior and situates quantum supremacy as a task-specific benchmark rather than a universal replacement for classical machines. This chapter connects these foundations to application-critical algorithms, emphasizing Grover’s search and Shor’s factoring as canonical demonstrations of computational advantage. Finally, it motivates the book’s focus by mapping quantum search and optimization to practical domains including database querying, cryptography and post-quantum security, financial risk and fraud analytics, supply-chain logistics, scientific simulation, and emerging workflows such as quantum-assisted drug discovery and routing problems, while noting current hardware limitations and the need for robust error control.

CRC Press eBooks•Nov 6, 2026•0 citations

9 Optimisation and AI: What are companies doing today?

Koen Groenland

Optimisation and AI: What are companies doing today?The earlier chapter on quantum applications discussed whether quantum computers can offer practical speedups for optimisation and AI.We concluded that this is a subtle case and that it is still unclear how much utility quantum computers can provide in these fields.Still, a large body of literature claims some form of near-term speedup in specific quantum applications.What's really going on here?This chapter aims to build a more detailed intuition of how different organisations are exploring quantum applications.We will assess some example research papers, examine the problems they tackle, and analyse how convincingly they point to quantum utility.Moreover, we will look at the most fruitful directions for finding new and useful quantum algorithms.But before we dive into these details, let's take a step back and ask ourselves: what must a quantum algorithm do to be a genuine improvement over its classical counterpart?

Amsterdam University Press eBooks•Mar 9, 2025•0 citations

Quantum Computing: Foundations and Practice

Steven Herbert

Abstract The discovery of physical systems that exhibit what we now call quantum mechanical behaviour was unquestionably one of the most astonishing events of modern physics. No less remarkable was the realisation that quantum mechanics presents a much more powerful paradigm for computation and information processing than its classical counterpart. But this power is somewhat subtle, and only by building up a rigorous model of quantum computation from the fundamental physics can it be fully understood and analysed. Developing and then using the quantum circuit model as a suitable representation of quantum mechanics, this textbook presents a canon of the most important quantum algorithms. Starting with historically important query algorithms, ‘classic’ results such as Grover’s and Shor’s algorithm are then covered, followed by more recent breakthroughs including the quantum algorithm for solving linear systems (HHL) and the quantum singular value transformation. The thread that runs through the book is the hunt for quantum advantage, in all of its manifestations, and to this end the final chapter moves from the idealised setting of closed quantum systems, to address real ‘noisy’ open quantum systems. Quantum error correction is introduced, culminating in the seminal result, the threshold theorem, which roughly says that the idealised performance predicted by the analysis of quantum mechanics as a model of computation can actually be realised on real-world quantum computers.

•Dec 8, 2025•0 citations

Quantum Algorithms for Optimization and Machine Learning

Ravi Teja Avireneni, Sri Harsha Koneru, Naresh Kiran Kumar Reddy Yelkoti +1 more

Quantum computing offers a fundamentally new paradigm for solving complex optimisation and learning tasks by exploiting superposition, entanglement, and other quantum phenomena. Over the past decade, research has increasingly focused on quantum-enhanced approaches to optimisation and machine learning (ML), showing the potential to outperform classical methods in specific settings (Zaman, 2023; Peral-García, 2024). This paper presents a comprehensive review of quantum algorithms for optimisation (e.g., the Quantum Approximate Optimization Algorithm and quantum annealing) and quantum machine learning frameworks (such as quantum support vector machines and quantum neural networks), analysing their theoretical underpinnings, implementation status, and applicability to real-world tasks. Key challenges including hardware noise, limited qubit counts, and algorithmic scalability are examined (Chen, 2024). We also explore hybrid quantum-classical architectures as a near-term route to quantum advantage and propose future research directions aimed at bridging the current gap between quantum algorithm theory and large-scale deployment. Through this synthesis, we aim to provide both academic and practitioner audiences with a clear roadmap for leveraging quantum algorithms in optimisation and ML workflows

International Journal of Artificial Intelligence Data Science and Machine Learning•Jan 1, 2024•1 citation

An Outlook to Quantum Gate Computing

Christian Bauckhage, Rafet Sifa

Abstract Having spent almost an entire book on working out that Hopfield nets and adiabatic quantum computing are closely related concepts, this chapter departs from our main story line of problem solving as energy minimization and concludes our study with an outlook to the possibilities of quantum gate computing. Indeed, the central ideas behind quantum gate computing differ from most of what we studied so far but our study still has us prepared for getting to grips with the basics of this paradigm. As this paradigm posits that quantum algorithms are sequences of unitary operators which each act on the joint state of a qubit system, we will look at the circuit model of quantum computing and see that quantum circuits consist of quantum gates which are interconnected by quantum wires where the latter represent the states of qubits on which the former perform unitary operations. As a practical example, we discuss how such circuits could compute univariate Boolean functions. This then seamlessly allows us to finally study Deutsch’s problem and algorithm and therefore to see an instance of a computational problem for which quantum computing algorithms can be exponentially faster than their classical counterparts.

Cognitive technologies•Nov 17, 2025•0 citations
Abstract Optimisation appears in the workflow of virtually every application and is often a computationally expensive step. Therefore, exploring whether quantum computing can offer an advantage in optimisation – even if only in certain circumstances – is extremely well-motivated from a practical perspective. Unlike the other algorithms covered in the book, which are expressed and analysed as quantum circuits, the most natural starting point for understanding quantum optimisation is the adiabatic model of quantum computation, which is introduced in this chapter. The quantum approximate optimisation algorithm, a gate-based algorithm inspired by quantum annealing (itself closely-related to adiabatic quantum computation), is also covered.
Abstract Quantum computing is gaining popularity across a wide range of scientific disciplines due to its potential to solve long-standing computational problems that are considered intractable with classical computers. One promising area where quantum computing has potential is in the speed-up of NP -hard optimisation problems that are common in industrial areas such as logistics and finance. Newcomers to the field of quantum computing who are interested in using this technology to solve optimisation problems do not have an easily accessible source of information on the current capabilities of quantum computers and algorithms. This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques and their practical application, focusing on their near-term potential for noisy intermediate scale quantum devices. The paper starts by drawing parallels between classical and quantum optimisation problems, highlighting their conceptual similarities and differences. Two main paradigms for quantum hardware are then discussed: analogue and gate-based quantum computers. While analog devices such as quantum annealers are effective for some optimisation problems, they have limitations and cannot be used for universal quantum computation. In contrast, gate-based quantum computers offer the potential for universal quantum computation, but they face challenges with hardware limitations and accurate gate implementation. The paper provides a detailed mathematical discussion with references to key works in the field, as well as a more practical discussion with relevant examples. The most popular techniques for quantum optimisation on gate-based quantum computers, the quantum approximate optimisation algorithm and the quantum alternating operator ansatz framework, are discussed in detail. However, it is still unclear whether these techniques will yield quantum advantage, even with advancements in hardware and noise reduction. The paper concludes with a discussion of the challenges facing quantum optimisation techniques and the need for further research and development to identify new, effective methods for achieving quantum advantage.
This chapter introduces quantum computing as a new computational paradigm built on superposition, entanglement, interference, and measurement and establishes its relevance to quantum searching and optimization. It first defines the core information primitives—qubits, quantum gates, and quantum circuits—and explains how they enable nonclassical state manipulation compared with deterministic bit-based processing. This chapter then surveys three major models of quantum computation: the gate-based circuit model for algorithmic execution via unitary gate sequences, the measurement-based model using pre-entangled resource states with computation driven by adaptive measurements, and the adiabatic model that encodes solutions in the ground state of a gradually evolved system, aligning naturally with annealing-style optimization. A structured comparison between classical and quantum computing highlights differences in data representation, intrinsic parallelism, scalability constraints, and error behavior and situates quantum supremacy as a task-specific benchmark rather than a universal replacement for classical machines. This chapter connects these foundations to application-critical algorithms, emphasizing Grover’s search and Shor’s factoring as canonical demonstrations of computational advantage. Finally, it motivates the book’s focus by mapping quantum search and optimization to practical domains including database querying, cryptography and post-quantum security, financial risk and fraud analytics, supply-chain logistics, scientific simulation, and emerging workflows such as quantum-assisted drug discovery and routing problems, while noting current hardware limitations and the need for robust error control.
Optimisation and AI: What are companies doing today?The earlier chapter on quantum applications discussed whether quantum computers can offer practical speedups for optimisation and AI.We concluded that this is a subtle case and that it is still unclear how much utility quantum computers can provide in these fields.Still, a large body of literature claims some form of near-term speedup in specific quantum applications.What's really going on here?This chapter aims to build a more detailed intuition of how different organisations are exploring quantum applications.We will assess some example research papers, examine the problems they tackle, and analyse how convincingly they point to quantum utility.Moreover, we will look at the most fruitful directions for finding new and useful quantum algorithms.But before we dive into these details, let's take a step back and ask ourselves: what must a quantum algorithm do to be a genuine improvement over its classical counterpart?
Abstract The discovery of physical systems that exhibit what we now call quantum mechanical behaviour was unquestionably one of the most astonishing events of modern physics. No less remarkable was the realisation that quantum mechanics presents a much more powerful paradigm for computation and information processing than its classical counterpart. But this power is somewhat subtle, and only by building up a rigorous model of quantum computation from the fundamental physics can it be fully understood and analysed. Developing and then using the quantum circuit model as a suitable representation of quantum mechanics, this textbook presents a canon of the most important quantum algorithms. Starting with historically important query algorithms, ‘classic’ results such as Grover’s and Shor’s algorithm are then covered, followed by more recent breakthroughs including the quantum algorithm for solving linear systems (HHL) and the quantum singular value transformation. The thread that runs through the book is the hunt for quantum advantage, in all of its manifestations, and to this end the final chapter moves from the idealised setting of closed quantum systems, to address real ‘noisy’ open quantum systems. Quantum error correction is introduced, culminating in the seminal result, the threshold theorem, which roughly says that the idealised performance predicted by the analysis of quantum mechanics as a model of computation can actually be realised on real-world quantum computers.
Quantum computing offers a fundamentally new paradigm for solving complex optimisation and learning tasks by exploiting superposition, entanglement, and other quantum phenomena. Over the past decade, research has increasingly focused on quantum-enhanced approaches to optimisation and machine learning (ML), showing the potential to outperform classical methods in specific settings (Zaman, 2023; Peral-García, 2024). This paper presents a comprehensive review of quantum algorithms for optimisation (e.g., the Quantum Approximate Optimization Algorithm and quantum annealing) and quantum machine learning frameworks (such as quantum support vector machines and quantum neural networks), analysing their theoretical underpinnings, implementation status, and applicability to real-world tasks. Key challenges including hardware noise, limited qubit counts, and algorithmic scalability are examined (Chen, 2024). We also explore hybrid quantum-classical architectures as a near-term route to quantum advantage and propose future research directions aimed at bridging the current gap between quantum algorithm theory and large-scale deployment. Through this synthesis, we aim to provide both academic and practitioner audiences with a clear roadmap for leveraging quantum algorithms in optimisation and ML workflows
Abstract Having spent almost an entire book on working out that Hopfield nets and adiabatic quantum computing are closely related concepts, this chapter departs from our main story line of problem solving as energy minimization and concludes our study with an outlook to the possibilities of quantum gate computing. Indeed, the central ideas behind quantum gate computing differ from most of what we studied so far but our study still has us prepared for getting to grips with the basics of this paradigm. As this paradigm posits that quantum algorithms are sequences of unitary operators which each act on the joint state of a qubit system, we will look at the circuit model of quantum computing and see that quantum circuits consist of quantum gates which are interconnected by quantum wires where the latter represent the states of qubits on which the former perform unitary operations. As a practical example, we discuss how such circuits could compute univariate Boolean functions. This then seamlessly allows us to finally study Deutsch’s problem and algorithm and therefore to see an instance of a computational problem for which quantum computing algorithms can be exponentially faster than their classical counterparts.