Lesson 23 · 80 min · core
Entanglement & the Bell States
The circuit turns the four computational basis states into the four Bell states and . This lesson computes each of them line by line, proves that they form an orthonormal basis, proves that none of them is a product state (via the criterion ), shows that each qubit on its own is maximally mixed, proves that the singlet is invariant under up to the phase , and evaluates the CHSH expression: for , beyond the bound obeyed by every local hidden-variable model.
Prerequisites: Controlled Gates: CNOT, CZ, SWAP, Partial Trace & Reduced States
Objectives and key results
Compute for all four inputs and name the resulting Bell states.
Prove that the Bell states are orthonormal by computing their Gram matrix, and recognise as the unitary change of basis from the computational basis to the Bell basis.
State and prove the product criterion for two-qubit pure states and use it to show that every Bell state is entangled.
Compute and for each Bell state .
Prove with the antisymmetric symbol and deduce perfect anti-correlation along every axis.
Prove , evaluate the CHSH value , and prove the local hidden-variable bound and the Tsirelson bound .
- definition · Bell states
- formula · Bell circuit
- theorem · Product criterion
- identity · Maximally mixed marginals
- identity · Singlet invariance
- theorem · CHSH: classical, quantum and Tsirelson values
The Bell circuit#
Definition
Bell states
The four Bell states are the two-qubit vectors In the states the two qubits always give equal computational-basis outcomes; in the states they always differ. The superscript is the relative sign. is called the singlet.
The general formula
- Step 1:For this is the first column of , ; for it is the second column, .
- Step 2:with , then distribute the tensor product over the sum.
- Step 3:The CNOT rule on the two basis states that occur.
- Step 4:CNOT is linear, so it acts term by term on the superposition of the previous step.
Result
The four inputs, line by line
- Step 1:Input : on qubit ; qubit is untouched.
- Step 2:has control and is unchanged; has control , so its target flips: .
- Step 3:Input : the same Hadamard step, now with qubit in .
- Step 4:is unchanged (control ); .
- Step 5:Input : carries the minus sign onto the branch of qubit .
- Step 6:is unchanged and ; linearity keeps the coefficient .
- Step 7:Input : on qubit , qubit stays .
- Step 8:is unchanged and .
Result
Writing the four outputs as columns gives the matrix of the Bell circuit. Column is : The CNOT matrix only swaps rows and (indices and ) of . Because and CNOT are both self-inverse, : running the circuit backwards maps each Bell state to its basis label, which is how a Bell measurement is performed with computational-basis readout.
Unitary verified: (max deviation 2.2e-16)
Circuit · 2 qubits
Bell preparation : the statevector has amplitude on and , and the histogram shows outcomes and with probability each, never or .
- |00⟩0.5
- |01⟩0
- |10⟩0
- |11⟩0.5
Circuit · 2 qubits
An on qubit first changes the input to , and the same circuit produces : the outcomes are now always different.
- |00⟩0
- |01⟩0.5
- |10⟩0.5
- |11⟩0
Quick check
Which Bell state does produce from the input ?
The Bell basis is orthonormal#
The Gram matrix of
- Step 1:The Gram matrix collects all pairwise inner products; a family is orthonormal exactly when . All amplitudes are real, so complex conjugation does not change them.
- Step 2:Each state has two non-zero amplitudes of modulus , so the norm squared is .
- Step 3:The two states share the support and differ by the sign of one amplitude, so the two contributions cancel; the same holds for the pair on .
- Step 4:A state lives on and a state on ; the supports are disjoint, so every term of the inner product contains a zero factor.
- Step 5:Collect the sixteen entries: the diagonal entries are , every off-diagonal entry is , and is Hermitian, so fills the lower triangle.
- Step 6:Independent check: the columns of are the Bell vectors, so , and is unitary as a product of the unitaries and .
Result
Unitary verified: (max deviation 0.0e+0)
The Bell states are entangled#
Definition
Product state, entangled state
A two-qubit pure state is a product state if for some single-qubit vectors . Otherwise it is entangled. We write and collect the amplitudes in the coefficient matrix .
Product criterion for two qubits
A non-zero vector is a product state if and only if .
Proof (7 steps)
- Step 1:() Assume and expand the tensor product bilinearly.
- Step 2:Compare coefficients in the basis ; both products contain the same four factors .
- Step 3:() Assume . If the first row of vanishes, only the terms with survive and they factor directly.
- Step 4:Divide by ; trivially also , so the second row of is times the first.
- Step 5:Then : again the second row is times the first.
- Step 6:In both remaining cases ; factor out of both rows. The three cases are exhaustive, so implies a product state.
- Step 7:Scalars move freely between the factors of a tensor product, so the factors can be normalised individually when is a unit vector: the product of their norms is .
∎
for each Bell state
- Step 1:has , and .
- Step 2:has , and . For the singlet the value is .
- Step 3:Apply the product criterion: a product state would have .
- Step 4:The concurrence measures how far a pure two-qubit state is from the product condition. For a unit vector, is the product of the two singular values of with , so by the AM–GM inequality: every Bell state attains the maximum .
Result
Quick check
Compute for the singlet .
Each half of a Bell pair is maximally mixed#
The partial trace over acts on operator products as , and over as ; both are extended by linearity. For two qubits .
and for the singlet
- Step 1:The bra of is (real coefficients); the two factors multiply to .
- Step 2:Expand the product of the two binomials into four outer products.
- Step 3:Diagonal terms: the qubit- labels of ket and bra agree, so .
- Step 4:Cross terms: the qubit- labels differ, so and the coherence between and is erased.
- Step 5:Linearity of applied to the four terms.
- Step 6:The same four terms traced over qubit : the cross terms carry , the diagonal terms leave and .
- Step 7:The Pauli matrices are traceless, so the reduced Bloch vector sits at the centre of the ball; the purity is the minimum for a qubit and the von Neumann entropy is bit.
Result
The same pattern for and
- Step 1:Every Bell state has this form by the Bell-circuit formula; the two terms differ on both qubits.
- Step 2:is real with , so the diagonal terms have coefficient and the cross terms coefficient .
- Step 3:The cross terms contain or on qubit ; the diagonal terms contribute and .
- Step 4:The cross terms carry or on qubit ; for either value of .
- Step 5:The sign only ever multiplies the cross terms, which the partial trace removes, so all four Bell states have the same marginals.
Result
Quick check
What is the purity of qubit when the pair is in ?
The singlet is invariant under U ⊗ U#
The antisymmetric symbol and the determinant
Let for be the antisymmetric symbol , , . For every complex matrix and all , .
Proof (4 steps)
- Step 1:Only the two terms with survive, because .
- Step 2:The two products coincide, and .
- Step 3:This is the definition of the determinant, and .
- Step 4:The same two products with the opposite sign, and . The four cases exhaust .
∎
Rotational invariance of the singlet
For every , . Since , the singlet is unchanged up to a global phase, and it is exactly invariant for .
Proof (5 steps)
- Step 1:The sum has the terms and ; the others vanish.
- Step 2:Linearity and .
- Step 3:Column of is ; expand both factors and exchange the finite sums.
- Step 4:Apply the lemma to the bracket, then recognise the first line with renamed .
- Step 5:The determinant is multiplicative and , so is a pure phase, equal to on .
∎
Perfect anti-correlation along every axis
- Step 1:For a unit vector , is Hermitian with and trace , so its eigenvalues are and with orthonormal eigenvectors . maps an orthonormal basis to an orthonormal basis, hence is unitary.
- Step 2:, and .
- Step 3:Apply the theorem to the unitary ; the second identity is the adjoint of the first, since .
- Step 4:Use and the previous line.
- Step 5:is diagonal with entry on , so the cross terms vanish; .
Result
A correlator equal to for observables with eigenvalues means the two outcomes are always opposite: forces . The singlet is the same anti-correlated state whichever axis the two parties choose, as long as they choose the same one. The other three Bell states lack this symmetry: for example while .
Quick check
Alice and Bob share and both measure . What is ?
The CHSH inequality#
In a CHSH experiment Alice chooses one of two measurement settings and Bob one of two settings ; every measurement has outcomes . From many runs they estimate the four correlators , the average of the product of their outcomes, and form Quantum mechanically the settings are Hermitian observables with eigenvalues . We use where are the Pauli observables along the unit vectors in the plane, so .
Correlations in the state Φ+
For all complex matrices and , , where acts on qubit and on qubit .
Proof (4 steps)
- Step 1:The two terms are and .
- Step 2:Expand bra and ket; the prefactor is .
- Step 3:, and .
- Step 4:Write ; the inner sum over is the entry of the product , and summing the diagonal gives the trace.
∎
The four correlators and
- Step 1:and are real symmetric; ; and are traceless.
- Step 2:Lemma with , , and linearity of the trace.
- Step 3:, .
- Step 4:, .
- Step 5:, : the only negative correlator.
- Step 6:The minus sign in front of turns the negative correlator into a positive contribution; .
Result
Circuit · 2 qubits
Measuring the pair with computational-basis readout: on qubit rotates into , since . The output is with , , so equal outcomes occur with probability and .
- |00⟩0.4268
- |01⟩0.0732
- |10⟩0.0732
- |11⟩0.4268
CHSH inequality (Clauser–Horne–Shimony–Holt)
Every local hidden-variable model satisfies . Consequently no LHV model reproduces the quantum prediction for .
Proof (7 steps)
- Step 1:For one deterministic strategy , each correlator is the product ; group the terms by Alice's outcome.
- Step 2:Since , they are either equal or opposite: exactly one bracket vanishes and the other is .
- Step 3:, so the surviving term has modulus . All deterministic strategies therefore give exactly.
- Step 4:For a general LHV model, each is an average over the same distribution , which does not depend on , so the four averages combine into one average of .
- Step 5:Triangle inequality for integrals, and : a convex combination of numbers in stays in .
- Step 6:Models with random local responses are covered too: adjoin independent uniform variables (Alice) and (Bob) to the hidden variable. The pair is a new hidden variable with deterministic outcome functions and the same correlators, so the bound applies.
- Step 7:The quantum value computed above violates the bound, so quantum correlations of the Bell state cannot be explained by any LHV model.
∎
Tsirelson bound
For every quantum state on and Hermitian observables with and , the CHSH operator satisfies . The settings above attain the bound on .
Proof (8 steps)
- Step 1:Expand the products using ; for instance .
- Step 2:Square with .
- Step 3:; the anticommutator terms cancel between the first two terms, which sum to .
- Step 4:In the operator norm, because the eigenvalues of are , and .
- Step 5:is Hermitian, so ; also and the triangle inequality.
- Step 6:with , , and for unit vectors.
- Step 7:For the settings of this lesson; .
- Step 8:and . Since has eigenvalues , has eigenvalues and , so exactly for these settings. The value computed above therefore attains the bound; equality in for Hermitian forces .
∎
Quick check
To three decimal places, what CHSH value do the settings , , give on ?
import { Statevector, reducedStateFromPure, purity, concurrence, expectationObservable, matrix, PAULI_X, PAULI_Z, u3Matrix } from '@/lib/quantum-simulator';
// The Bell circuit CNOT(H x I) on the four basis inputs |ab> (qubit 0 = a = most significant bit)
const fmt = (sv) => sv.amplitudes().map((a) => a.re.toFixed(4)).join(', ');
for (const ab of ['00', '01', '10', '11']) {
const bell = Statevector.fromBitstring(ab).applyGate('H', [0]).applyGate('X', [1], [], [0]);
const rhoA = reducedStateFromPure(bell, [0]);
console.log('|' + ab + '> -> [' + fmt(bell) + '] purity(rho_A) = ' + purity(rhoA).toFixed(4) + ' concurrence = ' + concurrence(bell).toFixed(4));
}
// CHSH on |Phi+> with A0 = Z, A1 = X, B0 = (Z + X)/sqrt2, B1 = (Z - X)/sqrt2
const phiPlus = Statevector.fromBitstring('00').applyGate('H', [0]).applyGate('X', [1], [], [0]);
const A = [PAULI_Z, PAULI_X];
const B = [matrix.scale(matrix.add(PAULI_Z, PAULI_X), Math.SQRT1_2), matrix.scale(matrix.sub(PAULI_Z, PAULI_X), Math.SQRT1_2)];
const E = (x, y) => expectationObservable(phiPlus, matrix.kron(A[x], B[y]), [0, 1]);
console.log('E00 E01 E10 E11 =', E(0, 0).toFixed(4), E(0, 1).toFixed(4), E(1, 0).toFixed(4), E(1, 1).toFixed(4));
console.log('S =', (E(0, 0) + E(0, 1) + E(1, 0) - E(1, 1)).toFixed(6), ' 2*sqrt(2) =', (2 * Math.SQRT2).toFixed(6));
// Local hidden variables: all 16 deterministic strategies (a0, a1, b0, b1)
let best = 0;
for (let m = 0; m < 16; m++) {
const [a0, a1, b0, b1] = [0, 1, 2, 3].map((k) => ((m >> k) & 1 ? -1 : 1));
best = Math.max(best, Math.abs(a0 * (b0 + b1) + a1 * (b0 - b1)));
}
console.log('max |S| over deterministic strategies =', best);
// Singlet invariance: <Psi-|(U x U)|Psi-> = det U = e^{i(phi + lambda)} for U = U3(0.4, 1.3, -0.8)
const U = u3Matrix(0.4, 1.3, -0.8);
const singlet = Statevector.fromBitstring('11').applyGate('H', [0]).applyGate('X', [1], [], [0]);
const overlap = singlet.inner(singlet.clone().applyMatrix(U, [0]).applyMatrix(U, [1]));
console.log('<Psi-|(U x U)|Psi-> =', overlap.re.toFixed(4), overlap.im.toFixed(4), ' e^{0.5 i} =', Math.cos(0.5).toFixed(4), Math.sin(0.5).toFixed(4));Expected output
|00> -> [0.7071, 0.0000, 0.0000, 0.7071] purity(rho_A) = 0.5000 concurrence = 1.0000
|01> -> [0.0000, 0.7071, 0.7071, 0.0000] purity(rho_A) = 0.5000 concurrence = 1.0000
|10> -> [0.7071, 0.0000, 0.0000, -0.7071] purity(rho_A) = 0.5000 concurrence = 1.0000
|11> -> [0.0000, 0.7071, -0.7071, 0.0000] purity(rho_A) = 0.5000 concurrence = 1.0000
E00 E01 E10 E11 = 0.7071 0.7071 0.7071 -0.7071
S = 2.828427 2*sqrt(2) = 2.828427
max |S| over deterministic strategies = 2
<Psi-|(U x U)|Psi-> = 0.8776 0.4794 e^{0.5 i} = 0.8776 0.4794References
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press (2010), §1.3.6 (Bell states), §2.4.3 (partial trace), §2.6 (EPR and the Bell inequality).doi:10.1017/CBO9780511976667
- J. S. Bell, On the Einstein Podolsky Rosen paradox, Physics Physique Fizika 1, 195–200 (1964).doi:10.1103/PhysicsPhysiqueFizika.1.195
- J. F. Clauser, M. A. Horne, A. Shimony and R. A. Holt, Proposed experiment to test local hidden-variable theories, Physical Review Letters 23, 880–884 (1969).doi:10.1103/PhysRevLett.23.880
- B. S. Cirel'son (Tsirelson), Quantum generalizations of Bell's inequality, Letters in Mathematical Physics 4, 93–100 (1980).doi:10.1007/BF00417500
Hands-on labs
Prepare the singlet state
1 step · auto-gradedOpen labStarting from , prepare the singlet with at most four gates from . The grader checks the state fidelity and, separately, the perfectly anti-correlated measurement statistics, so it can tell a wrong relative sign from a wrong pair of basis states.