Demystifying Qubits: The Physics and Mathematics of Superposition and Entanglement

At the heart of the quantum computing revolution lies a fundamental departure from the binary logic that has governed computing for over seven decades. While classical computers manipulate bits constrained to discrete values of $0$ or $1$, quantum processors leverage the physical laws of quantum mechanics to process information in radically different ways.

This explainer introduces the foundational building blocks of quantum information science: qubits, quantum superposition, and quantum entanglement—providing both the conceptual intuition and the linear algebra that underpins modern quantum circuits.

From Classical Bits to Quantum Qubits

In classical computation, a bit is a physical state in a two-state system: a transistor either conducts voltage ($1$) or does not ($0$).

A quantum bit (qubit) is a two-level quantum mechanical system. Physical implementations vary widely across quantum hardware architectures:

• The spin orientation (spin-up $|\uparrow\rangle$ or spin-down $|\downarrow\rangle$) of an electron or nucleus.
• The polarization state (horizontal $|H\rangle$ or vertical $|V\rangle$) of a single photon.
• The ground and excited energy states of an artificial atom inside a superconducting Josephson junction circuit.

In quantum mechanics, we describe the state of a qubit using Dirac’s “bra-ket” vector notation. The two computational basis states are denoted as:

$$|0\rangle = \begin{bmatrix} 1 \ 0 \end{bmatrix}, \quad |1\rangle = \begin{bmatrix} 0 \ 1 \end{bmatrix}$$

Superposition: State Vectors and Probability Amplitudes

Unlike a classical bit, a qubit can exist in any linear combination of its basis states until it is measured. This property is known as superposition:

$$|\psi\rangle = \alpha|0\rangle + \beta|1\rangle$$

Where $\alpha$ and $\beta$ are complex numbers called probability amplitudes.

The Normalization Condition

Because the total probability of all mutually exclusive measurement outcomes must equal $100%$, the amplitudes must satisfy the normalization condition:

$$|\alpha|^2 + |\beta|^2 = 1$$

When an observer measures the qubit in the computational basis:

• The probability of measuring outcome $0$ is $P(0) = |\alpha|^2$.
• The probability of measuring outcome $1$ is $P(1) = |\beta|^2$.

Classical Bit:
State: [ 0 ] OR [ 1 ]  (Discrete binary state)

Quantum Qubit:
State: |ψ⟩ = α|0⟩ + β|1⟩  (Continuous superposition on Bloch Sphere)
              |
              v (Measurement collapses wave function)
       Result: 0 (prob |α|²) OR 1 (prob |β|²)

Superposition is Not Simply “Ignorance”

A critical point of confusion for beginners is assuming that superposition merely represents classical probabilistic uncertainty (like an uninspected coin toss).

In classical probability, a flipped coin is definitely heads or tails under the hand; the observer simply lacks information. In quantum mechanics, before measurement, the qubit genuinely exists in a continuous linear superposition of states. The probability amplitudes $\alpha$ and $\beta$ possess phases that can interfere constructively or destructively—the essential mechanism that powers quantum algorithms.

Visualizing the Qubit: The Bloch Sphere

Because a qubit’s state is normalized and global phase is physically unobservable, any pure single-qubit state can be geometrically mapped onto the surface of a unit sphere known as the Bloch Sphere:

$$|\psi\rangle = \cos\left(\frac{\theta}{2}\right)|0\rangle + e^{i\phi}\sin\left(\frac{\theta}{2}\right)|1\rangle$$

Where:

• $\theta \in [0, \pi]$ represents the polar angle.
• $\phi \in [0, 2\pi)$ represents the azimuthal phase angle.

                  |0⟩  (North Pole, θ = 0)
                   ▲
                   |   /
                   |  /
                   | / State Vector |ψ⟩
                   |/  (θ, φ)
       ------------+------------► Y
                  /|
                 / |
                ▼  |
               X   |
                   ▼
                  |1⟩  (South Pole, θ = π)

• The North Pole ($\theta = 0$) corresponds to state $|0\rangle$.
• The South Pole ($\theta = \pi$) corresponds to state $|1\rangle$.
• Points on the Equator ($\theta = \pi/2$) represent equal superpositions of $|0\rangle$ and $|1\rangle$ with varying quantum relative phases $\phi$.
  • The state $|+\rangle = \frac{1}{\sqrt{2}}(|0\rangle + |1\rangle)$ lies on the positive X-axis.
  • The state $|-\rangle = \frac{1}{\sqrt{2}}(|0\rangle - |1\rangle)$ lies on the negative X-axis.

