Add to ORKG© Springer International Publishing Switzerland 2014. In this paper we show a computational aspect of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read-once quantum branching programs based on the properties of specific polynomial presentation of those functions
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree q...
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computationa...
It is believed that there is no efficient classical algorithm to determine the linear structure of B...
© Springer International Publishing Switzerland 2014. In this paper we show a computational aspect o...
In this paper we review our current results concerning the computational power of quantum read-once ...
© Research India Publications. In this paper we consider an application of the recently proposed qua...
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions...
© 2018 Author(s). We investigate the branching program complexity of quantum hashing. We consider a ...
We develop quantum fingerprinting technique for constructing quantum branching pro-grams (QBPs), whi...
© 2018, Springer Nature Switzerland AG. Automata and branching programs are known models of computat...
© 2016, Allerton Press, Inc.We propose a binary quantum hashing technique that allows to present bin...
In this paper, we show that one-qubit polynomial time computations are as powerful as NC1 circuits. ...
AbstractIn this paper, we show that one-qubit polynomial time computations are as powerful as NC1 ci...
A vectorial Boolean function takes multi-bit input and produces a multi-bit output. According to the...
In this paper we focus on how the classical and quantum parallelism are combined in the quantum fing...
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree q...
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computationa...
It is believed that there is no efficient classical algorithm to determine the linear structure of B...
© Springer International Publishing Switzerland 2014. In this paper we show a computational aspect o...
In this paper we review our current results concerning the computational power of quantum read-once ...
© Research India Publications. In this paper we consider an application of the recently proposed qua...
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions...
© 2018 Author(s). We investigate the branching program complexity of quantum hashing. We consider a ...
We develop quantum fingerprinting technique for constructing quantum branching pro-grams (QBPs), whi...
© 2018, Springer Nature Switzerland AG. Automata and branching programs are known models of computat...
© 2016, Allerton Press, Inc.We propose a binary quantum hashing technique that allows to present bin...
In this paper, we show that one-qubit polynomial time computations are as powerful as NC1 circuits. ...
AbstractIn this paper, we show that one-qubit polynomial time computations are as powerful as NC1 ci...
A vectorial Boolean function takes multi-bit input and produces a multi-bit output. According to the...
In this paper we focus on how the classical and quantum parallelism are combined in the quantum fing...
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree q...
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computationa...
It is believed that there is no efficient classical algorithm to determine the linear structure of B...