Combining the superposition of a single qubit with the conditional logic of a CNOT gate creates something entirely new. A CNOT gate's conditional logic involves acting on computational basis states such as or to flip bits deterministically. However, when uncertainty is introduced into the control qubit before applying the CNOT, entanglement is generated.
The specific states that result from this process are known as Bell states. These are the simplest examples of entanglement and serve as the standard resource for many quantum protocols, including quantum teleportation and superdense coding. There are four specific Bell states, which represent the four maximally entangled states for a two-qubit system.
To create a Bell state, you need a circuit with two specific components: a Hadamard gate (H) and a Controlled-NOT gate (CNOT).
The following diagram illustrates the flow of this circuit.
Circuit logic for generating a Bell state. The top wire represents the control qubit and the bottom wire represents the target qubit.
Let us walk through the mathematics of this circuit to prove that the qubits become entangled. We use the standard tensor product notation where .
Step 1: Initialization We begin with both qubits in the ground state.
Step 2: Superposition We apply the Hadamard gate to the first qubit. Recall that . The second qubit remains unchanged.
Expanding the tensor product, we get:
At this stage, the system is in an equal superposition of and . The first qubit is random (50/50 chance of 0 or 1), while the second qubit is deterministically 0. They are not yet entangled.
Step 3: The CNOT Operation Now we apply the CNOT gate. The first qubit is the control.
Combining these results yields the final state vector:
This specific state is denoted as (Phi-plus). Look closely at the final equation:
This describes a system that, upon measurement, has a 50% probability of collapsing to and a 50% probability of collapsing to .
The defining characteristic of this state is the perfect correlation between the two qubits. If you measure the first qubit and find it is 0, the state collapses to , meaning the second qubit is guaranteed to be 0 immediately. Conversely, if you measure 1, the second qubit is guaranteed to be 1. It is impossible to find the system in state or .
We can visualize the probability distribution of this state compared to a random unentangled state.
Probability outcomes when measuring the Bell state. Note that mixed outcomes like |01> and |10> are impossible.
This correlation holds regardless of the physical distance between the qubits. Once entangled, they act as a single mathematical object. You cannot describe the state of one qubit without referencing the other. If you attempt to factor into a product , you will find there are no coefficients that satisfy the equation. This mathematical inseparability is the definition of entanglement.
Depending on the initial state of the two qubits before applying the Hadamard and CNOT gates, you can generate four different maximally entangled states. These constitute the Bell Basis.
If we change the input from to the other basis states (), the resulting Bell states differ by phase signs or bit flips.
Input : Outcome: Correlated (00 or 11). Same phase.
Input : We start with . The Hadamard on the first qubit gives . The CNOT (control 1 flips target 1 to 0) results in: Outcome: Anti-correlated (01 or 10). If qubit A is 0, qubit B is 1.
Input : We start with . The Hadamard creates a phase difference: . The CNOT results in: Outcome: Correlated (00 or 11) but with a phase difference. Probabilities look identical to upon standard measurement, but the phase affects interference patterns in subsequent operations.
Input : We start with . Result: Outcome: Anti-correlated with a phase difference.
In Python frameworks like Qiskit, generating these states is a standard exercise. You simply initialize your qubits to the desired starting state (using X gates to flip to if necessary), apply the H gate, and then apply the CX (CNOT) gate. We will implement this directly in the practice section following this explanation.
Was this section helpful?
© 2026 ApX Machine LearningEngineered with