Combinatorial Optimization with Quantum Computers
arXiv:2412.15778 · doi:10.1080/0305215X.2024.2435538
Abstract
Quantum computers leverage the principles of quantum mechanics to do computation with a potential advantage over classical computers. While a single classical computer transforms one particular binary input into an output after applying one operator to the input, a quantum computer can apply the operator to a superposition of binary strings to provide a superposition of binary outputs, doing computation apparently in parallel. This feature allows quantum computers to speed up the computation compared to classical algorithms. Unsurprisingly, quantum algorithms have been proposed to solve optimization problems in quantum computers. Furthermore, a family of quantum machines called quantum annealers are specially designed to solve optimization problems. In this paper, we provide an introduction to quantum optimization from a practical point of view. We introduce the reader to the use of quantum annealers and quantum gate-based machines to solve optimization problems.
Preprint of paper submitted and accepted in Engineering Optimization
References in corpus (14)
- Variational Quantum Algorithms
- A Quantum Approximate Optimization Algorithm
- Adiabatic Quantum Computing
- Quantum algorithms: an overview
- The Variational Quantum Eigensolver: a review of methods and best practices
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- Bounds for the adiabatic approximation with applications to quantum computation
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
- Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
- Penalty Weights in QUBO Formulations: Permutation Problems
- Proof-of-concept Quantum Simulator based on Molecular Spin Qudits
- Influence of Different 3SAT-to-QUBO Transformations on the Solution Quality of Quantum Annealing: A Benchmark Study
- Applying Ising Machines to Multi-objective QUBOs
- All 4-variable functions can be perfectly quadratized with only 1 auxiliary variable