Basic Quantum Algorithms

01/25/2022
by   Renato Portugal, et al.
0

Quantum computing is evolving so quickly that forces us to revisit, rewrite, and update the basis of the theory. Basic Quantum Algorithms revisits the first quantum algorithms. It started in 1985 with Deutsch trying to evaluate a function at two domain points simultaneously. Then, Deutsch and Jozsa created in 1992 a quantum algorithm that determines whether a Boolean function is constant or balanced. In the next year, Bernstein and Vazirani realized that the same algorithm can be used to find a specific Boolean function in the set of linear Boolean functions. In 1994, Simon presented a new quantum algorithm that determines whether a function is one-to-one or two-to-one exponentially faster than any classical algorithm for the same problem. In the same year, Shor created two new quantum algorithms for factoring integers and calculating discrete logarithms, threatening the cryptography methods widely used nowadays. In 1995, Kitaev described an alternative version for Shor's algorithms that proved useful in many other applications. In the following year, Grover created a quantum search algorithm quadratically faster than its classical counterpart. In this work, all those remarkable algorithms are described in detail with a focus on the circuit model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2020

A quantum algorithm to estimate the Gowers U_2 norm and linearity testing of Boolean functions

We propose a quantum algorithm to estimate the Gowers U_2 norm of a Bool...
research
12/03/2019

On the connection between Deutsch-Jozsa algorithm and bent functions

It is presently shown that the Deutsch-Jozsa algorithm is connected to t...
research
11/25/2022

A quantum algorithm to estimate the closeness to the Strict Avalanche criterion in Boolean functions

We propose a quantum algorithm (in the form of a quantum oracle) that es...
research
03/18/2021

Lorentz Quantum Computer

A theoretical model of computation is proposed based on Lorentz quantum ...
research
11/18/2022

Applications of Quantum Annealing in Cryptography

This paper presents a new method to reduce the optimization of a pseudo-...
research
03/16/2021

Faster Quantum Concentration via Grover's Search

We present quantum algorithms for routing concentration assignments on f...
research
08/10/2018

Quantum Algorithms for Autocorrelation Spectrum

In this paper we design quantum algorithms for studying the autocorrelat...

Please sign up or login with your details

Forgot password? Click here to reset