Core question: How do we deliberately transform a quantum state?
A quantum computation does not only measure a state.
Before measurement, we deliberately transform the state using quantum gates .
For a state ∣ ψ ⟩ |\psi\rangle ∣ ψ ⟩ , a gate U U U produces
∣ ψ ′ ⟩ = U ∣ ψ ⟩ . |\psi'\rangle = U|\psi\rangle. ∣ ψ ′ ⟩ = U ∣ ψ ⟩ .
The central mathematical requirement is that U U U is unitary .
1. Why Quantum Gates Must Be Unitary
A normalized quantum state satisfies
⟨ ψ ∣ ψ ⟩ = 1. \langle \psi|\psi\rangle = 1. ⟨ ψ ∣ ψ ⟩ = 1.
After applying U U U ,
∣ ψ ′ ⟩ = U ∣ ψ ⟩ . |\psi'\rangle = U|\psi\rangle. ∣ ψ ′ ⟩ = U ∣ ψ ⟩ .
Then
⟨ ψ ′ ∣ ψ ′ ⟩ = ( U ∣ ψ ⟩ ) † ( U ∣ ψ ⟩ ) = ⟨ ψ ∣ U † U ∣ ψ ⟩ . \begin{aligned}
\langle \psi'|\psi'\rangle
&=
(U|\psi\rangle)^\dagger(U|\psi\rangle)\\
&=
\langle\psi|U^\dagger U|\psi\rangle.
\end{aligned} ⟨ ψ ′ ∣ ψ ′ ⟩ = ( U ∣ ψ ⟩ ) † ( U ∣ ψ ⟩) = ⟨ ψ ∣ U † U ∣ ψ ⟩ .
If
U † U = I , U^\dagger U = I, U † U = I ,
then
⟨ ψ ′ ∣ ψ ′ ⟩ = ⟨ ψ ∣ I ∣ ψ ⟩ = ⟨ ψ ∣ ψ ⟩ = 1. \begin{aligned}
\langle \psi'|\psi'\rangle
&=
\langle\psi|I|\psi\rangle\\
&=
\langle\psi|\psi\rangle\\
&=
1.
\end{aligned} ⟨ ψ ′ ∣ ψ ′ ⟩ = ⟨ ψ ∣ I ∣ ψ ⟩ = ⟨ ψ ∣ ψ ⟩ = 1.
Therefore,
∥ U ψ ∥ = ∥ ψ ∥ . \boxed{\|U\psi\|=\|\psi\|}. ∥ U ψ ∥ = ∥ ψ ∥ .
Simple English: A unitary gate changes the state without destroying its normalization.
The total probability remains 1 1 1 .
A stronger statement is that unitary operators preserve inner products:
⟨ U ϕ ∣ U ψ ⟩ = ⟨ ϕ ∣ U † U ∣ ψ ⟩ = ⟨ ϕ ∣ ψ ⟩ . \langle U\phi|U\psi\rangle
=
\langle\phi|U^\dagger U|\psi\rangle
=
\langle\phi|\psi\rangle. ⟨ U ϕ ∣ U ψ ⟩ = ⟨ ϕ ∣ U † U ∣ ψ ⟩ = ⟨ ϕ ∣ ψ ⟩ .
So the geometry of the state space is preserved.
2. Computational Basis
For a single qubit,
∣ 0 ⟩ = ( 1 0 ) , ∣ 1 ⟩ = ( 0 1 ) . |0\rangle =
\begin{pmatrix}
1\\
0
\end{pmatrix},
\qquad
|1\rangle =
\begin{pmatrix}
0\\
1
\end{pmatrix}. ∣0 ⟩ = ( 1 0 ) , ∣1 ⟩ = ( 0 1 ) .
A general qubit is
∣ ψ ⟩ = α ∣ 0 ⟩ + β ∣ 1 ⟩ , |\psi\rangle
=
\alpha|0\rangle+\beta|1\rangle, ∣ ψ ⟩ = α ∣0 ⟩ + β ∣1 ⟩ ,
with normalization
∣ α ∣ 2 + ∣ β ∣ 2 = 1. |\alpha|^2+|\beta|^2=1. ∣ α ∣ 2 + ∣ β ∣ 2 = 1.
3. Pauli X X X : Bit Flip
The Pauli X X X matrix is
X = ( 0 1 1 0 ) . \boxed{
X=
\begin{pmatrix}
0&1\\
1&0
\end{pmatrix}
}. X = ( 0 1 1 0 ) .
3.1 Derivation of X ∣ 0 ⟩ X|0\rangle X ∣0 ⟩
X ∣ 0 ⟩ = ( 0 1 1 0 ) ( 1 0 ) . X|0\rangle
=
\begin{pmatrix}
0&1\\
1&0
\end{pmatrix}
\begin{pmatrix}
1\\
0
\end{pmatrix}. X ∣0 ⟩ = ( 0 1 1 0 ) ( 1 0 ) .
Compute each entry:
0 ⋅ 1 + 1 ⋅ 0 = 0 , 0\cdot1+1\cdot0=0, 0 ⋅ 1 + 1 ⋅ 0 = 0 ,
1 ⋅ 1 + 0 ⋅ 0 = 1. 1\cdot1+0\cdot0=1. 1 ⋅ 1 + 0 ⋅ 0 = 1.
Therefore,
X ∣ 0 ⟩ = ( 0 1 ) = ∣ 1 ⟩ . X|0\rangle
=
\begin{pmatrix}
0\\
1
\end{pmatrix}
=
|1\rangle. X ∣0 ⟩ = ( 0 1 ) = ∣1 ⟩ .
Hence
X ∣ 0 ⟩ = ∣ 1 ⟩ . \boxed{X|0\rangle=|1\rangle}. X ∣0 ⟩ = ∣1 ⟩ .
Similarly,
X ∣ 1 ⟩ = ∣ 0 ⟩ . \boxed{X|1\rangle=|0\rangle}. X ∣1 ⟩ = ∣0 ⟩ .
Simple English: X X X exchanges the two computational-basis states.
It behaves like a classical NOT gate on ∣ 0 ⟩ |0\rangle ∣0 ⟩ and ∣ 1 ⟩ |1\rangle ∣1 ⟩ .
4. Pauli X X X on a Superposition
Let
∣ ψ ⟩ = α ∣ 0 ⟩ + β ∣ 1 ⟩ . |\psi\rangle
=
\alpha|0\rangle+\beta|1\rangle. ∣ ψ ⟩ = α ∣0 ⟩ + β ∣1 ⟩ .
Because X X X is linear,
X ∣ ψ ⟩ = X ( α ∣ 0 ⟩ + β ∣ 1 ⟩ ) = α X ∣ 0 ⟩ + β X ∣ 1 ⟩ = α ∣ 1 ⟩ + β ∣ 0 ⟩ . \begin{aligned}
X|\psi\rangle
&=
X(\alpha|0\rangle+\beta|1\rangle)\\
&=
\alpha X|0\rangle+\beta X|1\rangle\\
&=
\alpha|1\rangle+\beta|0\rangle.
\end{aligned} X ∣ ψ ⟩ = X ( α ∣0 ⟩ + β ∣1 ⟩) = α X ∣0 ⟩ + β X ∣1 ⟩ = α ∣1 ⟩ + β ∣0 ⟩ .
Reordering the basis terms,
X ∣ ψ ⟩ = β ∣ 0 ⟩ + α ∣ 1 ⟩ . \boxed{
X|\psi\rangle
=
\beta|0\rangle+\alpha|1\rangle
}. X ∣ ψ ⟩ = β ∣0 ⟩ + α ∣1 ⟩ .
In matrix form,
( 0 1 1 0 ) ( α β ) = ( β α ) . \begin{pmatrix}
0&1\\
1&0
\end{pmatrix}
\begin{pmatrix}
\alpha\\
\beta
\end{pmatrix}
=
\begin{pmatrix}
\beta\\
\alpha
\end{pmatrix}. ( 0 1 1 0 ) ( α β ) = ( β α ) .
Simple English: X X X swaps the amplitudes.
Worked Example
Take
∣ ψ ⟩ = 3 2 ∣ 0 ⟩ + 1 2 ∣ 1 ⟩ . |\psi\rangle
=
\frac{\sqrt3}{2}|0\rangle
+
\frac12|1\rangle. ∣ ψ ⟩ = 2 3 ∣0 ⟩ + 2 1 ∣1 ⟩ .
Before applying X X X ,
P ( 0 ) = ∣ 3 2 ∣ 2 = 3 4 , P(0)
=
\left|\frac{\sqrt3}{2}\right|^2
=
\frac34, P ( 0 ) = 2 3 2 = 4 3 ,
P ( 1 ) = ∣ 1 2 ∣ 2 = 1 4 . P(1)
=
\left|\frac12\right|^2
=
\frac14. P ( 1 ) = 2 1 2 = 4 1 .
After applying X X X ,
X ∣ ψ ⟩ = 1 2 ∣ 0 ⟩ + 3 2 ∣ 1 ⟩ . X|\psi\rangle
=
\frac12|0\rangle
+
\frac{\sqrt3}{2}|1\rangle. X ∣ ψ ⟩ = 2 1 ∣0 ⟩ + 2 3 ∣1 ⟩ .
Therefore,
P ( 0 ) = 1 4 , P ( 1 ) = 3 4 . P(0)=\frac14,
\qquad
P(1)=\frac34. P ( 0 ) = 4 1 , P ( 1 ) = 4 3 .
So the two computational-basis probabilities are exchanged.
5. Pauli Z Z Z : Phase Flip
The Pauli Z Z Z matrix is
Z = ( 1 0 0 − 1 ) . \boxed{
Z=
\begin{pmatrix}
1&0\\
0&-1
\end{pmatrix}
}. Z = ( 1 0 0 − 1 ) .
Its action on the computational basis is
Z ∣ 0 ⟩ = ∣ 0 ⟩ , Z|0\rangle=|0\rangle, Z ∣0 ⟩ = ∣0 ⟩ ,
Z ∣ 1 ⟩ = − ∣ 1 ⟩ . Z|1\rangle=-|1\rangle. Z ∣1 ⟩ = − ∣1 ⟩ .
For a general state,
∣ ψ ⟩ = α ∣ 0 ⟩ + β ∣ 1 ⟩ , |\psi\rangle
=
\alpha|0\rangle+\beta|1\rangle, ∣ ψ ⟩ = α ∣0 ⟩ + β ∣1 ⟩ ,
we obtain
Z ∣ ψ ⟩ = α ∣ 0 ⟩ − β ∣ 1 ⟩ . \boxed{
Z|\psi\rangle
=
\alpha|0\rangle-\beta|1\rangle
}. Z ∣ ψ ⟩ = α ∣0 ⟩ − β ∣1 ⟩ .
The magnitudes of the amplitudes do not change.
Only the phase of the ∣ 1 ⟩ |1\rangle ∣1 ⟩ component changes.
6. Why a Minus Sign Is a Phase
Euler's formula is
e i θ = cos θ + i sin θ . e^{i\theta}
=
\cos\theta+i\sin\theta. e i θ = cos θ + i sin θ .
For θ = π \theta=\pi θ = π ,
e i π = cos π + i sin π = − 1. e^{i\pi}
=
\cos\pi+i\sin\pi
=
-1. e iπ = cos π + i sin π = − 1.
Therefore,
− 1 = e i π . \boxed{-1=e^{i\pi}}. − 1 = e iπ .
So multiplying an amplitude by − 1 -1 − 1 is equivalent to rotating its complex phase by π \pi π .
Simple English: Z Z Z does not change the size of the amplitude.
It changes its phase.
7. Global Phase vs. Relative Phase
7.1 Global Phase
Consider
∣ ψ ⟩ ⟶ e i θ ∣ ψ ⟩ . |\psi\rangle
\longrightarrow
e^{i\theta}|\psi\rangle. ∣ ψ ⟩ ⟶ e i θ ∣ ψ ⟩ .
For any measurement state ∣ k ⟩ |k\rangle ∣ k ⟩ ,
P ( k ) = ∣ ⟨ k ∣ e i θ ψ ⟩ ∣ 2 = ∣ e i θ ⟨ k ∣ ψ ⟩ ∣ 2 = ∣ e i θ ∣ 2 ∣ ⟨ k ∣ ψ ⟩ ∣ 2 = ∣ ⟨ k ∣ ψ ⟩ ∣ 2 . \begin{aligned}
P(k)
&=
\left|
\langle k|e^{i\theta}\psi\rangle
\right|^2\\
&=
\left|
e^{i\theta}
\langle k|\psi\rangle
\right|^2\\
&=
|e^{i\theta}|^2
|\langle k|\psi\rangle|^2\\
&=
|\langle k|\psi\rangle|^2.
\end{aligned} P ( k ) = ⟨ k ∣ e i θ ψ ⟩ 2 = e i θ ⟨ k ∣ ψ ⟩ 2 = ∣ e i θ ∣ 2 ∣ ⟨ k ∣ ψ ⟩ ∣ 2 = ∣ ⟨ k ∣ ψ ⟩ ∣ 2 .
Since
∣ e i θ ∣ = 1 , |e^{i\theta}|=1, ∣ e i θ ∣ = 1 ,
the measurement probabilities are unchanged.
Thus
∣ ψ ⟩ ∼ e i θ ∣ ψ ⟩ \boxed{
|\psi\rangle
\sim
e^{i\theta}|\psi\rangle
} ∣ ψ ⟩ ∼ e i θ ∣ ψ ⟩
as physical pure states.
Simple English: If every amplitude rotates by the same phase, the physical state does not change.
7.2 Relative Phase
Compare
α ∣ 0 ⟩ + β ∣ 1 ⟩ \alpha|0\rangle+\beta|1\rangle α ∣0 ⟩ + β ∣1 ⟩
with
α ∣ 0 ⟩ − β ∣ 1 ⟩ . \alpha|0\rangle-\beta|1\rangle. α ∣0 ⟩ − β ∣1 ⟩ .
Only one component changes phase.
That changes the phase relation between the two amplitudes.
This relative phase can affect later interference.
8. Relative Phase Is Observable
Define
∣ + ⟩ = ∣ 0 ⟩ + ∣ 1 ⟩ 2 , |+\rangle
=
\frac{|0\rangle+|1\rangle}{\sqrt2}, ∣ + ⟩ = 2 ∣0 ⟩ + ∣1 ⟩ ,
∣ − ⟩ = ∣ 0 ⟩ − ∣ 1 ⟩ 2 . |-\rangle
=
\frac{|0\rangle-|1\rangle}{\sqrt2}. ∣ − ⟩ = 2 ∣0 ⟩ − ∣1 ⟩ .
Apply Z Z Z to ∣ + ⟩ |+\rangle ∣ + ⟩ :
Z ∣ + ⟩ = 1 2 ( Z ∣ 0 ⟩ + Z ∣ 1 ⟩ ) = 1 2 ( ∣ 0 ⟩ − ∣ 1 ⟩ ) = ∣ − ⟩ . \begin{aligned}
Z|+\rangle
&=
\frac1{\sqrt2}
\left(
Z|0\rangle+Z|1\rangle
\right)\\
&=
\frac1{\sqrt2}
\left(
|0\rangle-|1\rangle
\right)\\
&=
|-\rangle.
\end{aligned} Z ∣ + ⟩ = 2 1 ( Z ∣0 ⟩ + Z ∣1 ⟩ ) = 2 1 ( ∣0 ⟩ − ∣1 ⟩ ) = ∣ − ⟩ .
Therefore,
Z ∣ + ⟩ = ∣ − ⟩ . \boxed{Z|+\rangle=|-\rangle}. Z ∣ + ⟩ = ∣ − ⟩ .
Now compute the overlap:
⟨ + ∣ − ⟩ = 1 2 ( ⟨ 0 ∣ + ⟨ 1 ∣ ) ( ∣ 0 ⟩ − ∣ 1 ⟩ ) = 1 2 ( ⟨ 0 ∣ 0 ⟩ − ⟨ 0 ∣ 1 ⟩ + ⟨ 1 ∣ 0 ⟩ − ⟨ 1 ∣ 1 ⟩ ) . \begin{aligned}
\langle+|-\rangle
&=
\frac12
(\langle0|+\langle1|)
(|0\rangle-|1\rangle)\\
&=
\frac12
\left(
\langle0|0\rangle
-
\langle0|1\rangle
+
\langle1|0\rangle
-
\langle1|1\rangle
\right).
\end{aligned} ⟨ + ∣ − ⟩ = 2 1 (⟨ 0∣ + ⟨ 1∣ ) ( ∣0 ⟩ − ∣1 ⟩) = 2 1 ( ⟨ 0∣0 ⟩ − ⟨ 0∣1 ⟩ + ⟨ 1∣0 ⟩ − ⟨ 1∣1 ⟩ ) .
Using orthonormality,
⟨ 0 ∣ 0 ⟩ = 1 , ⟨ 1 ∣ 1 ⟩ = 1 , \langle0|0\rangle=1,
\qquad
\langle1|1\rangle=1, ⟨ 0∣0 ⟩ = 1 , ⟨ 1∣1 ⟩ = 1 ,
⟨ 0 ∣ 1 ⟩ = ⟨ 1 ∣ 0 ⟩ = 0. \langle0|1\rangle
=
\langle1|0\rangle
=
0. ⟨ 0∣1 ⟩ = ⟨ 1∣0 ⟩ = 0.
Hence
⟨ + ∣ − ⟩ = 1 2 ( 1 − 1 ) = 0. \langle+|-\rangle
=
\frac12(1-1)
=
0. ⟨ + ∣ − ⟩ = 2 1 ( 1 − 1 ) = 0.
Therefore,
⟨ + ∣ − ⟩ = 0 . \boxed{\langle+|-\rangle=0}. ⟨ + ∣ − ⟩ = 0 .
Simple English: Changing only one relative phase transformed ∣ + ⟩ |+\rangle ∣ + ⟩ into an orthogonal state ∣ − ⟩ |-\rangle ∣ − ⟩ .
Relative phase becomes observable through interference and basis changes.
9. Pauli Y Y Y : Bit Flip with Phase
The Pauli Y Y Y matrix is
Y = ( 0 − i i 0 ) . \boxed{
Y=
\begin{pmatrix}
0&-i\\
i&0
\end{pmatrix}
}. Y = ( 0 i − i 0 ) .
Its basis action is
Y ∣ 0 ⟩ = i ∣ 1 ⟩ , Y|0\rangle=i|1\rangle, Y ∣0 ⟩ = i ∣1 ⟩ ,
Y ∣ 1 ⟩ = − i ∣ 0 ⟩ . Y|1\rangle=-i|0\rangle. Y ∣1 ⟩ = − i ∣0 ⟩ .
So Y Y Y flips the basis state and adds a phase.
10. Deriving Y = i X Z Y=iXZ Y = i X Z
Compute
X Z = ( 0 1 1 0 ) ( 1 0 0 − 1 ) . XZ
=
\begin{pmatrix}
0&1\\
1&0
\end{pmatrix}
\begin{pmatrix}
1&0\\
0&-1
\end{pmatrix}. X Z = ( 0 1 1 0 ) ( 1 0 0 − 1 ) .
Therefore,
X Z = ( 0 − 1 1 0 ) . XZ
=
\begin{pmatrix}
0&-1\\
1&0
\end{pmatrix}. X Z = ( 0 1 − 1 0 ) .
Multiply by i i i :
i X Z = ( 0 − i i 0 ) . iXZ
=
\begin{pmatrix}
0&-i\\
i&0
\end{pmatrix}. i X Z = ( 0 i − i 0 ) .
Thus,
Y = i X Z . \boxed{Y=iXZ}. Y = i X Z .
Also,
Z X = − X Z , ZX
=
-
XZ, Z X = − X Z ,
so
X Z = − Z X . XZ=-ZX. X Z = − Z X .
Therefore,
Y = i X Z = − i Z X . \boxed{Y=iXZ=-iZX}. Y = i X Z = − i Z X .
Simple English: Y Y Y combines a bit flip and a phase change.
This also shows that X X X and Z Z Z do not commute.
11. Pauli Matrices Are Hermitian
A matrix A A A is Hermitian when
A † = A . A^\dagger=A. A † = A .
For X X X ,
X † = X . X^\dagger=X. X † = X .
For Z Z Z ,
Z † = Z . Z^\dagger=Z. Z † = Z .
For Y Y Y ,
Y = ( 0 − i i 0 ) . Y=
\begin{pmatrix}
0&-i\\
i&0
\end{pmatrix}. Y = ( 0 i − i 0 ) .
Take the complex conjugate:
Y ‾ = ( 0 i − i 0 ) . \overline{Y}
=
\begin{pmatrix}
0&i\\
-i&0
\end{pmatrix}. Y = ( 0 − i i 0 ) .
Then transpose:
Y † = ( 0 − i i 0 ) = Y . Y^\dagger
=
\begin{pmatrix}
0&-i\\
i&0
\end{pmatrix}
=
Y. Y † = ( 0 i − i 0 ) = Y .
Therefore,
X † = X , Y † = Y , Z † = Z . \boxed{
X^\dagger=X,
\qquad
Y^\dagger=Y,
\qquad
Z^\dagger=Z
}. X † = X , Y † = Y , Z † = Z .
Simple English: Because the Pauli matrices are Hermitian, they can represent observables.
12. Pauli Matrices Are Also Unitary
First,
X 2 = ( 0 1 1 0 ) 2 = I . X^2
=
\begin{pmatrix}
0&1\\
1&0
\end{pmatrix}^2
=
I. X 2 = ( 0 1 1 0 ) 2 = I .
Similarly,
Y 2 = I , Z 2 = I . Y^2=I,
\qquad
Z^2=I. Y 2 = I , Z 2 = I .
Since every Pauli matrix P P P is Hermitian,
P † = P . P^\dagger=P. P † = P .
Therefore,
P † P = P 2 = I . P^\dagger P
=
P^2
=
I. P † P = P 2 = I .
Hence
X , Y , Z are unitary . \boxed{
X,\;Y,\;Z
\text{ are unitary}
}. X , Y , Z are unitary .
Important: Hermitian does not imply unitary in general.
The Pauli matrices are unitary because they are Hermitian and satisfy P 2 = I P^2=I P 2 = I .
13. Why Pauli Eigenvalues Are ± 1 \pm1 ± 1
Let P P P be a Pauli operator.
Since
P 2 = I , P^2=I, P 2 = I ,
suppose
P ∣ ψ ⟩ = λ ∣ ψ ⟩ . P|\psi\rangle
=
\lambda|\psi\rangle. P ∣ ψ ⟩ = λ ∣ ψ ⟩ .
Apply P P P again:
P 2 ∣ ψ ⟩ = P λ ∣ ψ ⟩ . P^2|\psi\rangle
=
P\lambda|\psi\rangle. P 2 ∣ ψ ⟩ = P λ ∣ ψ ⟩ .
Because λ \lambda λ is a scalar,
P 2 ∣ ψ ⟩ = λ P ∣ ψ ⟩ . P^2|\psi\rangle
=
\lambda P|\psi\rangle. P 2 ∣ ψ ⟩ = λ P ∣ ψ ⟩ .
Using the eigenvalue equation again,
P 2 ∣ ψ ⟩ = λ 2 ∣ ψ ⟩ . P^2|\psi\rangle
=
\lambda^2|\psi\rangle. P 2 ∣ ψ ⟩ = λ 2 ∣ ψ ⟩ .
But
P 2 = I . P^2=I. P 2 = I .
Hence
∣ ψ ⟩ = λ 2 ∣ ψ ⟩ . |\psi\rangle
=
\lambda^2|\psi\rangle. ∣ ψ ⟩ = λ 2 ∣ ψ ⟩ .
Since an eigenvector is nonzero,
λ 2 = 1. \lambda^2=1. λ 2 = 1.
Therefore,
λ = ± 1 . \boxed{\lambda=\pm1}. λ = ± 1 .
Simple English: Because applying a Pauli operator twice gives the identity, its eigenvalues can only square to 1 1 1 .
14. The Z Z Z -Basis
We already know
Z ∣ 0 ⟩ = + ∣ 0 ⟩ , Z|0\rangle=+|0\rangle, Z ∣0 ⟩ = + ∣0 ⟩ ,
Z ∣ 1 ⟩ = − ∣ 1 ⟩ . Z|1\rangle=-|1\rangle. Z ∣1 ⟩ = − ∣1 ⟩ .
Therefore,
Z -basis = { ∣ 0 ⟩ , ∣ 1 ⟩ } . \boxed{
Z\text{-basis}
=
\{|0\rangle,|1\rangle\}
}. Z -basis = { ∣0 ⟩ , ∣1 ⟩} .
The corresponding eigenvalues are
+ 1 , − 1. +1,\quad -1. + 1 , − 1.
15. Deriving the X X X -Eigenbasis
Let
∣ v ⟩ = ( a b ) . |v\rangle
=
\begin{pmatrix}
a\\
b
\end{pmatrix}. ∣ v ⟩ = ( a b ) .
Solve
X ∣ v ⟩ = λ ∣ v ⟩ . X|v\rangle
=
\lambda|v\rangle. X ∣ v ⟩ = λ ∣ v ⟩ .
The left-hand side is
X ∣ v ⟩ = ( 0 1 1 0 ) ( a b ) = ( b a ) . X|v\rangle
=
\begin{pmatrix}
0&1\\
1&0
\end{pmatrix}
\begin{pmatrix}
a\\
b
\end{pmatrix}
=
\begin{pmatrix}
b\\
a
\end{pmatrix}. X ∣ v ⟩ = ( 0 1 1 0 ) ( a b ) = ( b a ) .
The right-hand side is
λ ∣ v ⟩ = ( λ a λ b ) . \lambda|v\rangle
=
\begin{pmatrix}
\lambda a\\
\lambda b
\end{pmatrix}. λ ∣ v ⟩ = ( λa λb ) .
Therefore,
b = λ a , a = λ b . b=\lambda a,
\qquad
a=\lambda b. b = λa , a = λb .
15.1 Eigenvalue + 1 +1 + 1
If
λ = 1 , \lambda=1, λ = 1 ,
then
b = a . b=a. b = a .
So an eigenvector is
( 1 1 ) . \begin{pmatrix}
1\\
1
\end{pmatrix}. ( 1 1 ) .
Its norm is
1 2 + 1 2 = 2 . \sqrt{1^2+1^2}
=
\sqrt2. 1 2 + 1 2 = 2 .
Therefore the normalized eigenvector is
∣ + ⟩ = 1 2 ( 1 1 ) = ∣ 0 ⟩ + ∣ 1 ⟩ 2 . \boxed{
|+\rangle
=
\frac1{\sqrt2}
\begin{pmatrix}
1\\
1
\end{pmatrix}
=
\frac{|0\rangle+|1\rangle}{\sqrt2}
}. ∣ + ⟩ = 2 1 ( 1 1 ) = 2 ∣0 ⟩ + ∣1 ⟩ .
15.2 Eigenvalue − 1 -1 − 1
If
λ = − 1 , \lambda=-1, λ = − 1 ,
then
b = − a . b=-a. b = − a .
A normalized eigenvector is
∣ − ⟩ = 1 2 ( 1 − 1 ) = ∣ 0 ⟩ − ∣ 1 ⟩ 2 . \boxed{
|-\rangle
=
\frac1{\sqrt2}
\begin{pmatrix}
1\\
-1
\end{pmatrix}
=
\frac{|0\rangle-|1\rangle}{\sqrt2}
}. ∣ − ⟩ = 2 1 ( 1 − 1 ) = 2 ∣0 ⟩ − ∣1 ⟩ .
Thus,
X ∣ + ⟩ = + ∣ + ⟩ , \boxed{
X|+\rangle=+|+\rangle
}, X ∣ + ⟩ = + ∣ + ⟩ ,
X ∣ − ⟩ = − ∣ − ⟩ . \boxed{
X|-\rangle=-|-\rangle
}. X ∣ − ⟩ = − ∣ − ⟩ .
Simple English: The X X X -basis is the eigenbasis of the Pauli X X X operator.
16. Hadamard Gate
The Hadamard gate is
H = 1 2 ( 1 1 1 − 1 ) . \boxed{
H
=
\frac1{\sqrt2}
\begin{pmatrix}
1&1\\
1&-1
\end{pmatrix}
}. H = 2 1 ( 1 1 1 − 1 ) .
Apply it to ∣ 0 ⟩ |0\rangle ∣0 ⟩ :
H ∣ 0 ⟩ = 1 2 ( 1 1 1 − 1 ) ( 1 0 ) = 1 2 ( 1 1 ) = ∣ + ⟩ . \begin{aligned}
H|0\rangle
&=
\frac1{\sqrt2}
\begin{pmatrix}
1&1\\
1&-1
\end{pmatrix}
\begin{pmatrix}
1\\
0
\end{pmatrix}\\
&=
\frac1{\sqrt2}
\begin{pmatrix}
1\\
1
\end{pmatrix}\\
&=
|+\rangle.
\end{aligned} H ∣0 ⟩ = 2 1 ( 1 1 1 − 1 ) ( 1 0 ) = 2 1 ( 1 1 ) = ∣ + ⟩ .
So
H ∣ 0 ⟩ = ∣ + ⟩ . \boxed{H|0\rangle=|+\rangle}. H ∣0 ⟩ = ∣ + ⟩ .
Similarly,
H ∣ 1 ⟩ = ∣ − ⟩ . \boxed{H|1\rangle=|-\rangle}. H ∣1 ⟩ = ∣ − ⟩ .
Therefore,
H : Z -basis ⟷ X -basis . \boxed{
H:
Z\text{-basis}
\longleftrightarrow
X\text{-basis}
}. H : Z -basis ⟷ X -basis .
Simple English: Hadamard is more precisely a basis-change gate than merely a “superposition maker.”
17. Proof That H 2 = I H^2=I H 2 = I
Compute
H 2 = 1 2 ( 1 1 1 − 1 ) ( 1 1 1 − 1 ) . H^2
=
\frac12
\begin{pmatrix}
1&1\\
1&-1
\end{pmatrix}
\begin{pmatrix}
1&1\\
1&-1
\end{pmatrix}. H 2 = 2 1 ( 1 1 1 − 1 ) ( 1 1 1 − 1 ) .
The entries are
1 ⋅ 1 + 1 ⋅ 1 = 2 , 1\cdot1+1\cdot1=2, 1 ⋅ 1 + 1 ⋅ 1 = 2 ,
1 ⋅ 1 + 1 ⋅ ( − 1 ) = 0 , 1\cdot1+1\cdot(-1)=0, 1 ⋅ 1 + 1 ⋅ ( − 1 ) = 0 ,
1 ⋅ 1 + ( − 1 ) ⋅ 1 = 0 , 1\cdot1+(-1)\cdot1=0, 1 ⋅ 1 + ( − 1 ) ⋅ 1 = 0 ,
1 ⋅ 1 + ( − 1 ) ( − 1 ) = 2. 1\cdot1+(-1)(-1)=2. 1 ⋅ 1 + ( − 1 ) ( − 1 ) = 2.
Therefore,
H 2 = 1 2 ( 2 0 0 2 ) = I . H^2
=
\frac12
\begin{pmatrix}
2&0\\
0&2
\end{pmatrix}
=
I. H 2 = 2 1 ( 2 0 0 2 ) = I .
Hence
H 2 = I , \boxed{H^2=I}, H 2 = I ,
and therefore
H − 1 = H . \boxed{H^{-1}=H}. H − 1 = H .
So
H ∣ + ⟩ = ∣ 0 ⟩ , H|+\rangle=|0\rangle, H ∣ + ⟩ = ∣0 ⟩ ,
H ∣ − ⟩ = ∣ 1 ⟩ . H|-\rangle=|1\rangle. H ∣ − ⟩ = ∣1 ⟩ .
18. Measuring in the X X X -Basis
Suppose
∣ ψ ⟩ = α ∣ + ⟩ + β ∣ − ⟩ . |\psi\rangle
=
\alpha|+\rangle+\beta|-\rangle. ∣ ψ ⟩ = α ∣ + ⟩ + β ∣ − ⟩ .
Apply H H H :
H ∣ ψ ⟩ = α H ∣ + ⟩ + β H ∣ − ⟩ = α ∣ 0 ⟩ + β ∣ 1 ⟩ . \begin{aligned}
H|\psi\rangle
&=
\alpha H|+\rangle+\beta H|-\rangle\\
&=
\alpha|0\rangle+\beta|1\rangle.
\end{aligned} H ∣ ψ ⟩ = α H ∣ + ⟩ + β H ∣ − ⟩ = α ∣0 ⟩ + β ∣1 ⟩ .
Now measure in the computational basis.
Therefore,
X -basis measurement = H + Z -basis measurement . \boxed{
X\text{-basis measurement}
=
H
+
Z\text{-basis measurement}
}. X -basis measurement = H + Z -basis measurement .
Simple English: Rotate the X X X -basis into the computational basis, then perform the usual measurement.
Worked Example
Take
∣ ψ ⟩ = 3 2 ∣ + ⟩ + 1 2 ∣ − ⟩ . |\psi\rangle
=
\frac{\sqrt3}{2}|+\rangle
+
\frac12|-\rangle. ∣ ψ ⟩ = 2 3 ∣ + ⟩ + 2 1 ∣ − ⟩ .
Applying H H H ,
H ∣ ψ ⟩ = 3 2 ∣ 0 ⟩ + 1 2 ∣ 1 ⟩ . H|\psi\rangle
=
\frac{\sqrt3}{2}|0\rangle
+
\frac12|1\rangle. H ∣ ψ ⟩ = 2 3 ∣0 ⟩ + 2 1 ∣1 ⟩ .
Therefore,
P ( + ) = 3 4 , P ( − ) = 1 4 . P(+)=\frac34,
\qquad
P(-)=\frac14. P ( + ) = 4 3 , P ( − ) = 4 1 .
The X X X -basis probabilities become ordinary computational-basis probabilities after H H H .
19. Phase Gate S S S
The S S S gate is
S = ( 1 0 0 i ) . \boxed{
S=
\begin{pmatrix}
1&0\\
0&i
\end{pmatrix}
}. S = ( 1 0 0 i ) .
Since
i = e i π / 2 , i=e^{i\pi/2}, i = e iπ /2 ,
we have
S ∣ 0 ⟩ = ∣ 0 ⟩ , S|0\rangle=|0\rangle, S ∣0 ⟩ = ∣0 ⟩ ,
S ∣ 1 ⟩ = i ∣ 1 ⟩ . S|1\rangle=i|1\rangle. S ∣1 ⟩ = i ∣1 ⟩ .
Therefore,
S ( α ∣ 0 ⟩ + β ∣ 1 ⟩ ) = α ∣ 0 ⟩ + i β ∣ 1 ⟩ . S(\alpha|0\rangle+\beta|1\rangle)
=
\alpha|0\rangle+i\beta|1\rangle. S ( α ∣0 ⟩ + β ∣1 ⟩) = α ∣0 ⟩ + i β ∣1 ⟩ .
So S S S changes the relative phase by
π / 2 . \boxed{\pi/2}. π /2 .
20. T T T Gate
The T T T gate is
T = ( 1 0 0 e i π / 4 ) . \boxed{
T=
\begin{pmatrix}
1&0\\
0&e^{i\pi/4}
\end{pmatrix}
}. T = ( 1 0 0 e iπ /4 ) .
Thus,
T ∣ 0 ⟩ = ∣ 0 ⟩ , T|0\rangle=|0\rangle, T ∣0 ⟩ = ∣0 ⟩ ,
T ∣ 1 ⟩ = e i π / 4 ∣ 1 ⟩ . T|1\rangle=e^{i\pi/4}|1\rangle. T ∣1 ⟩ = e iπ /4 ∣1 ⟩ .
For a general state,
T ( α ∣ 0 ⟩ + β ∣ 1 ⟩ ) = α ∣ 0 ⟩ + e i π / 4 β ∣ 1 ⟩ . T(
\alpha|0\rangle+\beta|1\rangle
)
=
\alpha|0\rangle
+
e^{i\pi/4}\beta|1\rangle. T ( α ∣0 ⟩ + β ∣1 ⟩) = α ∣0 ⟩ + e iπ /4 β ∣1 ⟩ .
So the relative phase changes by
π / 4 . \boxed{\pi/4}. π /4 .
The phase gates satisfy
T 2 = S , \boxed{T^2=S}, T 2 = S ,
because
( e i π / 4 ) 2 = e i π / 2 = i . \left(e^{i\pi/4}\right)^2
=
e^{i\pi/2}
=
i. ( e iπ /4 ) 2 = e iπ /2 = i .
Similarly,
S 2 = Z , \boxed{S^2=Z}, S 2 = Z ,
because
i 2 = − 1. i^2=-1. i 2 = − 1.
21. Gate Composition
Suppose U 1 U_1 U 1 acts first:
∣ ψ 1 ⟩ = U 1 ∣ ψ ⟩ . |\psi_1\rangle
=
U_1|\psi\rangle. ∣ ψ 1 ⟩ = U 1 ∣ ψ ⟩ .
Then U 2 U_2 U 2 acts:
∣ ψ 2 ⟩ = U 2 ∣ ψ 1 ⟩ . |\psi_2\rangle
=
U_2|\psi_1\rangle. ∣ ψ 2 ⟩ = U 2 ∣ ψ 1 ⟩ .
Substitute the first equation:
∣ ψ 2 ⟩ = U 2 ( U 1 ∣ ψ ⟩ ) . |\psi_2\rangle
=
U_2(U_1|\psi\rangle). ∣ ψ 2 ⟩ = U 2 ( U 1 ∣ ψ ⟩) .
By associativity,
∣ ψ 2 ⟩ = ( U 2 U 1 ) ∣ ψ ⟩ . |\psi_2\rangle
=
(U_2U_1)|\psi\rangle. ∣ ψ 2 ⟩ = ( U 2 U 1 ) ∣ ψ ⟩ .
Therefore,
U t o t a l = U 2 U 1 . \boxed{
U_{\mathrm{total}}
=
U_2U_1
}. U total = U 2 U 1 .
Simple English: If U 1 U_1 U 1 happens first and U 2 U_2 U 2 happens second, the matrix product is U 2 U 1 U_2U_1 U 2 U 1 .
The rightmost operator acts first.
22. Gate Order Matters: H Z ≠ Z H HZ\neq ZH H Z = Z H
Compute
H Z = 1 2 ( 1 1 1 − 1 ) ( 1 0 0 − 1 ) . HZ
=
\frac1{\sqrt2}
\begin{pmatrix}
1&1\\
1&-1
\end{pmatrix}
\begin{pmatrix}
1&0\\
0&-1
\end{pmatrix}. H Z = 2 1 ( 1 1 1 − 1 ) ( 1 0 0 − 1 ) .
Therefore,
H Z = 1 2 ( 1 − 1 1 1 ) . \boxed{
HZ
=
\frac1{\sqrt2}
\begin{pmatrix}
1&-1\\
1&1
\end{pmatrix}
}. H Z = 2 1 ( 1 1 − 1 1 ) .
Now reverse the order:
Z H = ( 1 0 0 − 1 ) 1 2 ( 1 1 1 − 1 ) . ZH
=
\begin{pmatrix}
1&0\\
0&-1
\end{pmatrix}
\frac1{\sqrt2}
\begin{pmatrix}
1&1\\
1&-1
\end{pmatrix}. Z H = ( 1 0 0 − 1 ) 2 1 ( 1 1 1 − 1 ) .
Hence
Z H = 1 2 ( 1 1 − 1 1 ) . \boxed{
ZH
=
\frac1{\sqrt2}
\begin{pmatrix}
1&1\\
-1&1
\end{pmatrix}
}. Z H = 2 1 ( 1 − 1 1 1 ) .
Thus,
H Z ≠ Z H . \boxed{HZ\neq ZH}. H Z = Z H .
State Example
Start from ∣ 0 ⟩ |0\rangle ∣0 ⟩ .
First Z Z Z , then H H H :
H Z ∣ 0 ⟩ = H ∣ 0 ⟩ = ∣ + ⟩ . HZ|0\rangle
=
H|0\rangle
=
|+\rangle. H Z ∣0 ⟩ = H ∣0 ⟩ = ∣ + ⟩ .
First H H H , then Z Z Z :
Z H ∣ 0 ⟩ = Z ∣ + ⟩ = ∣ − ⟩ . ZH|0\rangle
=
Z|+\rangle
=
|-\rangle. Z H ∣0 ⟩ = Z ∣ + ⟩ = ∣ − ⟩ .
Therefore,
H Z ∣ 0 ⟩ = ∣ + ⟩ , \boxed{
HZ|0\rangle=|+\rangle
}, H Z ∣0 ⟩ = ∣ + ⟩ ,
while
Z H ∣ 0 ⟩ = ∣ − ⟩ . \boxed{
ZH|0\rangle=|-\rangle
}. Z H ∣0 ⟩ = ∣ − ⟩ .
Simple English: Quantum gate order is part of the computation.
Swapping two gates can produce a completely different state.
23. Two-Qubit State Space
For two qubits,
H = C 2 ⊗ C 2 . \mathcal H
=
\mathbb C^2\otimes\mathbb C^2. H = C 2 ⊗ C 2 .
The computational basis is
∣ 00 ⟩ , ∣ 01 ⟩ , ∣ 10 ⟩ , ∣ 11 ⟩ . |00\rangle,\quad
|01\rangle,\quad
|10\rangle,\quad
|11\rangle. ∣00 ⟩ , ∣01 ⟩ , ∣10 ⟩ , ∣11 ⟩ .
For product states,
∣ a ⟩ ⊗ ∣ b ⟩ |a\rangle\otimes|b\rangle ∣ a ⟩ ⊗ ∣ b ⟩
describes the combined two-qubit system.
24. Applying a Gate to Only One Qubit
The tensor-product rule is
( A ⊗ B ) ( ∣ a ⟩ ⊗ ∣ b ⟩ ) = A ∣ a ⟩ ⊗ B ∣ b ⟩ . \boxed{
(A\otimes B)
(|a\rangle\otimes|b\rangle)
=
A|a\rangle\otimes B|b\rangle
}. ( A ⊗ B ) ( ∣ a ⟩ ⊗ ∣ b ⟩) = A ∣ a ⟩ ⊗ B ∣ b ⟩ .
To apply X X X only to the first qubit,
X ⊗ I . X\otimes I. X ⊗ I .
For example,
( X ⊗ I ) ∣ 00 ⟩ = X ∣ 0 ⟩ ⊗ I ∣ 0 ⟩ = ∣ 1 ⟩ ⊗ ∣ 0 ⟩ = ∣ 10 ⟩ . \begin{aligned}
(X\otimes I)|00\rangle
&=
X|0\rangle\otimes I|0\rangle\\
&=
|1\rangle\otimes|0\rangle\\
&=
|10\rangle.
\end{aligned} ( X ⊗ I ) ∣00 ⟩ = X ∣0 ⟩ ⊗ I ∣0 ⟩ = ∣1 ⟩ ⊗ ∣0 ⟩ = ∣10 ⟩ .
Therefore,
( X ⊗ I ) ∣ 00 ⟩ = ∣ 10 ⟩ . \boxed{
(X\otimes I)|00\rangle
=
|10\rangle
}. ( X ⊗ I ) ∣00 ⟩ = ∣10 ⟩ .
25. Deriving the Matrix X ⊗ I X\otimes I X ⊗ I
We have
X = ( 0 1 1 0 ) , I = ( 1 0 0 1 ) . X=
\begin{pmatrix}
0&1\\
1&0
\end{pmatrix},
\qquad
I=
\begin{pmatrix}
1&0\\
0&1
\end{pmatrix}. X = ( 0 1 1 0 ) , I = ( 1 0 0 1 ) .
By the Kronecker product,
X ⊗ I = ( 0 I 1 I 1 I 0 I ) . X\otimes I
=
\begin{pmatrix}
0I&1I\\
1I&0I
\end{pmatrix}. X ⊗ I = ( 0 I 1 I 1 I 0 I ) .
Therefore,
X ⊗ I = ( 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 0 ) . \boxed{
X\otimes I
=
\begin{pmatrix}
0&0&1&0\\
0&0&0&1\\
1&0&0&0\\
0&1&0&0
\end{pmatrix}
}. X ⊗ I = 0 0 1 0 0 0 0 1 1 0 0 0 0 1 0 0 .
Simple English: Tensor products let us extend a local one-qubit operation to the full multi-qubit state space.
26. Controlled-NOT Gate
CNOT has
a control qubit,
a target qubit.
Its basis action is
∣ 00 ⟩ → ∣ 00 ⟩ , |00\rangle\rightarrow|00\rangle, ∣00 ⟩ → ∣00 ⟩ ,
∣ 01 ⟩ → ∣ 01 ⟩ , |01\rangle\rightarrow|01\rangle, ∣01 ⟩ → ∣01 ⟩ ,
∣ 10 ⟩ → ∣ 11 ⟩ , |10\rangle\rightarrow|11\rangle, ∣10 ⟩ → ∣11 ⟩ ,
∣ 11 ⟩ → ∣ 10 ⟩ . |11\rangle\rightarrow|10\rangle. ∣11 ⟩ → ∣10 ⟩ .
If the control is c c c and the target is t t t ,
∣ c , t ⟩ ⟶ ∣ c , t ⊕ c ⟩ , \boxed{
|c,t\rangle
\longrightarrow
|c,t\oplus c\rangle
}, ∣ c , t ⟩ ⟶ ∣ c , t ⊕ c ⟩ ,
where ⊕ \oplus ⊕ is XOR.
Simple English: If the control is 1 1 1 , flip the target.
If the control is 0 0 0 , leave the target unchanged.
27. Building the CNOT Matrix from Basis Images
Use the ordered basis
∣ 00 ⟩ , ∣ 01 ⟩ , ∣ 10 ⟩ , ∣ 11 ⟩ . |00\rangle,\;
|01\rangle,\;
|10\rangle,\;
|11\rangle. ∣00 ⟩ , ∣01 ⟩ , ∣10 ⟩ , ∣11 ⟩ .
A linear operator is determined by its action on the basis.
For a matrix M M M ,
M e j = m j , Me_j=m_j, M e j = m j ,
where m j m_j m j is the j j j -th column.
Therefore:
∣ 00 ⟩ → ∣ 00 ⟩ |00\rangle\rightarrow|00\rangle ∣00 ⟩ → ∣00 ⟩
gives column 1,
( 1 0 0 0 ) . \begin{pmatrix}
1\\0\\0\\0
\end{pmatrix}. 1 0 0 0 .
∣ 01 ⟩ → ∣ 01 ⟩ |01\rangle\rightarrow|01\rangle ∣01 ⟩ → ∣01 ⟩
gives column 2,
( 0 1 0 0 ) . \begin{pmatrix}
0\\1\\0\\0
\end{pmatrix}. 0 1 0 0 .
∣ 10 ⟩ → ∣ 11 ⟩ |10\rangle\rightarrow|11\rangle ∣10 ⟩ → ∣11 ⟩
gives column 3,
( 0 0 0 1 ) . \begin{pmatrix}
0\\0\\0\\1
\end{pmatrix}. 0 0 0 1 .
∣ 11 ⟩ → ∣ 10 ⟩ |11\rangle\rightarrow|10\rangle ∣11 ⟩ → ∣10 ⟩
gives column 4,
( 0 0 1 0 ) . \begin{pmatrix}
0\\0\\1\\0
\end{pmatrix}. 0 0 1 0 .
Thus,
CNOT = ( 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 ) . \boxed{
\operatorname{CNOT}
=
\begin{pmatrix}
1&0&0&0\\
0&1&0&0\\
0&0&0&1\\
0&0&1&0
\end{pmatrix}
}. CNOT = 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 .
28. Why CNOT Is Unitary
The columns of the CNOT matrix are
( 1 0 0 0 ) , ( 0 1 0 0 ) , ( 0 0 0 1 ) , ( 0 0 1 0 ) . \begin{pmatrix}1\\0\\0\\0\end{pmatrix},
\quad
\begin{pmatrix}0\\1\\0\\0\end{pmatrix},
\quad
\begin{pmatrix}0\\0\\0\\1\end{pmatrix},
\quad
\begin{pmatrix}0\\0\\1\\0\end{pmatrix}. 1 0 0 0 , 0 1 0 0 , 0 0 0 1 , 0 0 1 0 .
These form an orthonormal basis.
Therefore,
CNOT † CNOT = I . \boxed{
\operatorname{CNOT}^\dagger
\operatorname{CNOT}
=
I
}. CNOT † CNOT = I .
Hence CNOT is unitary.
29. Why CNOT 2 = I \operatorname{CNOT}^2=I CNOT 2 = I
Apply CNOT twice.
For example,
∣ 10 ⟩ → ∣ 11 ⟩ → ∣ 10 ⟩ . |10\rangle
\rightarrow
|11\rangle
\rightarrow
|10\rangle. ∣10 ⟩ → ∣11 ⟩ → ∣10 ⟩ .
Similarly, every computational-basis state returns to itself after two applications.
Therefore,
CNOT 2 = I . \boxed{
\operatorname{CNOT}^2=I
}. CNOT 2 = I .
Hence,
CNOT − 1 = CNOT . \boxed{
\operatorname{CNOT}^{-1}
=
\operatorname{CNOT}
}. CNOT − 1 = CNOT .
30. The Bell Circuit
Start from
∣ ψ 0 ⟩ = ∣ 00 ⟩ . |\psi_0\rangle
=
|00\rangle. ∣ ψ 0 ⟩ = ∣00 ⟩ .
The circuit is
Apply H H H to the first qubit.
Apply CNOT.
30.1 Step 1: Apply H ⊗ I H\otimes I H ⊗ I
( H ⊗ I ) ∣ 00 ⟩ . (H\otimes I)|00\rangle. ( H ⊗ I ) ∣00 ⟩ .
Since
∣ 00 ⟩ = ∣ 0 ⟩ ⊗ ∣ 0 ⟩ , |00\rangle
=
|0\rangle\otimes|0\rangle, ∣00 ⟩ = ∣0 ⟩ ⊗ ∣0 ⟩ ,
we have
( H ⊗ I ) ( ∣ 0 ⟩ ⊗ ∣ 0 ⟩ ) = H ∣ 0 ⟩ ⊗ I ∣ 0 ⟩ = ∣ 0 ⟩ + ∣ 1 ⟩ 2 ⊗ ∣ 0 ⟩ . \begin{aligned}
(H\otimes I)
(|0\rangle\otimes|0\rangle)
&=
H|0\rangle\otimes I|0\rangle\\
&=
\frac{|0\rangle+|1\rangle}{\sqrt2}
\otimes
|0\rangle.
\end{aligned} ( H ⊗ I ) ( ∣0 ⟩ ⊗ ∣0 ⟩) = H ∣0 ⟩ ⊗ I ∣0 ⟩ = 2 ∣0 ⟩ + ∣1 ⟩ ⊗ ∣0 ⟩ .
Distribute the tensor product:
∣ ψ 1 ⟩ = 1 2 ( ∣ 0 ⟩ ⊗ ∣ 0 ⟩ + ∣ 1 ⟩ ⊗ ∣ 0 ⟩ ) = ∣ 00 ⟩ + ∣ 10 ⟩ 2 . \begin{aligned}
|\psi_1\rangle
&=
\frac1{\sqrt2}
\left(
|0\rangle\otimes|0\rangle
+
|1\rangle\otimes|0\rangle
\right)\\
&=
\boxed{
\frac{|00\rangle+|10\rangle}{\sqrt2}
}.
\end{aligned} ∣ ψ 1 ⟩ = 2 1 ( ∣0 ⟩ ⊗ ∣0 ⟩ + ∣1 ⟩ ⊗ ∣0 ⟩ ) = 2 ∣00 ⟩ + ∣10 ⟩ .
This is still a product state:
∣ ψ 1 ⟩ = ∣ + ⟩ ⊗ ∣ 0 ⟩ . \boxed{
|\psi_1\rangle
=
|+\rangle\otimes|0\rangle
}. ∣ ψ 1 ⟩ = ∣ + ⟩ ⊗ ∣0 ⟩ .
Simple English: Hadamard creates a superposition on the first qubit, but the two qubits are still separable.
30.2 Step 2: Apply CNOT
Now apply CNOT:
CNOT ∣ 00 ⟩ + ∣ 10 ⟩ 2 . \operatorname{CNOT}
\frac{|00\rangle+|10\rangle}{\sqrt2}. CNOT 2 ∣00 ⟩ + ∣10 ⟩ .
By linearity,
∣ ψ 2 ⟩ = 1 2 ( CNOT ∣ 00 ⟩ + CNOT ∣ 10 ⟩ ) = 1 2 ( ∣ 00 ⟩ + ∣ 11 ⟩ ) . \begin{aligned}
|\psi_2\rangle
&=
\frac1{\sqrt2}
\left(
\operatorname{CNOT}|00\rangle
+
\operatorname{CNOT}|10\rangle
\right)\\
&=
\frac1{\sqrt2}
\left(
|00\rangle+|11\rangle
\right).
\end{aligned} ∣ ψ 2 ⟩ = 2 1 ( CNOT ∣00 ⟩ + CNOT ∣10 ⟩ ) = 2 1 ( ∣00 ⟩ + ∣11 ⟩ ) .
Therefore,
∣ Φ + ⟩ = ∣ 00 ⟩ + ∣ 11 ⟩ 2 . \boxed{
|\Phi^+\rangle
=
\frac{|00\rangle+|11\rangle}{\sqrt2}
}. ∣ Φ + ⟩ = 2 ∣00 ⟩ + ∣11 ⟩ .
This is the Bell state ∣ Φ + ⟩ |\Phi^+\rangle ∣ Φ + ⟩ .
The complete state evolution is
∣ 00 ⟩ → H ⊗ I ∣ 00 ⟩ + ∣ 10 ⟩ 2 → C N O T ∣ 00 ⟩ + ∣ 11 ⟩ 2 . \boxed{
|00\rangle
\xrightarrow{H\otimes I}
\frac{|00\rangle+|10\rangle}{\sqrt2}
\xrightarrow{\mathrm{CNOT}}
\frac{|00\rangle+|11\rangle}{\sqrt2}
}. ∣00 ⟩ H ⊗ I 2 ∣00 ⟩ + ∣10 ⟩ CNOT 2 ∣00 ⟩ + ∣11 ⟩ .
Simple English: A local Hadamard creates a superposition.
CNOT then correlates the two computational-basis branches.
31. Numerical View of the Bell Circuit
Using basis order
∣ 00 ⟩ , ∣ 01 ⟩ , ∣ 10 ⟩ , ∣ 11 ⟩ , |00\rangle,\;
|01\rangle,\;
|10\rangle,\;
|11\rangle, ∣00 ⟩ , ∣01 ⟩ , ∣10 ⟩ , ∣11 ⟩ ,
the initial amplitude vector is
∣ ψ 0 ⟩ = ( 1 0 0 0 ) . |\psi_0\rangle
=
\begin{pmatrix}
1\\
0\\
0\\
0
\end{pmatrix}. ∣ ψ 0 ⟩ = 1 0 0 0 .
After H ⊗ I H\otimes I H ⊗ I ,
∣ ψ 1 ⟩ = ( 1 / 2 0 1 / 2 0 ) . |\psi_1\rangle
=
\begin{pmatrix}
1/\sqrt2\\
0\\
1/\sqrt2\\
0
\end{pmatrix}. ∣ ψ 1 ⟩ = 1/ 2 0 1/ 2 0 .
After CNOT,
∣ ψ 2 ⟩ = ( 1 / 2 0 0 1 / 2 ) . |\psi_2\rangle
=
\begin{pmatrix}
1/\sqrt2\\
0\\
0\\
1/\sqrt2
\end{pmatrix}. ∣ ψ 2 ⟩ = 1/ 2 0 0 1/ 2 .
Therefore,
P ( 00 ) = 1 2 , P(00)=\frac12, P ( 00 ) = 2 1 ,
P ( 11 ) = 1 2 , P(11)=\frac12, P ( 11 ) = 2 1 ,
and
P ( 01 ) = P ( 10 ) = 0. P(01)=P(10)=0. P ( 01 ) = P ( 10 ) = 0.
Simple English: The final state has probability only on 00 00 00 and 11 11 11 , with equal magnitude amplitudes.
32. What Has Changed?
Initially,
∣ 00 ⟩ = ∣ 0 ⟩ ⊗ ∣ 0 ⟩ |00\rangle
=
|0\rangle\otimes|0\rangle ∣00 ⟩ = ∣0 ⟩ ⊗ ∣0 ⟩
is clearly a product state.
After Hadamard,
∣ 00 ⟩ + ∣ 10 ⟩ 2 = ( ∣ 0 ⟩ + ∣ 1 ⟩ 2 ) ⊗ ∣ 0 ⟩ , \frac{|00\rangle+|10\rangle}{\sqrt2}
=
\left(
\frac{|0\rangle+|1\rangle}{\sqrt2}
\right)
\otimes
|0\rangle, 2 ∣00 ⟩ + ∣10 ⟩ = ( 2 ∣0 ⟩ + ∣1 ⟩ ) ⊗ ∣0 ⟩ ,
so the state is still separable.
After CNOT,
∣ Φ + ⟩ = ∣ 00 ⟩ + ∣ 11 ⟩ 2 . \boxed{
|\Phi^+\rangle
=
\frac{|00\rangle+|11\rangle}{\sqrt2}
}. ∣ Φ + ⟩ = 2 ∣00 ⟩ + ∣11 ⟩ .
This state is the Bell state that motivates the next topic: entanglement .
Simple English: The important transition is
product state → \rightarrow → local superposition → \rightarrow → Bell state.
A formal proof that this Bell state cannot be written as a product state belongs naturally to the next discussion on entanglement.
33. Summary of the Main Mathematical Results
X ∣ 0 ⟩ = ∣ 1 ⟩ , X ∣ 1 ⟩ = ∣ 0 ⟩ \boxed{
X|0\rangle=|1\rangle,
\qquad
X|1\rangle=|0\rangle
} X ∣0 ⟩ = ∣1 ⟩ , X ∣1 ⟩ = ∣0 ⟩
Z ∣ + ⟩ = ∣ − ⟩ \boxed{
Z|+\rangle=|-\rangle
} Z ∣ + ⟩ = ∣ − ⟩
X 2 = Y 2 = Z 2 = I \boxed{
X^2=Y^2=Z^2=I
} X 2 = Y 2 = Z 2 = I
P 2 = I ⇒ λ = ± 1 \boxed{
P^2=I
\Rightarrow
\lambda=\pm1
} P 2 = I ⇒ λ = ± 1
∣ + ⟩ = ∣ 0 ⟩ + ∣ 1 ⟩ 2 , ∣ − ⟩ = ∣ 0 ⟩ − ∣ 1 ⟩ 2 \boxed{
|+\rangle
=
\frac{|0\rangle+|1\rangle}{\sqrt2},
\qquad
|-\rangle
=
\frac{|0\rangle-|1\rangle}{\sqrt2}
} ∣ + ⟩ = 2 ∣0 ⟩ + ∣1 ⟩ , ∣ − ⟩ = 2 ∣0 ⟩ − ∣1 ⟩
H 2 = I \boxed{
H^2=I
} H 2 = I
H Z ≠ Z H \boxed{
HZ\neq ZH
} H Z = Z H
( A ⊗ B ) ( ∣ a ⟩ ⊗ ∣ b ⟩ ) = A ∣ a ⟩ ⊗ B ∣ b ⟩ \boxed{
(A\otimes B)
(|a\rangle\otimes|b\rangle)
=
A|a\rangle\otimes B|b\rangle
} ( A ⊗ B ) ( ∣ a ⟩ ⊗ ∣ b ⟩) = A ∣ a ⟩ ⊗ B ∣ b ⟩
CNOT = ( 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 ) \boxed{
\operatorname{CNOT}
=
\begin{pmatrix}
1&0&0&0\\
0&1&0&0\\
0&0&0&1\\
0&0&1&0
\end{pmatrix}
} CNOT = 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0
∣ 00 ⟩ → H ⊗ I ∣ 00 ⟩ + ∣ 10 ⟩ 2 → CNOT ∣ 00 ⟩ + ∣ 11 ⟩ 2 \boxed{
|00\rangle
\xrightarrow{H\otimes I}
\frac{|00\rangle+|10\rangle}{\sqrt2}
\xrightarrow{\operatorname{CNOT}}
\frac{|00\rangle+|11\rangle}{\sqrt2}
} ∣00 ⟩ H ⊗ I 2 ∣00 ⟩ + ∣10 ⟩ CNOT 2 ∣00 ⟩ + ∣11 ⟩
34. Final Perspective
The mathematical progression is
Pauli operators → phase and basis control → Hadamard → gate composition → tensor-product operations → CNOT . \boxed{
\text{Pauli operators}
\rightarrow
\text{phase and basis control}
\rightarrow
\text{Hadamard}
\rightarrow
\text{gate composition}
\rightarrow
\text{tensor-product operations}
\rightarrow
\text{CNOT}
}. Pauli operators → phase and basis control → Hadamard → gate composition → tensor-product operations → CNOT .
The most important conceptual lesson is:
Quantum gates do not directly manipulate classical probabilities.
They transform complex amplitudes and relative phases, and those amplitudes later determine measurement statistics.
The Bell circuit is the natural endpoint:
∣ Φ + ⟩ = ∣ 00 ⟩ + ∣ 11 ⟩ 2 . \boxed{
|\Phi^+\rangle
=
\frac{|00\rangle+|11\rangle}{\sqrt2}
}. ∣ Φ + ⟩ = 2 ∣00 ⟩ + ∣11 ⟩ .
This state leads directly to the next topic:
entanglement, separability, and quantum correlations.
Comments
Loading…