A

Continuous optimization

Cambridge University Press eBooks, pp. 78–97

Abstract

This chapter covers applications of quantum computing in the area of continuous optimization, including both convex and nonconvex optimization. We discuss quantum algorithms for computing Nash equilibria for zero-sum games and for solving linear, second-order, and semidefinite programs. These algorithms are based on quantum implementations of the multiplicative weights update method or interior point methods. We also discuss general quantum algorithms for convex optimization which can provide a speedup in cases where the objective function is much easier to evaluate than the gradient of the objective function. Finally, we cover quantum algorithms for escaping saddle points and finding local minima in nonconvex optimization problems.

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 0 stored of 0

No patents citing this paper on Lens.org (checked 2026-10-06).

References 0