Abstract
Let H denote an algebra of input symbols or events. If X is the state space for a system, then one can form the space R of observations of X. Under suitable conditions, both X and R are H-modules. Loosely speaking, the formal systems studied in this paper consists of a bialgebra H describing the input symbols and two H-modules describing the states and observations of the system. Finite automata and input-output systems are concerned with commutative R, while quantum systems, such as quantum automata, are concerned with non-commutative R arising from Hermitian operators on the state space. Of special interest are those systems consisting of interacting networks of classical systems and automata. These types of systems have become known as hybrid systems and are examples of formal systems with commutative R. In this paper, we present a number of examples of hybrid systems and quantum automata and point out some relationships between them. This is a preliminary announcement: a detailed exposition, including proofs, will appear elsewhere.
This research was supported in part by NASA grant NAG2-513, DOE grant DEFG02-92ER25133, and NSF grants IRI 9224605 and CDA 9303433. Part of the work was done while visiting the Design Research Institute and Computer Science Department at Cornell University.
Sponsored in part by Army Research Office contract DAAL03-91-C-002.
Preview
Unable to display preview. Download preview PDF.
References
P. Benioff, “Quantum mechanical Hamiltonian models of Turing machines,” Journal of Statistical Physics, Volume 29, pp. 515–546, 1982.
A. Berthiaume and G. Brassard, “The quantum challenge to structural complexity theory,” Proceedings of the Seventh IEEE Conference on Structure in Complexity Theory, IEEE, pp. 132–137, 1992.
D. Deutsch, “Quantum theory, the Church-Turing principle and the universal quantum computer,” Proceedings of the Royal Society, Volume A425, pp. 73–90, 1985.
R. P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics, Voluem 21, pp. 467–488, 1982.
R. L. Grossman, A. Nerode, A. Ravn, and H. Rischel, editors, “Hybrid Systems”, Springer Lecture Notes in Computer Science, Springer-Verlag, Bonn, 1993.
R. Grossman and R. G. Larson, “The realization of input-output maps using bialgebras,” Forum Mathematicum, Volume 4, pp. 109–121, 1992.
R. L. Grossman and R. G. Larson, “An algebraic approach to hybrid systems,” Journal of Theoretical Computer Science, Volume 138, pp. 101–112, 1995.
R. L. Grossman, A. Nerode, and M. Sweedler, “A hilbert space approach to hybrid systems using formal dynamical systems,” submitted for publication.
R. L. Grossman and M. Sweedler, “Quantum automata and their realizations,” submitted for publication.
J. E. Hopcroft and J. D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, Reading, 1969.
P. W. Shor, “Algorithms for the quantum computation: Discrete log and factoring,” submitted for publication.
M. E. Sweedler, Hopf algebras, W. A. Benjamin, New York, 1969.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grossman, R.L., Sweedler, M. (1995). Hybrid systems and quantum automata: Preliminary announcement. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds) Hybrid Systems II. HS 1994. Lecture Notes in Computer Science, vol 999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60472-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-60472-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60472-3
Online ISBN: 978-3-540-47519-4
eBook Packages: Springer Book Archive