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 algorithms to check Resiliency, Symmetry and Linearity of a Boolean function

Kaushik Chakraborty, Anupam Chattopadhyay, Subhamoy Maitra

Published Jan 1, 2013• 0 citations
OpenAlex

Related papers

Quantum algorithm to check Resiliency of a Boolean function.

Kaushik Chakraborty, Subhamoy Maitra

•Jan 1, 2013•2 citations

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

Hongwei Li

Quantum Information Processing•Jan 3, 2019•3 citations

Quantum Algorithms for the Resiliency of Vectorial Boolean Functions

Hongwei Li

International Journal of Theoretical Physics•Mar 30, 2021•2 citations

Polynomial-time quantum algorithms for finding the linear structures of Boolean function

Wanqing Wu, Huanguo Zhang, Houzhen Wang +1 more

Quantum Information Processing•Feb 3, 2015•6 citations

Application of Grover’s algorithm to check non-resiliency of a Boolean function

Kaushik Chakraborty, Subhamoy Maitra

Cryptography and Communications•Aug 17, 2015•10 citations

Quantum algorithms for testing Boolean functions

Dominik Floess, Erika Andersson, Mark S. Hillery

We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.

arXiv:1006.1423•Electronic Proceedings in Theoretical Computer Science•Jun 9, 2010•16 citations
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.