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

arXiv:quant-ph/0410042 · International Journal of Quantum Information

THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS

Subhamoy Maitra, PARTHA MUKHOPADHYAY

Published May 31, 2005• 13 citations
arXivHTMLPDF

Abstract

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 Wf(ω) at the point ω ∈ {0, 1}n. The Boolean function is available in the form of an oracle. We like to find a ω such that Wf(ω) ≠ 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 Jozsa7 solves this problem in constant time. However, the best known classical algorithm to solve the problem requires exponential time in n. We also analyze certain classes of cryptographically significant Boolean functions and highlight how the basic Deutsch–Jozsa algorithm performs on them.

DOI
10.1142/s0219749905000980

Related papers

Improved quantum test for linearity of a Boolean function

Kaushik Chakraborty, Subhamoy Maitra

Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $ε$-far from having that property. The efficiency of the algorithm is judged by the number of calls to the oracle so that one can decide, with high probability, between these two alternatives. The best known quantum algorithm for testing whether a function is linear or $ε$-far $(0 < ε< \frac{1}{2})$ from linear functions requires $O(ε^{-\frac{2}{3}})$ many calls [Hillery and Andersson, Physical Review A 84, 062329 (2011)]. We show that this can be improved to $O(ε^{-\frac{1}{2}})$ by using the Deutsch-Jozsa and the Grover Algorithms.

arXiv:1306.6195•Jun 26, 2013•9 citations

Testing Boolean Functions Properties

Zhengwei Xie, Daowen Qiu, Guangya Cai +2 more

The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is $\varepsilon$-far from having that property. We investigate here several types of properties testing for Boolean functions (identity, correlations and balancedness) using the Deutsch-Jozsa algorithm (for the Deutsch-Jozsa (D-J) problem) and also the amplitude amplification technique. At first, we study here a particular testing problem: namely whether a given Boolean function $f$, of $n$ variables, is identical with a given function $g$ or is $\varepsilon$-far from $g$, where $\varepsilon$ is the parameter. We present a one-sided error quantum algorithm to deal with this problem that has the query complexity $O(\frac{1}{\sqrt{\varepsilon}})$. Moreover, we show that our quantum algorithm is optimal. Afterwards we show that the classical randomized query complexity of this problem is $\Theta(\frac{1}{\varepsilon})$. Secondly, we consider the D-J problem from the perspective of functional correlations and let $C(f,g)$ denote the correlation of $f$ and $g$. We propose an exact quantum algorithm for making distinction between $|C(f,g)|=\varepsilon$ and $|C(f,g)|=1$ using six queries, while the classical deterministic query complexity for this problem is $\Theta(2^{n})$ queries. Finally, we propose a one-sided error quantum query algorithm for testing whether one Boolean function is balanced versus $\varepsilon$-far balanced using $O(\frac{1}{\varepsilon})$ queries. We also prove here that our quantum algorithm for balancedness testing is optimal. At the same time, for this balancedness testing problem we present a classical randomized algorithm with query complexity of $O(1/\varepsilon^{2})$. Also this randomized algorithm is optimal. Besides, we link the problems considered here together and generalize them to the general case. Comment: 24 pages, comments are welcome. It is accepted for publishing in Fundamenta Informaticae

Fundamenta Informaticae•Nov 18, 2021•0 citations

Testing Boolean Functions Properties

Zhengwei Xie, Daowen Qiu, Guangya Cai +2 more

The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is $\varepsilon$-far from having that property. We investigate here several types of properties testing for Boolean functions (identity, correlations and balancedness) using the Deutsch-Jozsa algorithm (for the Deutsch-Jozsa (D-J) problem) and also the amplitude amplification technique. At first, we study here a particular testing problem: namely whether a given Boolean function $f$, of $n$ variables, is identical with a given function $g$ or is $\varepsilon$-far from $g$, where $\varepsilon$ is the parameter. We present a one-sided error quantum algorithm to deal with this problem that has the query complexity $O(\frac{1}{\sqrt{\varepsilon}})$. Moreover, we show that our quantum algorithm is optimal. Afterwards we show that the classical randomized query complexity of this problem is $\Theta(\frac{1}{\varepsilon})$. Secondly, we consider the D-J problem from the perspective of functional correlations and let $C(f,g)$ denote the correlation of $f$ and $g$. We propose an exact quantum algorithm for making distinction between $|C(f,g)|=\varepsilon$ and $|C(f,g)|=1$ using six queries, while the classical deterministic query complexity for this problem is $\Theta(2^{n})$ queries. Finally, we propose a one-sided error quantum query algorithm for testing whether one Boolean function is balanced versus $\varepsilon$-far balanced using $O(\frac{1}{\varepsilon})$ queries. We also prove here that our quantum algorithm for balancedness testing is optimal. At the same time, for this balancedness testing problem we present a classical randomized algorithm with query complexity of $O(1/\varepsilon^{2})$. Also this randomized algorithm is optimal. Besides, we link the problems considered here together and generalize them to the general case. Comment: 24 pages, comments are welcome. It is accepted for publishing in Fundamenta Informaticae

