quantum algorithms:
With braiding
With duals for objects
category with duals (list of them)
dualizable object (what they have)
ribbon category, a.k.a. tortile category
With duals for morphisms
monoidal dagger-category?
With traces
Closed structure
Special sorts of products
Semisimplicity
Morphisms
Internal monoids
Examples
Theorems
In higher category theory
Analogously to how a classical logic gate is a function between (finite) sets of tuples of bits (truth values), so a quantum logic gate is a (unitary) linear operator on (finite-dimensional) Hilbert spaces of tensor products of qbits:
Specifically, one calls such a linear map a quantum gate if it is thought of as potentially implemented as a basic operation performed by a quantum computing machine.
As such, typical quantum logic gates operate on a small number of qbits, with more complicated such linear maps obtained by composing a given set of quantum logic gates into quantum logic circuits. Such compilation is hence one model of quantum computation.
The first examples are linearizations of classical logic gates, or rather of their reversible versions:
AND:
The following examples have no classical analog:
(…)
(…)
The notion of quantum logic gates and quantum circuits originates with
See also:
Implementation of quantum logic gates on qbits realized via nucleon-spin, via pulse protocols in nuclear magnetic resonance-technology:
and analogously on electron-spin:
Last revised on March 7, 2023 at 14:58:56. See the history of this page for a list of all contributions to it.