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

SpringerBriefs in computer science

Deutsch-Jozsa and Walsh Spectrum

Tharrmashastha Sapv, Debajyoti Bera, Arpita Maitra, Subhamoy Maitra

Published Jan 1, 2021• 0 citations
Publisher
DOI
10.1007/978-981-16-3061-3_2

Related papers

Deutsch–Jozsa Algorithm

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•1 citation

A different Deutsch–Jozsa

Debajyoti Bera

Quantum Information Processing•Mar 31, 2015•4 citations

On the Connection Between Deutsch-Jozsa Algorithm and Bent Functions

Eraldo Pereira Marinho

Abstract 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 that performs the Walsh transform of a Boolean function. Consequently, the output from the Deutsch-Jozsa algorithm when the hidden function is bent corresponds to a flat spectrum of quantum states.

arXiv:1912.01549•Journal of Physics Conference Series•Jan 1, 2021•0 citations

Deutsch-Jozsa Algorithm Revisited in the Domain of Cryptographically Significant Boolean Functions

Subhamoy Maitra, Partha Mukhopadhyay

Boolean functions are important building blocks in cryptography for their wide application in both stream and block cipher systems. For cryptanalysis of such systems one tries to find out linear functions that are correlated to the Boolean functions used in the crypto system. Let $f$ be an $n$-variable Boolean function and its Walsh spectra is denoted by $W_f(ω)$ at the point $ω\in \{0, 1\}^n$. The Boolean function is available in the form of an oracle. We like to find an $ω$ such that $W_f(ω) \neq 0$ as this will provide one of the linear functions which are correlated to $f$. We show that the quantum algorithm proposed by Deutsch and Jozsa (1992) solves the above mentioned problem in constant time. However, the best known classical algorithm to solve this problem requires exponential time in $n$. We also analyse certain classes of cryptographically significant Boolean functions and highlight how the basic Deutsch-Jozsa algorithm performs on them.

arXiv:quant-ph/0410042•Oct 6, 2004•4 citations

Revisiting Deutsch-Jozsa algorithm

Daowen Qiu, Shenggen Zheng

Information and Computation•Aug 6, 2020•36 citations

Spectrum and Dynamics

Stephen J. Gustafson, Israel Michael Sigal

Universitext•Jan 1, 2020•0 citations
Boolean functions are important building blocks in cryptography for their wide application in both stream and block cipher systems. For cryptanalysis of such systems one tries to find out linear functions that are correlated to the Boolean functions used in the crypto system. Let fff be an nnn-variable Boolean function and its Walsh spectra is denoted by Wf(ω)W_f(ω)Wf​(ω) at the point ω∈{0,1}nω\in \{0, 1\}^nω∈{0,1}n. The Boolean function is available in the form of an oracle. We like to find an ωωω such that Wf(ω)≠0W_f(ω) \neq 0Wf​(ω)=0 as this will provide one of the linear functions which are correlated to fff. We show that the quantum algorithm proposed by Deutsch and Jozsa (1992) solves the above mentioned problem in constant time. However, the best known classical algorithm to solve this problem requires exponential time in nnn. We also analyse certain classes of cryptographically significant Boolean functions and highlight how the basic Deutsch-Jozsa algorithm performs on them.