Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Exploiting the benefits of clean ancilla based Toffoli gate decomposition across architectures: Label: en
Improved cost-metric for nearest neighbor mapping of quantum circuits to 2-dimensional hexagonal architecture: Label: en
Implementation of a reversible distributed calculus: Label: en
Improved synthesis of Toffoli-Hadamard circuits: Label: en
Uncomputation in the Qrisp high-level quantum programming framework: Label: en
Optimizing quantum space using spooky pebble games: Label: en
Quantum string matching unfolded and extended: Label: en
Towards a dereversibilizer: fewer asserts, statically: Label: en
Saving memory space in deep neural networks by recomputing: a survey: Label: en
Tail recursion transformation for invertible functions: Label: en
Optimization of reversible control flow graphs: Label: en
Computational complexity of reversible reaction systems: Label: en
Towards a taxonomy for reversible computation approaches: Label: en
Replications in reversible concurrent calculi: Label: en
Energy complexity of computation: Label: en
Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications: Label: en
Reversible In-Place Carry-Lookahead Addition with Few Ancillae: Label: en
Implementing NChooseK on IBM Q Quantum Computer Systems: Label: en
Evaluating ESOP Optimization Methods in Quantum Compilation Flows: Label: en
Evaluating the Flexibility of A* for Mapping Quantum Circuits: Label: en
An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid: Label: en
Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation: Label: en
Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures: Label: en
Reversible Imperative Parallel Programs and Debugging: Label: en
Sized Types for Low-Level Quantum Metaprogramming: Label: en
Characterizing Compatible View Updates in Syntactic Bidirectionalization: Label: en
Reversibility vs Local Creation/Destruction: Label: en
Inversion, Iteration, and the Art of Dual Wielding: Label: en
A Birkhoff Connection Between Quantum Circuits and Linear Classical Reversible Circuits: Label: en
Concurrent Quantum Strategies: Label: en
OR-Toffoli and OR-Peres Reversible Gates: Label: en
Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network: Label: en
Finding Optimal Implementations of Non-native CNOT Gates Using SAT: Label: en
Efficient Construction of Functional Representations for Quantum Algorithms: Label: en
Reversibility of Executable Interval Temporal Logic Specifications: Label: en
Splitting Recursion Schemes into Reversible and Classical Interacting Threads: Label: en
A Tangled Web of 12 Lens Laws: Label: en
Towards a Truly Concurrent Semantics for Reversible CCS: Label: en
Reversibility and Predictions: Label: en
Towards a Unified Language Architecture for Reversible Object-Oriented Programming: Label: en
Explicit Identifiers and Contexts in Reversible Concurrent Calculus: Label: en
Causal-Consistent Debugging of Distributed Erlang Programs: Label: en
Compiling Janus to RSSA: Label: en
Forward-Reverse Observational Equivalences in CCSK: Label: en
Reversible Functional Array Programming: Label: en
Variational Quantum Eigensolver and Its Applications: Label: en
How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?: Label: en
Controlled Reversibility and Compensations: Label: en
A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway: Label: en
A Verification Technique for Reversible Process Algebra: Label: en