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

Quantum Information Processing

Quantum algorithms for learning Walsh spectra of multi-output Boolean functions

Cui Jingyi, Jiansheng Guo, Linhong Xu, Mingming Li

Published May 2, 2019• 2 citations
Publisher
DOI
10.1007/s11128-019-2303-9

Related papers

Quantum algorithms on Walsh transform and Hamming distance for Boolean functions

Zhengwei Xie, Daowen Qiu, Guangya Cai

Quantum Information Processing•Apr 26, 2018•14 citations

Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions

Xuexuan Hao, Fengrong Zhang, Shixiong Xia +1 more

Quantum Information Processing•Jul 30, 2020•7 citations

Quantum cryptographic property testing of multi-output Boolean functions

Cui Jingyi, Jiansheng Guo

Quantum Information Processing•May 4, 2019•4 citations

A quantum algorithm for testing and learning resiliency of a Boolean function

Hongwei Li

Quantum Information Processing•Jan 3, 2019•3 citations

THE 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 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.

arXiv:quant-ph/0410042•International Journal of Quantum Information•May 31, 2005•13 citations

Quantum learning of concentrated Boolean functions

Krishna V. Palem, Duc Hung Pham, M. V. Panduranga Rao

Quantum Information Processing•Jul 26, 2022•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.