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

Revisiting Deutsch-Jozsa algorithm

Daowen Qiu, Shenggen Zheng

Information and Computation•Aug 6, 2020•40 citations

A different Deutsch–Jozsa

Debajyoti Bera

Quantum Information Processing•Mar 31, 2015•5 citations

Distributed Deutsch–Jozsa algorithm

Hao Li, Daowen Qiu, Le Luo

arXiv:2303.10663•The Journal of Supercomputing•Aug 9, 2025•27 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

Efficient Quantum Algorithms related to Autocorrelation Spectrum

Debajyoti Bera, Subhamoy Maitra, Tharrmashastha Sapv

In this paper, we propose efficient probabilistic algorithms for several problems regarding the autocorrelation spectrum. First, we present a quantum algorithm that samples from the Walsh spectrum of any derivative of $f()$. Informally, the autocorrelation coefficient of a Boolean function $f()$ at some point $a$ measures the average correlation among the values $f(x)$ and $f(x \oplus a)$. The derivative of a Boolean function is an extension of autocorrelation to correlation among multiple values of $f()$. The Walsh spectrum is well-studied primarily due to its connection to the quantum circuit for the Deutsch-Jozsa problem. We extend the idea to "Higher-order Deutsch-Jozsa" quantum algorithm to obtain points corresponding to large absolute values in the Walsh spectrum of a certain derivative of $f()$. Further, we design an algorithm to sample the input points according to squares of the autocorrelation coefficients. Finally we provide a different set of algorithms for estimating the square of a particular coefficient or cumulative sum of their squares.

arXiv:1808.04448•Aug 10, 2018•2 citations
In this paper, we propose efficient probabilistic algorithms for several problems regarding the autocorrelation spectrum. First, we present a quantum algorithm that samples from the Walsh spectrum of any derivative of f()f()f(). Informally, the autocorrelation coefficient of a Boolean function f()f()f() at some point aaa measures the average correlation among the values f(x)f(x)f(x) and f(x⊕a)f(x \oplus a)f(x⊕a). The derivative of a Boolean function is an extension of autocorrelation to correlation among multiple values of f()f()f(). The Walsh spectrum is well-studied primarily due to its connection to the quantum circuit for the Deutsch-Jozsa problem. We extend the idea to "Higher-order Deutsch-Jozsa" quantum algorithm to obtain points corresponding to large absolute values in the Walsh spectrum of a certain derivative of f()f()f(). Further, we design an algorithm to sample the input points according to squares of the autocorrelation coefficients. Finally we provide a different set of algorithms for estimating the square of a particular coefficient or cumulative sum of their squares.