Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics

DOI10.1007/978-3-319-20860-2_13zbMath1464.68109OpenAlexW1011234245MaRDI QIDQ2822512

Michael Kirkedal Thomsen, Robin Kaarsgaard, Mathias Soeken

Publication date: 30 September 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20860-2_13

zbMATH Keywords

permutationterm rewritingreversible logiccircuit equivalenceancillae

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Other nonclassical models of computation (68Q09) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

Graph Transformation Meets Reversible Circuits: Model Transformation and Optimization ⋮ A class of recursive permutations which is primitive recursive complete

Uses Software

• Quipper

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds for reversible circuits based on Young subgroups
• Time and space bounds for reversible simulation
• Describing and Optimising Reversible Logic Using a Functional Language
• An Introduction to Quantum Programming in Quipper
• White Dots do Matter: Rewriting Reversible Logic Circuits
• Time/Space Trade-Offs for Reversible Computation

This page was built for publication: Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics