Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
SIAM Journal on Computing
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Space-bounded Quantum complexity
Journal of Computer and System Sciences
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Reversible space equals deterministic space
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the size of randomized OBDDs and read-once branching programs for k-stable functions
Computational Complexity
Quantum computation and quantum information
Quantum computation and quantum information
Computational complexity of uniform quantum circuit families and quantum Turing machines
Theoretical Computer Science
Time-space tradeoffs for branching programs
Journal of Computer and System Sciences
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
Determinism versus nondeterminism for linear time RAMs with memory restrictions
Journal of Computer and System Sciences - STOC 1999
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Non-Linear Time Lower Bound for Boolean Branching Programs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Classical and Quantum Computation
Classical and Quantum Computation
Space-bounded quantum computation
Space-bounded quantum computation
On the complexity of simulating space-bounded quantum computations
Computational Complexity
On the computational power of probabilistic and quantum branching program
Information and Computation
On the computational power of probabilistic and quantum branching program
Information and Computation
Classical and quantum parallelism in the quantum fingerprinting method
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
On the average sensitivity of the weighted sum function
Information Processing Letters
Complexity of quantum uniform and nonuniform automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
| Hi-index | 5.23 |
In this paper, the space complexity of non-uniform quantum algorithms is investigated using the model of quantum branching programs (QBPs). In order to clarify the relationship between QBPs and non-uniform quantum Turing machines, simulations between these two models are presented which allow to transfer upper and lower bound results. Exploiting additional insights about the connection between the running time and the precision of amplitudes, it is shown that non-uniform quantum Turing machines with algebraic amplitudes and QBPs with a suitable analogous set of amplitudes are equivalent in computational power if both models work with bounded or unbounded error. Furthermore, quantum ordered binary decision diagrams (QOBDDs) are considered, which are restricted QBPs that can be regarded as a non-uniform analog of one-way quantum finite automata. Upper and lower bounds are proved that allow a classification of the computational power of QOBDDs in comparison to usual deterministic and randomized variants of the model. Finally, an extension of QBPs is proposed where the performed unitary operation may depend on the result of a previous measurement. A simulation of randomized BPs by this generalized QBP model as well as exponential lower bounds for its ordered variant are presented.