constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
quantum algorithms:
In quantum information theory, a controlled quantum gate is a quantum gate whose operation on a given space of states is conditioned on the data in another space of “control states”.
The analogous situation for classical logic gates is without subtlety: Here the parameterization of a logic gate on $(n_{in}, n_{out})$-bits by $n_{ctrl}$ control bits is a choice of function
from the intended set of controls to the set of functions between the intended input/output; and by the internal hom-adjunction in the cartesian monoidal category of Sets this is in bijective correspondence with a single function out of the Cartesian product set of the control bits with the input bits:
This function would/could be called the “controlled logic gate”. Notice that the control bits in the above function are “discarded after use”, in that they cannot in general be recovered from the output of the above function.
The subtleties with generalizing this situation to quantum logic gates are:
The control of quantum gates may be either by quantum data or by classical data, which is not quite the same.
(In a quantum-controlled quantum logic gate, the control itself may be in a quantum superposition, while a classically-controlled quantum gate is effectively an indexed set of quantum gates, indexed by classical data.)
A quantum-controlled quantum gate should, like any pure quantum logic gate, be unitary, in particular invertible, hence it “must not discard” its control qbits.
This rules out the otherwise evident non-cartesian analog of the above classical situation (with the product operation replaced by the non-cartesian tensor product of finite-dimensional Hilbert spaces, typically, and hence with the internal hom now being the corresponding linear space of linear maps)):
While the linear map at the bottom always exists, it cannot be invertible (unless the control is trivial, with $n_{ctrl} = 0$, or the state space is trivial, with $n = 0$) and hence does not qualify as a quantum logic gate.
A general and precise definition of controlled quantum gates is hard to find in traditional literature (cf. Gurevich & Blass (2021) §1).
What traditional texbooks state (e.g. Nielsen & Chuang (2000) §4.3) is that for
a given quantum logic gate, its version controlled by a single qbit is its direct sum with the identity map, which may be thought of as the block-diagonal matrix-notation with diagonal blocks being $G$ and the identity function:
If we understand, as usual, that
then this gives a (invertible!) quantum gate on the tensor product space $QBit \otimes \mathscr{K}$, with the property that
$\vert 0 \rangle \,\otimes\, \vert \psi \rangle \;\;\mapsto\;\; \vert 0 \rangle \,\otimes\, \phantom{G}\vert \psi \rangle$
$\vert 1 \rangle \,\otimes\, \vert \psi \rangle \;\;\mapsto\;\; \vert 0 \rangle \,\otimes\, G\vert \psi \rangle$
In words: “If the control Qbit is definitely set, then we operate with $G$, if it is definitely not set then we operate trivially, and in general we operate with the respective superposition of these two actions.”
A basic example of this construction is the controlled quantum NOT gate.
The following is a more general definition along the lines of quantum circuits via dependent linear types.
Given a (finite) set $W$ of “control parameter values” (typically $W =$ Bool = $\{0, 1\}$), a $W$-indexed set of quantum logic gates is a morphism
in a category $LinType_B$ of $B$-dependent linear types (typically: complex vector bundles over $W$), which is fiber-wise a linear map $G_w$ with given desired properties (invertible, unitary, …).
As such, we may call this the classically controlled quantum gate, whose classical control parameter is $w \in W$ and whose quantum gate action for a given such parameter is $G_w$.
Here in the bottom left we assume that the state spaces themselves are independent of $w \colon W$, hence $\mathscr{H}_\bullet \,=\, \mathscr{H}$, which is typically the case in application.
The following shows the CNOT gate in its two incarnations as a classically or a quantumly controlled quantum gate:
Also the correction-operation in the quantum teleportation protocol (“Bob’s operation”) is given by classically-controlled quantum gates.
The symbolic notation for controlled quantum gates originates with:
Richard Feynman, Quantum mechanical computers, Foundations of Physics 16 (1986) 507–531 [doi:10.1007/BF01886518]
Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, Harald Weinfurter, Elementary gates for quantum computation, Phys. Rev. A52 (1995) 3457 [arXiv:quant-ph/9503016, doi:10.1103/PhysRevA.52.3457]
Traditional textbook accounts of controlled quantum gates:
See also at:
Discussion in terms of quantum information theory via dagger-compact categories (cf. at quantum reader monad):
The above discussion and graphics follows:
Last revised on August 16, 2023 at 10:04:32. See the history of this page for a list of all contributions to it.