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 algorithm to check Resiliency of a Boolean function.

Kaushik Chakraborty, Subhamoy Maitra

Published Jan 1, 2013• 2 citations
OpenAlex

Related papers

Quantum algorithms to check Resiliency, Symmetry and Linearity of a Boolean function

Kaushik Chakraborty, Anupam Chattopadhyay, Subhamoy Maitra

•Jan 1, 2013•0 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

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

Computing Boolean Functions via Quantum Hashing

Farid Mansurovich Ablayev, Alexander Vasiliev

Lecture notes in computer science•Jan 1, 2014•15 citations

An efficient functional verification method for quantum boolean circuits

Shiou-An Wang, Chin-Yung Lu, Sy‐Yen Kuo

Functional verification is an important design method for verifying functional equivalence between a simplified quantum Boolean circuit and original one. During the design process, checking the equivalence of two quantum Boolean circuits is necessary. In this paper, we present an algorithm that can efficiently and easily verify two quantum Boolean circuits by using the back propagation method. For a set of input vectors, the idea of the algorithm is to find the checking vectors that output vectors are different from input vectors by a backward tracking process.

IEEE Conference on Nanotechnology (IEEE NANO)•Apr 1, 2005•0 citations
Functional verification is an important design method for verifying functional equivalence between a simplified quantum Boolean circuit and original one. During the design process, checking the equivalence of two quantum Boolean circuits is necessary. In this paper, we present an algorithm that can efficiently and easily verify two quantum Boolean circuits by using the back propagation method. For a set of input vectors, the idea of the algorithm is to find the checking vectors that output vectors are different from input vectors by a backward tracking process.