Abstract
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.
The research supported in part by Russia Fund for Basic Research 03-01-00769
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ablayev, F.M.: Lower Bounds for One-way Probabilistic Communication Complexity. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol. 700, pp. 241–252. Springer, Heidelberg (1993)
Ablayev, F., Gainutdinova, A.: On the Lower Bound for One-Way Quantum Automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 132–140. Springer, Heidelberg (2000)
Ablayev, F., Gainutdinova, A., Karpinski, M.: On the computational power of quantum branching programs. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 59–70. Springer, Heidelberg (2001)
Ablayev, F., Moore, C., Pollett, C.: Quantum and stochastic branching programs of bounded width. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, p. 343. Springer, Heidelberg (2002)
Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: Proc. of 30th STOC, pp. 20–30 (1998)
Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalization. In: Proc. of the 39th IEEE Conference on Foundation of Computer Science, pp. 332–342 (1998); See also quant-ph/9802062 v3
Ambainis, A., Schulman, L., Vazirani, U.: Computing with highly mixed states. In: Proc. 32nd ACM Symp. on Theory of Computing, pp. 697–704 (2000)
Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. quant-ph/9903014 (1999)
Hromkovich, J.: Communication complexity and parallel computing. Springer, Heidelberg (1997)
Kremer, I., Nisan, N., Ron, D.: On randomized one-round communication complexity. In: Proc. of the 27th annual ACM symposium on Theory of computing, pp. 596–605 (1995)
Klauck, H.: On quantum and probabilistic communication: La Vegas and one-way protocols. In: Proc. of the 32nd ACM Symp. Theory of Computing (2000)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. of the 38th IEEE Conference on Foundation of Computer Science, pp. 66–75 (1997)
Moore, C., Crutchfield, J.: Quantum automata and quantum grammars, quantph/ 9707031
Nakanishi, M., Hamaguchi, K., Kashiwabara, T.: Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 467–476. Springer, Heidelberg (2000)
Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proc. of the 40th IEEE Conference on Foundation of Computer Science, pp. 369–376 (1999); See also quant-ph/9904093
Rabin, M.O.: Probabilistic automata. Information and Control 6, 230–244 (1963)
Sauerhoff, M., Sieling, D.: Quantum branching programs and space-bounded nonuniform quantum complexity. ph/0403164 (March 2004)
Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications (2000)
Yao, A.: Some Complexity Questions Related to Distributive Computing. In: Proc. of the 11th Annual ACM Symposium on the Theory of Computing, pp. 209–213 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ablayev, F., Gainutdinova, A. (2005). Complexity of Quantum Uniform and Nonuniform Automata. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_7
Download citation
DOI: https://doi.org/10.1007/11505877_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26546-7
Online ISBN: 978-3-540-31682-4
eBook Packages: Computer ScienceComputer Science (R0)