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

Wiley eBooks

Tasks for quantum computers

Joachim Stolze, Dieter Suter

Published May 26, 2004• 0 citations
Publisher

Abstract

This chapter contains sections titled: Quantum versus classical algorithms The Deutsch algorithm: Looking at both sides of a coin at the same time The Shor algorithm: It's prime time The Grover algorithm: Looking for a needle in a haystack Quantum simulations
DOI
10.1002/9783527617760.ch8

Related papers

Quantum Algorithms

Julia Kempe

This chapter contains sections titled: Introduction Precursors Shor's Factoring Algorithm Grover's Algorithm Other Algorithms Recent Developments

Wiley eBooks•Nov 6, 2006•1 citation

Quantum Algorithms

David McMahon

This chapter contains sections titled: Hadamard Gates The Phase Gate Matrix Representation of Serial and Parallel Operations Quantum Interference Quantum Parallelism and Function Evaluation Deutsch-Jozsa Algorithm Quantum Fourier Transform Phase Estimation Shor's Algorithm Quantum Searching and Grover's Algorithm Exercises

Wiley eBooks•Mar 23, 2007•0 citations

The Quantum Computer

Jürgen Audretsch

This chapter contains sections titled: Registers and Networks Functional Computation Quantum Parallelism Two Simple Quantum Algorithms Grover's Search Algorithm Shor's Factorisation Algorithm Quantum Error Correction Using Non-local Measurements The Components of the Quantum Computer Complementary Topics and Further Reading Problems for Chapter 12

Wiley eBooks•Feb 23, 2007•0 citations

Early quantum algorithms

Riccardo Manenti, Mário Motta

Abstract This chapter presents early quantum algorithms. We first describe Deutsch’s and Bernstein-Vazirani, some of the first quantum algorithms that showed a query advantage over their classical counterparts. We then present Grover’s algorithm, a quantum algorithm that finds an item in an unstructured database with a quadratic speed-up over classical algorithms. We explain the quantum Fourier transform, an important subroutine in various quantum algorithms. The chapter concludes with a detailed presentation of two of the most prominent applications of the quantum Fourier transform: the period finding algorithm and Shor’s algorithm for prime factorization.

Oxford University Press eBooks•Aug 25, 2023•0 citations

Quantum Integral Transforms

Mikio Nakahara

We demonstrated in the previous chapter that there are some quantum algorithms superior to their classical counterparts. It is, however, rather difficult to find any practical use of these algorithms. There are two quantum algorithms, known to date, which are potentially useful: Grover’s search algorithm and Shor’s prime number factorization algorithm. Both of them depend on quantum integral transforms, which will be introduced in the present chapter. We mainly follow [1] in our presentation.

CRC Press eBooks•Mar 11, 2008•0 citations

Quantum Versus Classical Computing

John Robert Burger

This chapter contains sections titled: Introduction Physical Qubits Quantum Boolean Functions Quantum Computer Programming Historical Quantum Computing Algorithms Conclusions Exercises

Wiley eBooks•Oct 28, 2008•0 citations
Abstract This chapter presents early quantum algorithms. We first describe Deutsch’s and Bernstein-Vazirani, some of the first quantum algorithms that showed a query advantage over their classical counterparts. We then present Grover’s algorithm, a quantum algorithm that finds an item in an unstructured database with a quadratic speed-up over classical algorithms. We explain the quantum Fourier transform, an important subroutine in various quantum algorithms. The chapter concludes with a detailed presentation of two of the most prominent applications of the quantum Fourier transform: the period finding algorithm and Shor’s algorithm for prime factorization.
We demonstrated in the previous chapter that there are some quantum algorithms superior to their classical counterparts. It is, however, rather difficult to find any practical use of these algorithms. There are two quantum algorithms, known to date, which are potentially useful: Grover’s search algorithm and Shor’s prime number factorization algorithm. Both of them depend on quantum integral transforms, which will be introduced in the present chapter. We mainly follow [1] in our presentation.