A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree quantum read-once branching programs of size O(n^3), while each classical randomized read-once branching program and each quantum OBDD for this function with bounded two-sided error requires size 2^{omega(n)}
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...
We present a survey of the communication point of view for a complexity lower bounds proof technique...
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree q...
In this paper we review our current results concerning the computational power of quantum read-once ...
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...
We present classical simulation techniques for measure once quantum branching programs. For bounded ...
We prove upper and lower bounds on the power of quantum and stochastic branching programs of bounded...
Abstract. We prove upper and lower bounds on the power of quantum and stochastic branching programs ...
We present classical simulation techniques for measure once quantum branching programs. For b...
We present a classical stochastic simulation technique of quantum Branching programs. This technique...
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computationa...
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions...
© Springer International Publishing Switzerland 2014. In this paper we show a computational aspect o...
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...
We present a survey of the communication point of view for a complexity lower bounds proof technique...
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree q...
In this paper we review our current results concerning the computational power of quantum read-once ...
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...
We present classical simulation techniques for measure once quantum branching programs. For bounded ...
We prove upper and lower bounds on the power of quantum and stochastic branching programs of bounded...
Abstract. We prove upper and lower bounds on the power of quantum and stochastic branching programs ...
We present classical simulation techniques for measure once quantum branching programs. For b...
We present a classical stochastic simulation technique of quantum Branching programs. This technique...
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computationa...
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions...
© Springer International Publishing Switzerland 2014. In this paper we show a computational aspect o...
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...
We present a survey of the communication point of view for a complexity lower bounds proof technique...
DOI
Add to ORKG