Every single-qubit quantum gate (such as Pauli-X, Pauli-Z, or the Hadamard gate) corresponds geometrically to a rotation of the state vector around an axis of the Bloch Sphere.

The Power of Multiple Qubits: Exponential State Space

When scaling classical bits, adding $n$ bits allows a computer to store $n$ binary digits. However, a system of $n$ quantum qubits exists in a joint state space governed by the tensor product ($\otimes$):

$$|\Psi\rangle = \sum_{x=0}^{2^n - 1} c_x |x\rangle$$

A quantum processor with $n$ qubits requires $2^n$ complex amplitudes to fully describe its joint state:

• $n = 3$ qubits $\rightarrow 2^3 = 8$ amplitudes.
• $n = 10$ qubits $\rightarrow 2^{10} = 1,024$ amplitudes.
• $n = 50$ qubits $\rightarrow 2^{50} \approx 1.125 \times 10^{15}$ amplitudes (exceeding the memory capacity of conventional supercomputers).
• $n = 300$ qubits $\rightarrow 2^{300}$ amplitudes (exceeding the estimated number of atoms in the observable universe).

This exponential expansion of Hilbert space provides the computational medium in which quantum algorithms operate simultaneously across vast solution spaces.

Quantum Entanglement: Non-Local Correlation

Superposition alone is not sufficient to achieve quantum advantage. The second indispensable resource is quantum entanglement.

Two or more qubits are considered entangled when their joint quantum state cannot be factored into the product of individual single-qubit states:

$$|\Psi\rangle \neq |\psi_1\rangle \otimes |\psi_2\rangle$$

The Canonical Example: The Bell State

Consider the two-qubit Bell state $|\Phi^+\rangle$:

$$|\Phi^+\rangle = \frac{1}{\sqrt{2}}\left(|00\rangle + |11\rangle\right)$$

In this state:

• Neither qubit possesses a definite individual state on its own.
• If Qubit 1 is measured and found to be in state $0$, the joint state instantly collapses to $|00\rangle$. A subsequent measurement of Qubit 2 will yield outcome $0$ with $100%$ certainty.
• If Qubit 1 is measured and found to be $1$, Qubit 2 is guaranteed to yield $1$.

This correlation holds regardless of the physical distance separating the two qubits. Albert Einstein famously questioned this phenomenon as “spooky action at a distance” (the Einstein-Podolsky-Rosen paradox). Subsequent experiments verifying Bell’s Inequalities proved conclusively that quantum mechanics is inherently non-local: the correlation is real and fundamental to nature.

Constructing Entanglement in a Quantum Circuit

In practical quantum computing, entanglement is generated using elementary quantum logic gates:

          +---+
q_0: ─────| H |──────■───────  State: |Φ⁺⟩ = (|00⟩ + |11⟩)/√2
          +---+      |
                   +---+
q_1: ──────────────| X |─────
                   +---+

1. Hadamard Gate ($H$): Applied to the first qubit initialized in $|0\rangle$, creating an equal superposition: $$\frac{1}{\sqrt{2}}(|0\rangle + |1\rangle) \otimes |0\rangle = \frac{1}{\sqrt{2}}(|00\rangle + |10\rangle)$$
2. Controlled-NOT Gate ($CNOT$): Flips the target qubit (Qubit 1) if and only if the control qubit (Qubit 0) is $1$. The state transforms directly into the entangled Bell state: $$\frac{1}{\sqrt{2}}(|00\rangle + |11\rangle)$$

Why Entanglement Powers Quantum Advantage

Entanglement enables quantum algorithms to link qubits into coordinated states where quantum interference can operate across all $2^n$ possibilities simultaneously:

• Quantum Parallelism: Operations applied to an entangled register manipulate all computational basis states simultaneously.
• Interference: By engineering quantum gates so that wrong answers interfere destructively (canceling their amplitudes) while correct answers interfere constructively (amplifying their probability), quantum algorithms allow observers to extract the solution upon measurement with high probability.

Learn Quantum Computing with Sthitha Academy

Understanding the mathematics of qubits is the vital first step toward mastering quantum algorithms, quantum error correction, and post-quantum cryptography.

At Sthitha Academy, our educational courses provide hands-on, accessible instruction for learners at all levels:

• Quantum Computing Crash Course: Qubits to Shor & Grover: Master the transition from linear algebra to quantum gates, superposition, entanglement, and algorithmic implementation.
• Quantum Computing in Malayalam: For Beginners: A foundational quantum computing course taught in Malayalam, making quantum education accessible to regional learners.

Explore our full curriculum and course outlines on the Sthitha Academy Overview.