Coalgebraic walks, in quantum and Turing computation

DOI10.1007/978-3-642-19805-2_2MaRDI QIDQ3000596zbMATH OpenOpenAlexFDO

Authors Bart Jacobs

Publication date 19 May 2011

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19805-2_2

Mathematics Subject Classification ID

Quantum computation (81P68) Abstract data types; algebraic specification (68Q65)

Recommendations

• Coalgebraic quantum computation
• Coassociative grammar, periodic orbits, and quantum random walk over \(\mathbb Z\)
• Quantum Walks and Quantum Cellular Automata
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• Coalgebras with symmetries and modelling quantum systems

Cited in

(9)

• Trace semantics via determinization
• Coassociative grammar, periodic orbits, and quantum random walk over \(\mathbb Z\)
• Applicative bisimulation and quantum \(\lambda\)-calculi
• Reversible monadic computing
• Dagger categories of tame relations
• Quantum walks: a comprehensive review
• Ambiguity and incomplete information in categorical models of language
• Involutive categories and monoids, with a GNS-correspondence
• Coalgebraic quantum computation

This page was built for publication: Coalgebraic walks, in quantum and Turing computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000596)