A

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

  1. Affiliation as printed

    AWS Center for Quantum Computing

  2. Mario Berta Aachen

    RWTH Aachen University

    Affiliation as printed

    RWTH Aachen University

  3. University of California, Berkeley

    Affiliation as printed

    University of California, Berkeley

  4. Affiliation as printed

    AWS Center for Quantum Computing

  5. Yale University

    Affiliation as printed

    Yale University

  6. Amazon (United States)

    Affiliation as printed

    Amazon Quantum Solutions Lab

  7. California Institute of Technology

    Affiliation as printed

    Caltech

  8. 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).

References 0