Work

Limitations of quantum counting, nested quantum search and amplitude amplification and their potential to solve discrete optimization problems

Year: 2025

Type: article

Abstract: Several quantum algorithms have been proposed for solving discrete optimization problems. In this paper, we focus on the quantum counting algorithm (QCB) of Brassard G, Høyer P, Tapp A. 1998 Quantum counting. In Automata, languages and programming (eds KG Larsen, S Skyum, G Winksel), pp. 820-831. Berlin Heidelberg, Berlin, Heidelberg: Springer. (doi:10.1007/BFb0055105), the nested quantum search algorithm of Cerf NJ, Grover LK, Williams CP. 2000 Nested quantum search and structured problems. Phys. Rev. 61. (doi:10.1103/physreva.61.032303), and amplitude amplification. We discuss potential limitations of these quantum algorithms and investigate how 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. This article is part of the theme issue 'Quantum theory and topology in models of decision making (Part 2)'.

Source: Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences

DOI: 10.1098/rsta.2024.0561

Authors: Stefan Creemers, Luis Fernando Pérez Armas

Institutions: Centre National de la Recherche Scientifique, Université de Lille, Institut d'Economie Scientifique Et de Gestion, Lille Économie Management

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7119509176

FWCI: 0.426

Cites: 12

Cited by: 1

Related to: