Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

Quantum Algorithms

ARTUR K. EKERT

Published Jan 1, 2001• 0 citations
Publisher
DOI
10.1142/9789810248185_0003

Related papers

Quantum algorithms

A. K. Ekert

•Jan 1, 1997•2 citations

Quantum Algorithms

Julia Kempe

This chapter traces the history of quantum algorithms with a focus on the milestones, Peter Shor's algorithm and Grover's algorithm for unstructured search. The first quantum algorithm is Deutsch's algorithm. The interesting fact about this algorithm is that not only it is the smallest algorithm, involving only two quantum bits (qubits) but also carries the main ingredients of later quantum algorithms, and is a nice toy model for understanding why and how quantum algorithms work. To understand this algorithm, the chapter clarifies the notion of a quantum black-box function. Developments in quantum algorithm design after Shor's and Grover's algorithms can be loosely grouped into three categories: algorithms that generalize Shor's algorithm, algorithms that perform some version of unstructured search and a few algorithms that do not fit into either of these categories. The chapter concludes with the recent developments of quantum algorithms.

Wiley eBooks•Apr 18, 2016•0 citations

Quantum Search Algorithms

Savo Glisic, Beatriz Lorenzo

This chapter reviews the general problems and the high-level operation of the major quantum algorithms. It describes some of the quantum algorithms in more detail. These algorithms include: Deutsch algorithm, Deutsch–Jozsa algorithm, Simon's algorithm, Shor's algorithm, quantum phase estimation algorithm, Grover's Quantum Search Algorithm (QSA), Boyer–Brassard–Høyer–Tapp QSA, Dürr–Høyer QSA, quantum counting algorithm, quantum heuristic algorithm, quantum genetic algorithm, Harrow–Hassidim–Lloyd algorithm, quantum mean algorithm, and quantum weighted sum algorithm. The chapter provides more physical insights into some of the algorithms. Quantum computation is based on quantum interference, which is a dynamical process that allows one to evolve initial quantum states (inputs) into final states (outputs) by modifying intermediate multi-particle superpositions in some prescribed way. The chapter illustrates how interference patterns lead to computational problems that are well suited to quantum computations, by presenting the first such problem that was proposed by David Deutsch.

Wiley eBooks•Feb 14, 2022•4 citations

Quantum Algorithms

Masahito Hayashi, Satoshi Ishizaka, Akinori Kawachi +2 more

Graduate texts in physics•Aug 22, 2014•0 citations

Quantum Hidden Subgroup Algorithms: An Algorithmic Toolkit

Samuel J. Lomonaco, Louis H. Kauffman

One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the Deutsch-Jozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor's quantum factoring algorithm into its basic primitives, then to generalize these primitives, and finally to show how to reassemble them into new QHS algorithms. Taking an "alphabetic building blocks approach," we use these primitives to form an "algorithmic toolkit" for the creation of new quantum algorithms, such as wandering Shor algorithms, continuous Shor algorithms, the quantum circle algorithm, the dual Shor algorithm, a QHS algorithm for Feynman integrals, free QHS algorithms, and more. Toward the end of this paper, we show how Grover's algorithm is most surprisingly "almost" a QHS algorithm, and how this result suggests the possibility of an even more complete "algorithmic tookit" beyond the QHS algorithms.

arXiv:quant-ph/0607046•Jul 6, 2006•1 citation

Quantum Algorithms

WORLD SCIENTIFIC eBooks•Mar 1, 2006•0 citations
This chapter traces the history of quantum algorithms with a focus on the milestones, Peter Shor's algorithm and Grover's algorithm for unstructured search. The first quantum algorithm is Deutsch's algorithm. The interesting fact about this algorithm is that not only it is the smallest algorithm, involving only two quantum bits (qubits) but also carries the main ingredients of later quantum algorithms, and is a nice toy model for understanding why and how quantum algorithms work. To understand this algorithm, the chapter clarifies the notion of a quantum black-box function. Developments in quantum algorithm design after Shor's and Grover's algorithms can be loosely grouped into three categories: algorithms that generalize Shor's algorithm, algorithms that perform some version of unstructured search and a few algorithms that do not fit into either of these categories. The chapter concludes with the recent developments of quantum algorithms.
This chapter reviews the general problems and the high-level operation of the major quantum algorithms. It describes some of the quantum algorithms in more detail. These algorithms include: Deutsch algorithm, Deutsch–Jozsa algorithm, Simon's algorithm, Shor's algorithm, quantum phase estimation algorithm, Grover's Quantum Search Algorithm (QSA), Boyer–Brassard–Høyer–Tapp QSA, Dürr–Høyer QSA, quantum counting algorithm, quantum heuristic algorithm, quantum genetic algorithm, Harrow–Hassidim–Lloyd algorithm, quantum mean algorithm, and quantum weighted sum algorithm. The chapter provides more physical insights into some of the algorithms. Quantum computation is based on quantum interference, which is a dynamical process that allows one to evolve initial quantum states (inputs) into final states (outputs) by modifying intermediate multi-particle superpositions in some prescribed way. The chapter illustrates how interference patterns lead to computational problems that are well suited to quantum computations, by presenting the first such problem that was proposed by David Deutsch.
One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the Deutsch-Jozsa, Simon, Shor algorithms, and many more. In this paper, our strategy for finding new quantum algorithms is to decompose Shor's quantum factoring algorithm into its basic primitives, then to generalize these primitives, and finally to show how to reassemble them into new QHS algorithms. Taking an "alphabetic building blocks approach," we use these primitives to form an "algorithmic toolkit" for the creation of new quantum algorithms, such as wandering Shor algorithms, continuous Shor algorithms, the quantum circle algorithm, the dual Shor algorithm, a QHS algorithm for Feynman integrals, free QHS algorithms, and more. Toward the end of this paper, we show how Grover's algorithm is most surprisingly "almost" a QHS algorithm, and how this result suggests the possibility of an even more complete "algorithmic tookit" beyond the QHS algorithms.