Symmetry groups for the decomposition of reversible computers, quantum computers, and computers in between
Summary: Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversible computation circuits follow the symmetries of a finite group, i.e., the symmetric group. We confront the decomposition of an arbitrary classical reversible circuit with \(w\) bits and the decomposition of an arbitrary quantum circuit with \(w\) qubits. Both decompositions use the control gate as building block, i.e., a circuit transforming only one (qu)bit, the transformation being controlled by the other \(w-1\) (qu)bits. We explain why the former circuit can be decomposed into \(2w-1\) control gates, whereas the latter circuit needs \(2^w-1\) control gates. We investigate whether computer circuits, not based on the full unitary group but instead on a subgroup of the unitary group, may be decomposable either into \(2w-1\) or into \(2^w-1\) control gates.
- Reversible computation, quantum computation, and computer architectures in between
- Synthesis of quantum circuits vs. synthesis of classical reversible circuits
- Theory and Applications of Models of Computation
- The decomposition of an arbitrary reversible logic circuit
- A unified approach to quantum computation and classical reversible computation
- A unified approach to quantum computation and classical reversible computation
- An improved design of \(n\)-bit universal reversible gate library
- Minimal-entanglement entanglement-assisted quantum error correction codes from modified circulant matrices
- New constructions of quantum stabilizer codes based on difference sets
- A new pairwise NPN Boolean matching algorithm based on structural difference signature
- Improving the quantum cost of NCT-based reversible circuit
- Constructions for quantum computing with symmetrized gates
- Synthesis of quantum circuits vs. synthesis of classical reversible circuits
- The NEGATOR as a basic building block for quantum circuits
- Group theory for quantum gates and quantum coherence
- Reversible computation, quantum computation, and computer architectures in between
This page was built for publication: Symmetry groups for the decomposition of reversible computers, quantum computers, and computers in between
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q527558)
