Search
Search Results
-
LinguaQuanta: Towards a Quantum Transpiler Between OpenQASM and Quipper
As quantum computing evolves, many important questions emerge, such as how best to represent quantum programs, and how to promote interoperability...
-
A Small-Step Semantics for Janus
Janus is an imperative, sequential language for reversibility. While heavily studied in the reversibility literature, to the best of our knowledge,...
-
Algorithmically Expressive, Always-Terminating Model for Reversible Computation
Concerning classical computational models able to express all the Primitive Recursive Functions (PRF), there are interesting results regarding limits...
-
Causal Debugging for Concurrent Systems
Debugging concurrent systems is notoriously hard, since bugs may manifest only for some interleavings among the processes’ execution, and since...
-
Is Simulation the only Alternative for Effective Verification of Dynamic Quantum Circuits?
This paper investigates the verification gap of Dynamic Quantum Circuits (DQC) by analyzing state-of-the-art equivalence checking approaches. Today’s...
-
Model Checking Reversible Systems: Forwardly
Reversibility is nowadays playing a major role when dealing with systems, allowing to revert to safe states of systems evolutions. For instance...
-
Jeopardy: An Invertible Functional Programming Language
Reversible programming languages guarantee that their programs are invertible at the cost of restricting the permissible operations to those which...
-
Towards Clean Reversible Lossless Compression
Zip and unzip are everyday tools in today’s digital world. Since they are inherently inverse to each other, they are ideal for studying reversible...
-
Exploring the Energy Overhead of Reversible Programs Executed on Irreversible Hardware
This paper investigates the energy efficiency of reversible programs executed on irreversible hardware. Motivated by Landauer’s principle, which...
-
Employing Events Trees
Abstract
-
Normal Forms and Circuit Design
Abstract
-
Design by Composition
Abstract
-
Designing and Testing on a Computer
Abstract
-
Flow Table Development and Usage
Abstract
-
-
Specifying Asynchronous Circuits
Abstract
-
Actuator Control Units
Abstract
-
Basic Theory of Latches
To be able to develop an abstract concept of a latch, we need something from which to abstract. Section 1 introduces us to a number of devices and a...
-
Switching Devices
Logic gates, as introduced in the previous chapter, represent the connectives used in logic formulas. Assume you have drawn a circuit diagram using...
-
Algebraic Minimisation
Abstract