Unitary Matrices & Reversible Quantum Gates

1. The Core Requirement: Preserving Probability

A central rule in quantum mechanics is that the total probability of all possible measurement outcomes for a qubit must always be 1. As you learned, this is represented by the "normalization condition": for a state $|\psi ⟩=\alpha |0⟩+\beta |1⟩$, we must have $|\alpha {|}^2+|\beta {|}^2=1$.

In vector terms, this means the length (or norm) of the state vector must always be 1. When a quantum gate acts on a qubit, it transforms the state vector, but it absolutely cannot change its length. If it did, the total probability would no longer be 1, violating a fundamental law of physics.

Think of the state vector on the Bloch sphere (which we will explore more formally soon). Any operation must be a rotation of the vector, keeping its tip on the surface of the sphere, but never stretching or shrinking it. This is the essence of a unitary operation.

This first video provides a great high-level introduction to this idea.

2. What is a Unitary Matrix?

The video you just watched introduced the term unitary. Let's now formally define it.

Intuitive Definition: A Generalized Rotation

The simplest way to think of a unitary operator is as a "generalized rotation" in a complex vector space. Just as a physical rotation in 3D space preserves the lengths of vectors and the angles between them, a unitary transformation preserves the inner product between any two state vectors. Since the length of a vector is related to its inner product with itself, this guarantees that lengths are preserved.

The following video from Quantum Sense develops this intuition beautifully.

Mathematical Definition

Now, let's get to the precise mathematical definition.

As the article states, a matrix $U$ is unitary if its conjugate transpose is also its inverse. The conjugate transpose (or Hermitian conjugate) of a matrix is denoted by a dagger symbol, $U^{†}$. It's found by first taking the transpose of the matrix, then taking the complex conjugate of every element.

The defining equation for a unitary matrix is:
$U^{†}U=U{U}^{†}=I$
where $I$ is the identity matrix.

This next clip proves that this mathematical property is exactly what's needed to preserve the inner product, connecting the math back to our intuition.

3. Why Quantum Gates Must Be Unitary

We've established the what, now let's solidify the why. The requirement comes directly from the normalization condition we started with. When we apply a gate $U$ to a state $|\psi ⟩$, we get a new state $|{\psi }^{\prime }⟩=U|\psi ⟩$. For $|{\psi }^{\prime }⟩$ to be a valid quantum state, its norm squared, $⟨{\psi }^{\prime }|{\psi }^{\prime }⟩$, must equal 1.

The following reading walks through the algebra that shows this requirement directly leads to the condition $U^{†}U=I$.

4. The Main Implication: Reversibility

The fact that the inverse of a quantum gate $U$ is its conjugate transpose, $U^{†}$, has a crucial consequence: all quantum operations are reversible.

If you apply a gate $U$ to a state $|\psi ⟩$ to get $|{\psi }^{\prime }⟩$, you can always get back to the original state $|\psi ⟩$ by applying the gate $U^{†}$ to $|{\psi }^{\prime }⟩$.
$U^{†}|{\psi }^{\prime }⟩=U^{†}(U|\psi ⟩)=(U^{†}U)|\psi ⟩=I|\psi ⟩=|\psi ⟩$
This means no information is ever lost in a quantum computation. This is a stark contrast to classical computing.

Consider a classical AND gate. If the output is 0, you have no way of knowing if the input was (0,0), (0,1), or (1,0). Information has been irreversibly lost. A quantum equivalent of the AND gate must be constructed in a way that preserves all the input information, making it reversible.

The following reading explains this concept of reversibility in classical and quantum circuits.

5. A Concrete Example: The Pauli-X Gate

Let's make this concrete. The Pauli-X gate is the quantum equivalent of a classical NOT gate. Its matrix representation is:
$X=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$

Let's verify that this matrix is unitary.

1. Find the transpose, $X^T$: Swap the rows and columns.
   $X^T=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$

2. Find the conjugate transpose, $X^{†}$: Take the complex conjugate of each element of $X^T$. Since all elements are real, the matrix is unchanged.
   $X^{†}=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)$
   So, for the X gate, $X^{†}=X$. A matrix that is its own conjugate transpose is called Hermitian. A matrix that is also its own inverse is both Hermitian and unitary.

3. Check if $X^{†}X=I$:
   $X^{†}X=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right)=\left(\begin{array}{cc}(0)(0)+(1)(1)& (0)(1)+(1)(0)\\ (1)(0)+(0)(1)& (1)(1)+(0)(0)\end{array}\right)=\left(\begin{array}{cc}1& 0\\ 0& 1\end{array}\right)=I$
   It works! The X gate is unitary. Since $X^{-1}=X^{†}=X$, applying the X gate twice gets you back to where you started, which makes perfect sense for a NOT gate.

Conclusion

In this lesson, we've explored one of the most fundamental constraints in quantum computing. The physical requirement to conserve probability dictates the mathematical form our quantum gates must take.

Key Takeaways:

• Quantum gates are represented by unitary matrices.
• A matrix $U$ is unitary if its conjugate transpose is also its inverse: $U^{†}U=I$.
• This property ensures that the gate preserves the norm (length) of a quantum state vector, which means the total probability of all outcomes remains 1.
• The most important practical implication of unitarity is that all quantum operations are reversible. The inverse of a gate $U$ is simply $U^{†}$. This is a key difference from many classical logic gates which are irreversible.

Preview of the Next Lesson:
We have now established a solid mathematical foundation: we can represent single and multiple qubits as vectors, and we know that the gates that operate on them are unitary matrices. In the next lesson, we will step back from the formalism to build a deeper conceptual understanding of the qubit itself. We will officially define superposition, learn to represent qubit states with Dirac notation, and visualize them using the Bloch sphere.