Quantum Algorithm is related to an algorithms executed on a realistic model of quantum computation. It is a step by step procedure for solving a problem on a quantum computer. This chapter will explain about the major quantum algorithms developed for different purposes. There are mainly four approaches in developing algorithms, Quantum Fourier Transform, Quantum walk, BQP (bounded-error, quantum, polynomial time) and classical hybrid. We will discuss the following group of algorithms and their mathematical formulation with the code samples.
- Quantum Fourier Transform
- Quantum Walk Algorithms
- BQP Algorithms
- Amplitude Amplification Algorithms
- Hybrid Algorithms
Quantum Fourier Transform
The quantum fourier transform is similar to discrete fourier transform and is implemented in quantum algorithms. A polynomial number of quantum gates are used for implementing quantum fourier transform on a quantum computer. The following algorithms are based on quantum fourier transform.
- Quantum Phase Estimation Algorithm
- Shor’s Algorithm
- Hidden Subgroup problem
- Boson Sampling Problem
- Estimating Gauss Sums
- Fourier Fishing
- Fourier checking
- Simon’s Algorithm
- Deutsch-Jozsa Algorithm
- Bernstein–Vazirani Algorithm
Q# laatste nieuws 