An Algebra of Automata That Includes Both Classical and Quantum Entities

Authors:
Luisa de Francesco Albasini;N. Sabadini;R. F. C. Walters
Affiliations:
Dipartimento di Informatica e Comunicazione, Universití degli Studi dell' Insubria, Como, Italy;Dipartimento di Informatica e Comunicazione, Universití degli Studi dell' Insubria, Como, Italy;Dipartimento di Informatica e Comunicazione, Universití degli Studi dell' Insubria, Como, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 8
Cited 0

Categories and computer science

Categories and computer science
On the relations between distributive computability and the BSS model

Theoretical Computer Science - Special issue on real numbers and computers
Quantum automata and quantum grammars

Theoretical Computer Science
Span(Graph): A Categorial Algebra of Transition Systems

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
A Formalization of the IWIM Model

COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Towards a quantum programming language

Mathematical Structures in Computer Science
A Categorical Semantics of Quantum Protocols

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an algebra for composing automata which includes both classical and quantum entities. We illustrate by describing in detail a quantum protocol.