arXiv:2109.06763•Fundamenta Informaticae•Nov 18, 2021•6 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

A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic

Yale Fan

We generalize the binary Deutsch-Jozsa algorithm to n- valued logic using the quantum Fourier transform. Our algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, but can also find closed expressions for classes of affine functions in quantum oracles, accurate to a constant term.

arXiv:0809.0932•IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2007•28 citations

Deutsch–Jozsa, quantum Fourier transform, and Grover quantum database search algorithms

E. Desurvire

This mathematically intensive chapter takes us through our first steps in the domain of quantum computation (QC) algorithms . The simplest of them is the Deutsch algorithm , which makes it possible to determine whether or not a Boolean function is constant for any input. The key result is that this QC algorithm provides the answer at once, whereas in the classical case it would take two independent calculations. I describe next the generalization of the former algorithm to n qubits, referred to as the Deutsch–Jozsa algorithm . Although they have no specific or useful applications in quantum computing, both algorithms represent a most elegant means of introducing the concept of quantum computation parallelism . I then describe two most important QC algorithms, which nicely exploit quantum parallelism. The first is the quantum Fourier transform (QFT), for which a detailed analysis of QFT circuits and quantum-gate requirements is also provided. As will be shown in the next chapter, a key application of QFT concerns the famous Shor's algorithm , which makes it possible to factor numbers into primes in terms of polynomials. The second algorithm, no less famous than Shor's, is referred to as the Grover quantum database search , whose application is the identification of database items with a quadratic gain in speed. Deutsch algorithm Our exploration of quantum algorithms shall begin with the solution of a very basic problem: finding whether or not a Boolean function f ( x ) is a constant.

