Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-24T14:55:38.589Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Size of One-way Quantum Finite Automata with Periodic Behaviors

Published online by Cambridge University Press:  15 December 2002

Carlo Mereghetti  and
Beatrice Palano
Carlo Mereghetti
Affiliation:
Dipartimento di Informatica, Sist. e Com., Università degli Studi di Milano – Bicocca, Via Bicocca degli Arcimboldi 8, 20126 Milano, Italy; [email protected].
Beatrice Palano
Affiliation:
Dipartimento di Informatica, Università degli Studi di Torino, Corso Svizzera 185, 10149 Torino, Italy; [email protected].
Get access

Abstract

We show that, for any stochastic event p of period n, there exists a measure-once one-way quantum finite automaton (1qfa) with at most $2\sqrt{6n}+25$ states inducing the event ap+b, for constants a>0, b ≥ 0, satisfying a+b ≥ 1. This fact is proved by designing an algorithm which constructs the desired 1qfa in polynomial time. As a consequence, we get that any periodic language of period n can be accepted with isolated cut point by a 1qfa with no more than $2\sqrt{6n}+26$ states. Our results give added evidence of the strength of measure-once 1qfa's with respect to classical automata.

Keywords

Quantum finite automataperiodic events and languages
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 36 , Issue 3 , July 2002 , pp. 277 - 291
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley (1974).
Ambainis, A., Kikusts, A. and Valdats, M., On the Class of Languages Recognizable by1-way Quantum Finite Automata, in Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science. Springer, Lecture Notes in Comput. Sci. 2010 (2001) 305-316.
A. Ambainis and J. Watrous, Two-way Finite Automata with Quantum and Classical States. Technical Report (1999) quant-ph/9911009.
A. Ambainis and R. Freivalds, 1-way Quantum Finite Automata: Strengths, Weaknesses and Generalizations, in Proc. 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press (1998) 332-342.
A. Brodsky and N. Pippenger, Characterizations of 1-Way Quantum Finite Automata, Technical Report. Department of Computer Science, University of British Columbia,TR-99-03 (revised).
Colbourn, C. and Ling, A., Quorums from Difference Covers. Inform. Process. Lett. 75 (2000) 9-12. CrossRef
L. Grover, A Fast Quantum Mechanical Algorithm for Database Search, in Proc. 28th ACM Symposium on Theory of Computing (1996) 212-219.
J. Gruska, Quantum Computing. McGraw-Hill (1999).
Gruska, J., Descriptional complexity issues in quantum computing. J. Autom. Lang. Comb. 5 (2000) 191-218.
Jiang, T., McDowell, E. and Ravikumar, B., The Structure and Complexity of Minimal nfa's over a Unary Alphabet. Int. J. Found. Comput. Sci. 2 (1991) 163-182. CrossRef
A. Kikusts, A Small 1-way Quantum Finite Automaton. Technical Report (1998) quant-ph/9810065.
M. Kohn, Practical Numerical Methods: Algorithms and Programs. The MacmillanCompany (1987).
A. Kondacs and J. Watrous, On the Power of Quantum Finite State Automata, in Proc. 38th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press (1997) 66-75.
M. Marcus and H. Minc, Introduction to Linear Algebra. The Macmillan Company (1965). Reprinted by Dover (1988).
M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities. Prindle, Weber & Schmidt (1964). Reprinted by Dover (1992).
Mereghetti, C. and Upper Bounds, B. PALANO on the Size of One-way Quantum Finite Automata, in Proc. 7th Italian Conference on Theoretical Computer Science. Springer, Lecture Notes in Comput. Sci. 2202 (2001) 123-135. CrossRef
C. Mereghetti, B. Palano and G. Pighizzini, On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata, in Pre-Proc. Descriptional Complexity of Automata, Grammars and Related Structures. Univ. Otto Von Guericke, Magdeburg, Germany (2001) 141-148. RAIRO: Theoret. Informatics Appl. (to appear).
Mereghetti, C. and Pighizzini, G., Two-Way Automata Simulations and Unary Languages. J. Autom. Lang. Comb. 5 (2000) 287-300.
Moore, C. and Crutchfield, J., Quantum automata and quantum grammars. Theoret. Comput. Sci. 237 (2000) 275-306. CrossRef
Pin, J.-E., Languages Accepted, On by finite reversible automata, in Proc. 14th International Colloquium on Automata, Languages and Programming. Springer-Verlag, Lecture Notes in Comput. Sci. 267 (1987) 237-249. CrossRef
P. Shor, Algorithms for Quantum Computation: Discrete Logarithms and Factoring, in Proc. 35th Annual Symposium on Foundations of Computer Science. IEEE ComputerScience Press (1994) 124-134.
Shor, P., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26 (1997) 1484-1509. CrossRef
Wichmann, B., A note on restricted difference bases. J. London Math. Soc. 38 (1963) 465-466. CrossRef