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:1109.3639

Local Correction of Boolean Functions

Noga Alon, Amit Weinstein

Published Sep 16, 2011• 0 citations
arXivHTMLPDF

Related papers

Creating Boolean Functions for the Five-EPR-Pair, Single-Error-Correcting Code

Jin-Yuan Hsieh, Che‐Ming Li

A quantum single-error-correcting scheme can be derived from a one-way entanglement purification protocol in purifying one Bell state from a finite block of five Bell states. The main issue to be concerned with in the theory of such an error-correction is to create specific linear Boolean functions that can transform the sixteen error syndromes occurring in the error-correcting code onto their mappings so that one Bell state is corrected whenever the other four in the finite block are measured. The Boolean function is performed under the effect of its associated sequence of basic quantum unilateral and bilateral operations. Previously, the Boolean function is created in use of the Monte Carlo computer search method. We introduce here a systematic scenario for creating the Boolean function and its associated sequence of operations so that we can do the job in an analytical way without any trial and error effort. Consequently, all possible Boolean functions can in principle be created by using our method. Furthermore, for a deduced Boolean function, we can also in the spirit of our method derive its best associated sequence of operations which may contain the least number of total operations or the least number of the bilateral XOR operations alone. Some results obtained in this work show the capability of our method in creating the Boolean function and its sequence of operations.

arXiv:quant-ph/0405038•May 8, 2004•0 citations

Implementation of Boolean Functions

Sergei Kurgalin, Sergei Borzunov

Texts in computer science•Jan 1, 2021•2 citations

Close Encounters with Boolean Functions of Three Different Kinds

Matthew Geoffrey Parker

Lecture notes in computer science•Aug 25, 2008•7 citations

Construction of Generalized Quantum Boolean Functions

Shanqi Pang, Qingjuan Zhang, Xiao Lin

The existing construction methods of Quantum Boolean functions (QBFs) are extended and simplified. All QBFs with one qubit and all local QBFs with any qubits are constructed. And we propose the concept of Generalized quantum Boolean functions (GQBFs). We find all GQBFs with one qutrit and all kinds of local GQBFs with any qutrits. The number of each of the four kinds of functions above is uncountably infinitely many. By using diagonal matrices, we obtain uncountably infinitely many non-local QBFs with any qubits and GQBFs with any qutrits. Infinitely many families of GQBFs with any qudits are obtained from the properties of projection matrices of known saturated orthogonal arrays.

Chinese Journal of Electronics•May 1, 2019•2 citations

Constructions of Quantum Boolean Functions

Jie Zhang, Qiaoyan Wen

A construction of all kinds of quantum Boolean functions with one qubit is proposed. Base on these quantum Boolean functions, all kinds of local quantum Boolean functions (the natural generalization of linear classical Boolean functions) are given. Furthermore some infinite families of quantum Boolean functions with any qubits are obtained together.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2010•1 citation

Algorithms and Computation

Masanori Ohya, Igor Vasil'evich Volovich

Theoretical and mathematical physics•Jan 1, 2011•0 citations
A quantum single-error-correcting scheme can be derived from a one-way entanglement purification protocol in purifying one Bell state from a finite block of five Bell states. The main issue to be concerned with in the theory of such an error-correction is to create specific linear Boolean functions that can transform the sixteen error syndromes occurring in the error-correcting code onto their mappings so that one Bell state is corrected whenever the other four in the finite block are measured. The Boolean function is performed under the effect of its associated sequence of basic quantum unilateral and bilateral operations. Previously, the Boolean function is created in use of the Monte Carlo computer search method. We introduce here a systematic scenario for creating the Boolean function and its associated sequence of operations so that we can do the job in an analytical way without any trial and error effort. Consequently, all possible Boolean functions can in principle be created by using our method. Furthermore, for a deduced Boolean function, we can also in the spirit of our method derive its best associated sequence of operations which may contain the least number of total operations or the least number of the bilateral XOR operations alone. Some results obtained in this work show the capability of our method in creating the Boolean function and its sequence of operations.
The existing construction methods of Quantum Boolean functions (QBFs) are extended and simplified. All QBFs with one qubit and all local QBFs with any qubits are constructed. And we propose the concept of Generalized quantum Boolean functions (GQBFs). We find all GQBFs with one qutrit and all kinds of local GQBFs with any qutrits. The number of each of the four kinds of functions above is uncountably infinitely many. By using diagonal matrices, we obtain uncountably infinitely many non-local QBFs with any qubits and GQBFs with any qutrits. Infinitely many families of GQBFs with any qudits are obtained from the properties of projection matrices of known saturated orthogonal arrays.