nLab quantum logic gate

Contents

Context

Quantum systems

quantum logic


quantum physics


quantum probability theoryobservables and states


quantum information


quantum computation

qbit

quantum algorithms:


quantum sensing


quantum communication

Monoidal categories

monoidal categories

With braiding

With duals for objects

With duals for morphisms

With traces

Closed structure

Special sorts of products

Semisimplicity

Morphisms

Internal monoids

Examples

Theorems

In higher category theory

Contents

Idea

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.

Examples

The first examples are linearizations of classical logic gates, or rather of their reversible versions:


NOT or X:



XOR and CNOT:


AND:


The following examples have no classical analog:


Hadamard gate:


Pauli gate

(…)


(…)

References

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:

  • Price, Somaroo, Tseng, Gore, Fahmy,, Havel, Cory: Construction and Implementation of NMR Quantum Logic Gates for Two Spin Systems, Journal of Magnetic Resonance 140 2 (1999) 371-378 [doi;10.1006/jmre.1999.1851]

and analogously on electron-spin:

  • M. Yu. Volkov and K. M. Salikhov, Pulse Protocols for Quantum Computing with Electron Spins as Qubits, Appl Magn Reson 41 (2011) 145–154 [doi:10.1007/s00723-011-0297-2]

Last revised on September 18, 2023 at 09:05:43. See the history of this page for a list of all contributions to it.