Reversible logic has found itself to a new height ever since the semiconductor industry has
observed the saturation in Moore's law along with sizable power/heat dissipation. Many …

Query complexity is a common tool for comparing quantum and classical computation, and it
has produced many examples of how quantum algorithms differ from classical ones. Here …

Quantum computation may well be performed with the use of electric circuits. Especially, the
Schrödinger equation can be simulated by a lumped-element model of transmission lines …

This PhD dissertation investigates garbage-free reversible computing systems from abstract
design to physical gate-level implementation. Designed in reversible logic, we propose a …

Reversible logic is an emerging digital design paradigm which promises low energy
dissipation; thanks to its information‐lossless nature. True potential of this exciting concept …

Shor's algorithm can find prime factors of a large number more efficiently than any known
classical algorithm. Understanding the properties that gives the speedup is essential for a …

Reversible computing spans computational models that are both forward and backward
deterministic. These models have applications in program inversion and bidirectional …

In the recent years, the circuit complexity has been on massive rise. Manual designing of the
complex chips are no longer possible. This situation has led to the proliferation of automated …

Clock speeds of computing chips have leveled off dramatically since 2005, and putting more
cores in systems on a chip (SoC) has produced more heat, adding a new ceiling to further …

An interesting computational challenge is posed by finding the diagram in diagramless
crossword puzzles. We describe two approaches to placing the words in the diagram to form …