next up previous contents
Next: Quantum Algorithms Up: Quantum Computing Previous: Superposition   Contents

Unitary Operators

Not all functions on a quantum memory register preserve the superposition of the state vector. For example, measurement destroys the superposition in the register. Operations that collapse the state vector are called measurements, and any complex linear transformation of the state vector is called an operator. We can represent any operator on an N-bit quantum memory register in $ \Complex^{{2^{N}}}_{}$ as a matrix

T = $\displaystyle \left(\vphantom{ \begin{array}{cccc}
T_{00} & T_{01} & \ldots & ...
...N}-1)0} & T_{(2^{N}-1)1} & \ldots &
T_{(2^{N}-1)(2^{N}-1)}
\end{array}}\right.$$\displaystyle \begin{array}{cccc}
T_{00} & T_{01} & \ldots & T_{0(2^{N}-1)} \\...
... T_{(2^{N}-1)0} & T_{(2^{N}-1)1} & \ldots &
T_{(2^{N}-1)(2^{N}-1)}
\end{array}$$\displaystyle \left.\vphantom{ \begin{array}{cccc}
T_{00} & T_{01} & \ldots & ...
...N}-1)0} & T_{(2^{N}-1)1} & \ldots &
T_{(2^{N}-1)(2^{N}-1)}
\end{array}}\right)$

[9].

Quantum mechanics imposes conditions on which linear transformations are legal operators. In particular, the operation must be reversible, and it must preserve the length of the state vector [9]. If we impose the condition that the sum of the kinetic and potential energy (called the Hamiltonian) of our quantum memory register is constant, then all legal operators have unitary matrix representations. A matrix T is unitary if the transpose of its complex conjugate is T-1 [9]. Systems with time-dependent Hamiltonians are not required to perform either Grover's or Shor's algorithm, and are not within the scope of this thesis.


next up previous contents
Next: Quantum Algorithms Up: Quantum Computing Previous: Superposition   Contents
Matthew Hayward Lower Query Bounds in the Quantum Oracle Model GitHub Repository