Add to ORKGClassical reversible logic and quantum computing share the common feature that all computations are reversible, each result of a computation can be brought back to the initial state without loss of information
Reversible logic circuits are beneficial to both classical and quantum computer design. Present-day ...
Quantum computation on w qubits is represented by the infinite unitary group U(2^w); classical rever...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and ...
By means of a subgroup of the 2 X 2 unitary matrices, i.e. a subgroup Q of U(2), acting on a single ...
Reversible logical operations implemented via reversible logic gates (that can be realized in practi...
The design of a quantum computer and the design of a classical computer can be based on quite simi...
This article is an attempt to generalize the classical theory of reversible computing, principally d...
Thanks to the cosine-sine decomposition of unitary matrices, an arbitrary quantum circuit, acting on...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
Birkhoff's theorem tells how any doubly stochastic matrix can be decomposed as a weighted sum of per...
We present a complete classification of all possible sets of classical reversible gates acting on bi...
AbstractThe λ-calculus is destructive: its main computational mechanism – beta reduction – destroys ...
AbstractConventional logic gates (e.g. AND gates) cannot be used for building a reversible computer....
In the first chapter we introduce new forms of quantum logic suggested by quantum computation, calle...
Reversible logic circuits are beneficial to both classical and quantum computer design. Present-day ...
Quantum computation on w qubits is represented by the infinite unitary group U(2^w); classical rever...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and ...
By means of a subgroup of the 2 X 2 unitary matrices, i.e. a subgroup Q of U(2), acting on a single ...
Reversible logical operations implemented via reversible logic gates (that can be realized in practi...
The design of a quantum computer and the design of a classical computer can be based on quite simi...
This article is an attempt to generalize the classical theory of reversible computing, principally d...
Thanks to the cosine-sine decomposition of unitary matrices, an arbitrary quantum circuit, acting on...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...
Birkhoff's theorem tells how any doubly stochastic matrix can be decomposed as a weighted sum of per...
We present a complete classification of all possible sets of classical reversible gates acting on bi...
AbstractThe λ-calculus is destructive: its main computational mechanism – beta reduction – destroys ...
AbstractConventional logic gates (e.g. AND gates) cannot be used for building a reversible computer....
In the first chapter we introduce new forms of quantum logic suggested by quantum computation, calle...
Reversible logic circuits are beneficial to both classical and quantum computer design. Present-day ...
Quantum computation on w qubits is represented by the infinite unitary group U(2^w); classical rever...
Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversi...