In this paper we consider an application of the recently proposed quantum hashing technique for computing Boolean functions in the quantum communication model. The combination of binary functions on non-binary quantum hash function is done via polynomial presentation, which we have called a characteristic of a Boolean function. Based on the characteristic polynomial presentation of Boolean functions and quantum hashing technique we present a method for computing Boolean functions in the quantum one-way communication model, where one of the parties performs his computations and sends a message to the other party, who must output the result after his part of computations. Some of the results are also true in a more restricted Simultaneous Message Passing model with no shared resources, in which communicating parties can interact only via the referee. We give several examples of Boolean functions whose polynomial presentations have specific properties allowing for construction of quantum communication protocols that are provably exponentially better than classical ones in the simultaneous message passing setting.
The application in cryptography of quantum algorithms for prime factorization fostered the interest in quantum computing. However, quantum computers, and particularly quantum annealers, can also be helpful to construct secure cryptographic keys. Indeed, finding robust Boolean functions for cryptography is an important problem in sequence ciphers, block ciphers, and hash functions, among others. Due to the superexponential size
O(22n) of the associated space, finding
n-variable Boolean functions with global cryptographic constraints is computationally hard. This problem has already been addressed employing generic low-connected incoherent D-Wave quantum annealers. However, the limited connectivity of the Chimera graph, together with the exponential growth in the complexity of the Boolean-function design problem, limit the problem scalability. Here, we propose a special-purpose coherent quantum-annealing architecture with three couplers per qubit, designed to optimally encode the bent-function design problem. A coherent quantum annealer with this tree-type architecture has the potential to solve the eight-variable bent-function design problem, which is classically unsolved, with only
127 physical qubits and
126 couplers. This paves the way to reach useful quantum supremacy within the framework of quantum annealing for cryptographic purposes.