English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Boolean reversible circuits are boolean circuits made of reversibleelementary gates. Despite their constrained form, they can simulate any booleanfunction. The synthesis and validation of a reversible circuit simulating agiven function is a difficult problem. In 1973, Bennett proposed to generatereversible circuits from traces of execution of Turing machines. In this paper,we propose a novel presentation of this approach, adapted to higher-orderprograms. Starting with a PCF-like language, we use a monadic representation ofthe trace of execution to turn a regular boolean program into acircuit-generating code. We show that a circuit traced out of a programcomputes the same boolean function as the original program. This technique hasbeen successfully applied to generate large oracles with the quantumprogramming language Quipper.

Generating reversible circuits from higher-order functional programs