Linked e-resources
Details
Table of Contents
Invited Paper
Energy complexity of computation
Foundations
Replications in Reversible Concurrent Calculi
Towards a Taxonomy for Reversible Computation Approaches
Computational Complexity of Reversible Reaction Systems
Reversible Programming
Optimization of Reversible Control Flow Graphs
Tail recursion transformation for invertible functions
Saving Memory Space in Deep Neural Networks by Recomputing: A Survey
Towards a Dereversibilizer: Fewer Asserts, Statically
Quantum Computing
Quantum String Matching Unfolded and Extended
Optimizing Quantum Space using Spooky Pebble Games
Uncomputation in the Qrisp high-level Quantum Programming Framework
Quantum Circuits
Improved Synthesis of Tooli-Hadamard Circuits
Implementation of a Reversible Distributed Calculus
Improved Cost-Metric for Nearest Neighbor Mapping of Quantum Circuits to 2-Dimensional Hexagonal Architecture
Exploiting the Benefits of Clean Ancilla Based Toffoli Gate Decomposition Across Architectures.
Energy complexity of computation
Foundations
Replications in Reversible Concurrent Calculi
Towards a Taxonomy for Reversible Computation Approaches
Computational Complexity of Reversible Reaction Systems
Reversible Programming
Optimization of Reversible Control Flow Graphs
Tail recursion transformation for invertible functions
Saving Memory Space in Deep Neural Networks by Recomputing: A Survey
Towards a Dereversibilizer: Fewer Asserts, Statically
Quantum Computing
Quantum String Matching Unfolded and Extended
Optimizing Quantum Space using Spooky Pebble Games
Uncomputation in the Qrisp high-level Quantum Programming Framework
Quantum Circuits
Improved Synthesis of Tooli-Hadamard Circuits
Implementation of a Reversible Distributed Calculus
Improved Cost-Metric for Nearest Neighbor Mapping of Quantum Circuits to 2-Dimensional Hexagonal Architecture
Exploiting the Benefits of Clean Ancilla Based Toffoli Gate Decomposition Across Architectures.