Limitations of Quantum Counting, Nested Quantum Search, and Amplitude Amplification and Their Potential to Solve Discrete Optimization Problems

Stefan Creemers () and Luis Fernando Pérez Armas ()
Additional contact information
Stefan Creemers: Université catholique de Louvain, LIDAM/CORE, Belgium

No 3338, LIDAM Reprints CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: Severalquantumalgorithmshavebeenproposedforsolving discrete optimization problems. In this paper, we focus on the quantum counting algorithm of Brassard et al. (1998), the nested quantum search algorithm of Cerf et al. (2000), and amplitude amplification. We discuss potential limitationsofthesequantumalgorithmsandinvestigatehow they can be used to solve discrete optimization problems. Our goal is to provide a set of practical guidelines that can help researchers to effectively implement Grover-based quantum algorithms.

Keywords: Grover’s algorithm; Quantum Counting; Quantum Phase Estimation; Nested Quantum Search; Amplitude Amplification (search for similar items in EconPapers)
Pages: 25
Date: 2025-09-01
Note: In: Philosophical Transactions A, 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvrp:3338

Access Statistics for this paper

More papers in LIDAM Reprints CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().