An Algebra of Automata That Includes Both Classical and Quantum Entities

DOI10.1016/j.entcs.2011.01.036zbMath1347.68248OpenAlexW1999501803WikidataQ113318301 ScholiaQ113318301MaRDI QIDQ2825378

Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.01.036

zbMATH Keywords

teleportationmonoidal categoryspancompact closedquantum automatonclassical automatonFrobenius equations

Mathematics Subject Classification ID

Quantum computation (81P68) Algebraic theory of languages and automata (68Q70)

Uses Software

• QPL

Cites Work

• Cartesian bicategories. I
• Coherence for compact closed categories
• On the relations between distributive computability and the BSS model
• Quantum automata and quantum grammars
• The compositional construction of Markov processes II
• Cartesian Bicategories II
• Categories and Computer Science
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Introduction to bicategories
• Feedback, trace and fixed-point semantics
• Towards a quantum programming language
• A note on recursive functions
• Frobenius Objects in Cartesian Bicategories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Algebra of Automata That Includes Both Classical and Quantum Entities