Generating Reversible Circuits from Higher-Order Functional Programs

DOI10.1007/978-3-319-40578-0_21zbMath1480.94057arXiv1603.08213OpenAlexW2314123426MaRDI QIDQ3186607

Benoît Valiron

Publication date: 10 August 2016

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

Full work available at URL: https://arxiv.org/abs/1603.08213

Mathematics Subject Classification ID

Quantum computation (81P68) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Uses Software

• Quipper
• RevLib
• RevKit
• Esterel
• SyReC

Cites Work

• Unnamed Item
• REVS: a tool for space-optimized reversible circuit synthesis
• A structural approach to reversible computation
• Synthesis and optimization of reversible circuits—a survey
• Information effects
• Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
• Geometry of synthesis
• Lightweight monadic programming in ML
• Functional netlists
• Quantum Algorithms for the Triangle Problem
• Logical Reversibility of Computation

This page was built for publication: Generating Reversible Circuits from Higher-Order Functional Programs