Quantum inductive inference by finite automata
Pages 70 - 76
Abstract
Freivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19-29] proved that probabilistic limited memory inductive inference machines can learn with probability 1 certain classes of total recursive functions, which cannot be learned by deterministic limited memory inductive inference machines. We introduce quantum limited memory inductive inference machines as quantum finite automata acting as inductive inference machines. These machines, we show, can learn classes of total recursive functions not learnable by any deterministic, nor even by probabilistic, limited memory inductive inference machines.
References
[1]
A. Ambainis, R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalizations, in: Proc. 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 332-341
[2]
Ambainis, A., Bonner, R.F., Freivalds, R. and ¿ikusts, A., Probabilities to accept languages by quantum finite automata. Springer Lecture Notes in Computer Science. v1627. 174-183.
[3]
Ambainis, A., Nayak, A., Ta-Shma, A. and Vazirani, U., Dense quantum coding and quantum finite automata. Journal of the ACM. v49 i4. 496-511.
[4]
Angluin, D. and Smith, C.H., Inductive inference: Theory and methods. Computing Surveys. v15 i3. 237-269.
[5]
Arikawa, S. and Haraguchi, M., A Theory of Analogical Reasoning. 1987. Ohm-sha.
[6]
Arikawa, S. and Nishino, T., Computational approaches to machine learning. JIPS. v32 i3. 217-225.
[7]
Arikawa, S. and Mukouchi, Y., Towards a mathematical theory of machine discovery from facts. Theoretical Computer Science. v137. 53-84.
[8]
B¿rzdi¿¿, J., Freivalds, R. and Smith, C.H., Learning with confidence. Springer Lecture Notes in Computer Science. v1045. 207-218.
[9]
B¿rzdi¿¿, J., Freivalds, R. and Smith, C.H., A logic of discovery. Springer Lecture Notes in Artificial Intelligence. v1532. 401-402.
[10]
Blum, L. and Blum, M., Toward a mathematical theory of inductive inference. Information and Control. v28 i2. 125-155.
[11]
Brodsky, A. and Pippenger, N., Characterizations of 1-way quantum finite autiomata. SIAM Journal on Computing. v31 i5. 1456-1478.
[12]
Blum, L., Shub, M. and Smale, S., On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society. v21. 1-46.
[13]
Condon, A., . In: Pardalos, P., Reif, J., Rolim, J. (Eds.), Handbook on Randomized Computing, Vol. II. Kluwer. pp. 509-532.
[14]
Freivalds, R., Finite identification of general recursive functions by probabilistic strategies. In: Proc. Conf. on Algebraic, Arithmetic, and Categorical Methods in Computation Theory, Akademie-Verlag, Berlin. pp. 138-145.
[15]
Freivalds, R., Inductive inference of recursive functions: Qualitative theory. Springer Lecture Notes in Computer Science. v502. 77-110.
[16]
Freivalds, R. and Smith, C.H., Memory limited inductive inference machines. Springer Lecture Notes in Computer Science. v621. 19-29.
[17]
Freivalds, R., Kinber, E.B. and Smith, C.H., On the impact of forgetting on learning machines. Journal of the ACM. v42 i6. 1146-1168.
[18]
Freivalds, R., Kinber, E.B. and Smith, C.H., On the intrinsic complexity of learning. Information and Computation. v123 i1. 64-71.
[19]
Freivalds, R., Languages recognizable by quantum finite automata. Springer Lecture Notes in Computer Science. v3845. 1-14.
[20]
Gold, E.M., Language identification in the limit. Information and Control. v10. 447-474.
[21]
M. Hunziker, D.A. Meyer, J. Park, J. Pommersheim, M. Rothstein, The geometry of quantum learning, ArXiv e-prints. quant-ph/0309059, 2003
[22]
A. Kondacs, J. Watrous, On the power of quantum finite state automata, in: Proc. 38th IEEE Synposium on Foundations of Computer Science, 1997, pp. 66-75
[23]
Moore, C. and Crutchfield, J., Quantum automata and quantum grammars. Theoretical Computer Science. v237. 275-306.
[24]
A. Nayak, Optimal lower bounds for quantum automata and random access codes, in: Proc. 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 369-376
[25]
I. Niven, Irrational Numbers, The Carus Mathematical Monographs 11, Mathematical Association of America, 1967
[26]
Pitt, L., A characterization of probabilistic inference. Journal of the ACM. v36 i2. 383-433.
[27]
Pitt, L. and Smith, C.H., Probability and plurality for aggregations of learning machines. Information and Computation. v77 i1. 77-92.
[28]
Rabin, M.O., Probabilistic automata. Information and Control. v6 i3. 230-245.
[29]
Rogers Jr., H., Theory of Recursive Functions and Effective Computability. 1987. MIT Press.
[30]
R. Servedio, Separating quantum and classical learning, in: Proc. 28th International Conference on Automata, Languages and Programming, ICALP, 2001, pp. 1065-1080
[31]
R. Servedio, S.J. Gortler, Quantum versus classical learnability, in: Proc. 16th IEEE Conference on Computational Complexity, CCC, 2001
[32]
Shor, P.W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing. v26 i5. 1484-1509.
[33]
Wiehagen, R., Limes¿Erkennung rekursiver Funktionen durch spezielle Strategien. Journal of Information Processing and Cybernetics (EIK). v12. 93-99.
[34]
Wiehagen, R. and Zeugmann, T., Ignoring data may be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence. v6 i1. 131-144.
[35]
R. Wiesner, J.P. Crutchfield, Computation in finitary quantum processes, Santa Fe Institute Working Paper 06-09-031, 2006. Also arxiv.org/quant-ph/0608206
Index Terms
- Quantum inductive inference by finite automata
Recommendations
Characterizations of 1-Way Quantum Finite Automata
The 2-way quantum finite automaton introduced by Kondacs and Watrous [ Proceedings of the 38 th Annual Symposium on Foundations of Computer Science , 1997, IEEE Computer Society, pp. 66--75] can accept nonregular languages with bounded error in ...
Characterizations of quantum automata
We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to those measure-once quantum finite automata (MO-QFAs) in the literature. In particular, we define q quantum pushdown ...
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer ScienceWe study 1-way quantum finite automata (QFAs).First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (greater than 7/9), then any 1-way QFAs can be ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier Ltd © 2008.
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Published: 10 May 2008
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in