Coalgebraic walks, in quantum and Turing computation

DOI10.1007/978-3-642-19805-2_2zbMATH Open1326.68192OpenAlexW2109998602MaRDI QIDQ3000596FDOQ3000596

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

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

Mathematics Subject Classification ID

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

Cited In (9)

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

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)