Cambridge University Press eBooks•Feb 19, 2009•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 f be an n-variable Boolean function and its Walsh spectra is denoted by Wf(ω) at the point ω ∈ {0, 1}n. The Boolean function is available in the form of an oracle. We like to find a ω such that Wf(ω) ≠ 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 Jozsa7 solves this problem in constant time. However, the best known classical algorithm to solve the problem requires exponential time in n. We also analyze certain classes of cryptographically significant Boolean functions and highlight how the basic Deutsch–Jozsa algorithm performs on them.
Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is εεε-far from having that property. The efficiency of the algorithm is judged by the number of calls to the oracle so that one can decide, with high probability, between these two alternatives. The best known quantum algorithm for testing whether a function is linear or εεε-far (0<ε<12)(0 < ε< \frac{1}{2})(0<ε<21​) from linear functions requires O(ε−23)O(ε^{-\frac{2}{3}})O(ε−32​) many calls [Hillery and Andersson, Physical Review A 84, 062329 (2011)]. We show that this can be improved to O(ε−12)O(ε^{-\frac{1}{2}})O(ε−21​) by using the Deutsch-Jozsa and the Grover Algorithms.
The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is ε\varepsilonε-far from having that property. We investigate here several types of properties testing for Boolean functions (identity, correlations and balancedness) using the Deutsch-Jozsa algorithm (for the Deutsch-Jozsa (D-J) problem) and also the amplitude amplification technique. At first, we study here a particular testing problem: namely whether a given Boolean function fff, of nnn variables, is identical with a given function ggg or is ε\varepsilonε-far from ggg, where ε\varepsilonε is the parameter. We present a one-sided error quantum algorithm to deal with this problem that has the query complexity O(1ε)O(\frac{1}{\sqrt{\varepsilon}})O(ε​1​). Moreover, we show that our quantum algorithm is optimal. Afterwards we show that the classical randomized query complexity of this problem is Θ(1ε)\Theta(\frac{1}{\varepsilon})Θ(ε1​). Secondly, we consider the D-J problem from the perspective of functional correlations and let C(f,g)C(f,g)C(f,g) denote the correlation of fff and ggg. We propose an exact quantum algorithm for making distinction between ∣C(f,g)∣=ε|C(f,g)|=\varepsilon∣C(f,g)∣=ε and ∣C(f,g)∣=1|C(f,g)|=1∣C(f,g)∣=1 using six queries, while the classical deterministic query complexity for this problem is Θ(2n)\Theta(2^{n})Θ(2n) queries. Finally, we propose a one-sided error quantum query algorithm for testing whether one Boolean function is balanced versus ε\varepsilonε-far balanced using O(1ε)O(\frac{1}{\varepsilon})O(ε1​) queries. We also prove here that our quantum algorithm for balancedness testing is optimal. At the same time, for this balancedness testing problem we present a classical randomized algorithm with query complexity of O(1/ε2)O(1/\varepsilon^{2})O(1/ε2). Also this randomized algorithm is optimal. Besides, we link the problems considered here together and generalize them to the general case. Comment: 24 pages, comments are welcome. It is accepted for publishing in Fundamenta Informaticae
The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is ε\varepsilonε-far from having that property. We investigate here several types of properties testing for Boolean functions (identity, correlations and balancedness) using the Deutsch-Jozsa algorithm (for the Deutsch-Jozsa (D-J) problem) and also the amplitude amplification technique. At first, we study here a particular testing problem: namely whether a given Boolean function fff, of nnn variables, is identical with a given function ggg or is ε\varepsilonε-far from ggg, where ε\varepsilonε is the parameter. We present a one-sided error quantum algorithm to deal with this problem that has the query complexity O(1ε)O(\frac{1}{\sqrt{\varepsilon}})O(ε​1​). Moreover, we show that our quantum algorithm is optimal. Afterwards we show that the classical randomized query complexity of this problem is Θ(1ε)\Theta(\frac{1}{\varepsilon})Θ(ε1​). Secondly, we consider the D-J problem from the perspective of functional correlations and let C(f,g)C(f,g)C(f,g) denote the correlation of fff and ggg. We propose an exact quantum algorithm for making distinction between ∣C(f,g)∣=ε|C(f,g)|=\varepsilon∣C(f,g)∣=ε and ∣C(f,g)∣=1|C(f,g)|=1∣C(f,g)∣=1 using six queries, while the classical deterministic query complexity for this problem is Θ(2n)\Theta(2^{n})Θ(2n) queries. Finally, we propose a one-sided error quantum query algorithm for testing whether one Boolean function is balanced versus ε\varepsilonε-far balanced using O(1ε)O(\frac{1}{\varepsilon})O(ε1​) queries. We also prove here that our quantum algorithm for balancedness testing is optimal. At the same time, for this balancedness testing problem we present a classical randomized algorithm with query complexity of O(1/ε2)O(1/\varepsilon^{2})O(1/ε2). Also this randomized algorithm is optimal. Besides, we link the problems considered here together and generalize them to the general case. Comment: 24 pages, comments are welcome. It is accepted for publishing in Fundamenta Informaticae
This mathematically intensive chapter takes us through our first steps in the domain of quantum computation (QC) algorithms . The simplest of them is the Deutsch algorithm , which makes it possible to determine whether or not a Boolean function is constant for any input. The key result is that this QC algorithm provides the answer at once, whereas in the classical case it would take two independent calculations. I describe next the generalization of the former algorithm to n qubits, referred to as the Deutsch–Jozsa algorithm . Although they have no specific or useful applications in quantum computing, both algorithms represent a most elegant means of introducing the concept of quantum computation parallelism . I then describe two most important QC algorithms, which nicely exploit quantum parallelism. The first is the quantum Fourier transform (QFT), for which a detailed analysis of QFT circuits and quantum-gate requirements is also provided. As will be shown in the next chapter, a key application of QFT concerns the famous Shor's algorithm , which makes it possible to factor numbers into primes in terms of polynomials. The second algorithm, no less famous than Shor's, is referred to as the Grover quantum database search , whose application is the identification of database items with a quadratic gain in speed. Deutsch algorithm Our exploration of quantum algorithms shall begin with the solution of a very basic problem: finding whether or not a Boolean function f ( x ) is a constant.