Topics
ResearchGatePlace
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately
Abstract. We prove upper and lower bounds on the power of quantum and stochastic branching programs ...
Beginning with the Everett-DeWitt many-worlds interpretation of quantum mechanics, there have been a...
© 2018, Springer Nature Switzerland AG. Automata and branching programs are known models of computat...
We present classical simulation techniques for measure once quantum branching programs. For bounded ...
The complexity classes defined on the basis of branching programs are considered. Some basic relatio...
We present a survey of the communication point of view for a complexity lower bounds proof technique...
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...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
In this paper, we show that one-qubit polynomial time computations are as powerful as NC1 circuits. ...
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree q...
We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary...
AbstractIn this paper, we show that one-qubit polynomial time computations are as powerful as NC1 ci...
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 ...
Beginning with the Everett-DeWitt many-worlds interpretation of quantum mechanics, there have been a...
© 2018, Springer Nature Switzerland AG. Automata and branching programs are known models of computat...
We present classical simulation techniques for measure once quantum branching programs. For bounded ...
The complexity classes defined on the basis of branching programs are considered. Some basic relatio...
We present a survey of the communication point of view for a complexity lower bounds proof technique...
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...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
In this paper, we show that one-qubit polynomial time computations are as powerful as NC1 circuits. ...
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree q...
We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary...
AbstractIn this paper, we show that one-qubit polynomial time computations are as powerful as NC1 ci...
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 ...
Beginning with the Everett-DeWitt many-worlds interpretation of quantum mechanics, there have been a...
© 2018, Springer Nature Switzerland AG. Automata and branching programs are known models of computat...
Add to ORKG