On the connection between Deutsch-Jozsa algorithm and bent functions

12/03/2019
by   Eraldo Pereira Marinho, et al.
0

It is presently shown that the Deutsch-Jozsa algorithm is connected to the concept of bent function. Particularly, it is noticeable that the quantum circuit used to denote the well known quantum algorithm is by itself the quantum computer which performs the Walsh transform of a Boolean function. Consequently, the output from Deutsch-Jozsa algorithm, when the hidden function is bent, corresponds to a flat spectrum of quantum states.

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
08/10/2018

Quantum Algorithms for Autocorrelation Spectrum

In this paper we design quantum algorithms for studying the autocorrelat...
research
05/05/2022

Quantum Extremal Learning

We propose a quantum algorithm for `extremal learning', which is the pro...
research
01/25/2022

Basic Quantum Algorithms

Quantum computing is evolving so quickly that forces us to revisit, rewr...
research
01/17/2020

Grover's Algorithm and Many-Valued Quantum Logic

As the engineering endeavour to realise quantum computers progresses, we...
research
04/25/2021

Following Forrelation – Quantum Algorithms in Exploring Boolean Functions' Spectra

Here we revisit the quantum algorithms for obtaining Forrelation [Aarons...
research
02/12/2021

A Parameterised Quantum Circuit Approach to Point Set Matching

Point set registration is one of the challenging tasks in areas such as ...

Please sign up or login with your details

Forgot password? Click here to reset