Combinatorial optimization
Cambridge University Press eBooks, pp. 62–77
Abstract
This chapter covers applications of quantum computing in the area of combinatorial optimization. This area is related to operations research, and it encompasses many tasks that appear in science and industry, such as scheduling, routing, and supply chain management. We cover specific problems where a quadratic quantum speedup may be available via Grover’s quantum algorithm for unstructured search. We also cover several more recent proposals for achieving superquadratic speedups, including the quantum adiabatic algorithm, the quantum approximate optimization algorithm (QAOA), and the short-path algorithm.
Authors 8
-
Affiliation as printed
AWS Center for Quantum Computing
-
Mario Berta Aachen
Affiliation as printed
RWTH Aachen University
-
University of California, Berkeley
Affiliation as printed
University of California, Berkeley
-
Affiliation as printed
AWS Center for Quantum Computing
-
Affiliation as printed
Yale University
-
Affiliation as printed
Amazon Quantum Solutions Lab
-
California Institute of Technology
Affiliation as printed
Caltech
-
Affiliation as printed
AWS Center for Quantum Computing
Cited by 1 stored of 1
1 result
No patents citing this paper on Lens.org (checked 2026-10-06).