On randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of 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
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
Computing with highly mixed states (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Characterizations of 1-Way Quantum Finite Automata
SIAM Journal on Computing
On the Lower Bounds for One-Way Quantum Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Lower Bounds for One-way Probabilistic Communication Complexity
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
On Computational Power of Quantum Branching Programs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
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
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
| Hi-index | 0.00 |
We present two different types of complexity lower bounds for quantum uniform automata (finite automata) and nonuniform automata (OBDDs). We call them “metric” and “entropic” lower bounds in according to proof technique used. We present explicit Boolean functions that show that these lower bounds are tight enough. We show that when considering “almost all Boolean functions” on n variables our entropic lower bounds gives exponential (2c(δ)(n−−logn)) lower bound for the width of quantum OBDDs depending on the error δ allowed. Next we consider “generalized measure-many” quantum automata. It is appeared that for uniform and nonuniform automata (for space restricted models) their measure-once and measure-many models have different computational power.