Part I, Chapter 3

Entanglement & Quantum Information

Quantum entanglement — the "spooky action at a distance" — enables teleportation, unbreakable cryptography, and quantum computing.

3.1 Bell States

The four Bell states form a maximally entangled basis for two qubits. They cannot be written as product states and exhibit perfect correlations (or anti-correlations) regardless of the measurement basis.

The Four Bell States

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

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

$$|\Psi^+\rangle = \frac{1}{\sqrt{2}}(|01\rangle + |10\rangle)$$

$$|\Psi^-\rangle = \frac{1}{\sqrt{2}}(|01\rangle - |10\rangle)$$

For |Φ&sup+;〉, measuring qubit A in the computational basis and finding |0〉 instantly projects qubit B into |0〉, regardless of the spatial separation. This is not faster-than-light communication — the individual measurement outcomes are random.

Derivation 1: Entanglement Entropy of a Bell State

Step 1. Consider |Φ&sup+;〉 = (|00〉 + |11〉)/√2. The full density matrix is:

$$\rho_{AB} = |\Phi^+\rangle\langle\Phi^+| = \frac{1}{2}(|00\rangle\langle 00| + |00\rangle\langle 11| + |11\rangle\langle 00| + |11\rangle\langle 11|)$$

Step 2. Tracing over subsystem B:

$$\rho_A = \text{Tr}_B(\rho_{AB}) = \frac{1}{2}(|0\rangle\langle 0| + |1\rangle\langle 1|) = \frac{\mathbb{I}}{2}$$

Step 3. The von Neumann entropy is:

$$S(\rho_A) = -\text{Tr}(\rho_A \log_2 \rho_A) = -2 \times \frac{1}{2}\log_2\frac{1}{2} = 1 \text{ ebit}$$

Maximum entanglement: the reduced state is maximally mixed (complete ignorance about subsystem A alone), yet the joint state is pure. This is the defining feature of entanglement.

3.2 EPR Paradox and Local Realism

In 1935, Einstein, Podolsky, and Rosen argued that quantum mechanics is incomplete because entangled particles seem to have predetermined measurement outcomes (elements of reality). They proposed that a deeper theory with local hidden variables could explain quantum correlations without "spooky action at a distance."

EPR Assumptions

• Locality: A measurement on one particle cannot instantaneously affect the other
• Realism: Physical quantities have definite values independent of observation
• Completeness: Every element of physical reality must have a counterpart in the theory

Bell's theorem (1964) showed that these assumptions lead to testable inequalities that quantum mechanics violates, proving that nature is fundamentally non-local or non-real (or both).

3.3 CHSH Inequality

The Clauser-Horne-Shimony-Holt (CHSH) inequality is the most experimentally accessible form of Bell's inequality. It involves two measurement settings per party and provides a sharp boundary between local realistic theories and quantum mechanics.

Derivation 2: CHSH Inequality and Tsirelson's Bound

Step 1. Alice measures observable A or A' (outcomes ±1), Bob measures B or B'. Define the CHSH parameter:

$$S = \langle AB \rangle + \langle AB' \rangle + \langle A'B \rangle - \langle A'B' \rangle$$

Step 2. In any local hidden variable theory, each measurement has a predetermined value. Since A, A', B, B' = ±1:

$$S_\lambda = A(B + B') + A'(B - B') = \pm 2$$

because either B + B' = 0 (and B - B' = ±2) or B - B' = 0 (and B + B' = ±2).

Step 3. Averaging over hidden variables: |S| ≤ 2. For quantum mechanics with |Φ&sup+;〉 and optimal angles (θ_A = 0, θ_A' = π/2, θ_B = π/4, θ_B' = -π/4):

$$S_{\text{QM}} = 2\sqrt{2} \approx 2.828 > 2$$

This is Tsirelson's bound — the maximum quantum violation. Experiments (Aspect 1982, Hensen 2015 loophole-free) confirm S ≈ 2.8, ruling out local hidden variable theories.

3.4 Quantum Teleportation

Quantum teleportation transfers an unknown quantum state from Alice to Bob using shared entanglement and classical communication. It does not clone the state — the original is destroyed in the process, consistent with the no-cloning theorem.

Derivation 3: Teleportation Protocol

Step 1. Alice has an unknown state |ψ〉₁ = α|0〉 + β|1〉. Alice and Bob share |Φ&sup+;〉₂₃. The total state is:

$$|\Psi\rangle_{123} = (\alpha|0\rangle_1 + \beta|1\rangle_1) \otimes \frac{1}{\sqrt{2}}(|00\rangle_{23} + |11\rangle_{23})$$

Step 2. Rewrite qubits 1,2 in the Bell basis:

$$|\Psi\rangle_{123} = \frac{1}{2}\Big[ |\Phi^+\rangle_{12}(\alpha|0\rangle + \beta|1\rangle)_3 + |\Phi^-\rangle_{12}(\alpha|0\rangle - \beta|1\rangle)_3$$

$$+ |\Psi^+\rangle_{12}(\alpha|1\rangle + \beta|0\rangle)_3 + |\Psi^-\rangle_{12}(\alpha|1\rangle - \beta|0\rangle)_3 \Big]$$

Step 3. Alice performs a Bell measurement on qubits 1,2 and communicates the result (2 classical bits) to Bob. Bob applies the corresponding Pauli correction:

Φ&sup+; → I (no correction needed)

Φ&sup-; → Z (phase flip)

Ψ&sup+; → X (bit flip)

Ψ&sup-; → iY = XZ (both flips)

Bob's qubit is now in the state α|0〉 + β|1〉. The teleportation is complete. Note: 2 classical bits and 1 ebit of entanglement are consumed.

3.5 Quantum Key Distribution

Quantum key distribution (QKD) exploits quantum mechanics to generate a shared secret key between two parties with information-theoretic security. Any eavesdropping attempt introduces detectable disturbance due to the no-cloning theorem.

3.5.1 BB84 Protocol

Alice randomly encodes bits in one of two conjugate bases (rectilinear |0〉, |1〉 or diagonal |+〉, |-〉). Bob randomly measures in one of the two bases. They publicly compare bases and keep only matching-basis results.

Derivation 4: BB84 Error Rate Under Eavesdropping

Step 1. Eve intercepts and measures in a randomly chosen basis. Probability of choosing the correct basis: 1/2.

Step 2. If Eve measures in the wrong basis, she gets a random result and resends a state in her measured basis. When Bob measures in Alice's basis, there is a 50% chance of error.

Step 3. Overall error rate introduced by eavesdropping on all qubits:

$$\text{QBER} = \frac{1}{2} \times \frac{1}{2} = 25\%$$

Alice and Bob sacrifice a subset of their key to estimate the quantum bit error rate (QBER). If QBER > 11% (for BB84), they abort. This threshold accounts for the most general eavesdropping attacks and is derived from information-theoretic bounds.

3.5.2 E91 Protocol

Ekert's 1991 protocol uses entangled pairs distributed to Alice and Bob. Security is verified by testing Bell's inequality on a subset of measurements. If S = 2√2, no eavesdropper has gained information, and the remaining measurements yield a secure key.

Derivation 5: E91 Key Rate from CHSH Violation

Step 1. Alice and Bob each choose from 3 measurement angles. When they choose matching angles, the outcomes are perfectly correlated (for |Φ&sup+;〉) and become key bits.

Step 2. Non-matching angle pairs are used to compute S. The Devetak-Winter bound gives the secure key rate:

$$r \geq 1 - h\!\left(\frac{1 + \sqrt{(S/2)^2 - 1}}{2}\right)$$

where h(x) = -x log&sub2; x - (1-x) log&sub2;(1-x) is the binary entropy.

Step 3. For maximum violation S = 2√2: r = 1 (one secure bit per entangled pair used for key generation). Any reduction in S from eavesdropping reduces the key rate. When S ≤ 2 (no Bell violation), r = 0 and no secure key can be extracted.

3.6 Entanglement Witnesses and Measures

Detecting and quantifying entanglement in multipartite systems is a fundamental challenge. Several tools have been developed for this purpose.

3.6.1 PPT Criterion (Peres-Horodecki)

For a bipartite density matrix ρ_AB, the partial transpose ρ^T_Bis obtained by transposing only Bob's subsystem. A separable state always has a positive partial transpose (PPT). Therefore:

If ρ^T_B has any negative eigenvalue, the state is entangled. This is necessary and sufficient for 2×2 and 2×3 systems, but only necessary in higher dimensions (bound entangled states can be PPT yet entangled).

3.6.2 Concurrence and Entanglement of Formation

For two-qubit systems, Wootters' concurrence C provides a computable entanglement measure:

$$C(\rho) = \max(0, \lambda_1 - \lambda_2 - \lambda_3 - \lambda_4)$$

where λ_i are the square roots of the eigenvalues of ρ(σ_y⊗σ_y)ρ*(σ_y⊗σ_y) in decreasing order. C = 0 for separable states and C = 1 for maximally entangled (Bell) states.

3.6.3 Entanglement Witnesses

An entanglement witness &Wcirc; is an observable with 〈&Wcirc;〉 ≥ 0 for all separable states. If 〈&Wcirc;〉 < 0 is measured, the state is certified entangled. Witnesses are experimentally practical because they require measuring only a few observables rather than full state tomography.

For Bell states, a simple witness is:

$$\hat{W} = \frac{1}{2}\mathbb{I} - |\Phi^+\rangle\langle\Phi^+|$$

This gives 〈&Wcirc;〉 = -1/2 for |Φ&sup+;〉 (confirming entanglement) and 〈&Wcirc;〉 ≥ 0 for all separable states.

3.7 Multipartite Entanglement

Beyond two particles, entanglement becomes richer with qualitatively different classes.

3.7.1 GHZ States

The Greenberger-Horne-Zeilinger state for N qubits:

$$|\text{GHZ}_N\rangle = \frac{1}{\sqrt{2}}(|0\rangle^{\otimes N} + |1\rangle^{\otimes N})$$

GHZ states are maximally entangled in the sense that tracing out any single qubit leaves a completely mixed state. They violate Mermin's inequality by an exponentially growing factor and are used in quantum error correction and quantum secret sharing.

3.7.2 W States

The W state distributes a single excitation symmetrically:

$$|W_N\rangle = \frac{1}{\sqrt{N}}(|100\cdots0\rangle + |010\cdots0\rangle + \cdots + |000\cdots1\rangle)$$

Unlike GHZ states, W states are robust against particle loss: tracing out one qubit still leaves an entangled (N-1)-qubit state. GHZ and W represent distinct classes of tripartite entanglement that cannot be converted into each other by local operations.

3.7.3 Cluster States and Measurement-Based QC

Cluster states are highly entangled multi-qubit states created by applying controlled-Z gates between neighboring qubits on a lattice. They serve as the resource for measurement-based quantum computing (MBQC): universal computation proceeds by performing single-qubit measurements on the cluster state, consuming entanglement to drive the computation forward.

Photonic cluster states have been demonstrated with up to 12 entangled photons and are a leading approach for fault-tolerant photonic quantum computing (PsiQuantum, Xanadu).

3.8 Quantum Dense Coding

Quantum dense coding (Bennett & Wiesner, 1992) allows transmission of two classical bits by sending only one qubit, provided Alice and Bob share entanglement.

Dense Coding Protocol

Alice and Bob share a Bell state |Φ&sup+;〉
Alice applies one of four Pauli operations (I, X, Z, or iY) to her qubit, encoding 2 bits of information (00, 01, 10, 11)
Alice sends her qubit to Bob
Bob performs a Bell measurement on both qubits, perfectly distinguishing the four Bell states and recovering 2 classical bits

This doubles the classical capacity of a quantum channel. The Holevo bound shows that without entanglement, one qubit can carry at most 1 classical bit. Dense coding was first demonstrated experimentally by Mattle et al. (1996) using polarization-entangled photon pairs.

3.8.1 Entanglement Swapping

Two particles that have never interacted can become entangled through entanglement swapping. If particles 1-2 and 3-4 are each in Bell states, performing a Bell measurement on particles 2-3 projects particles 1 and 4 into an entangled state. This is the key building block for quantum repeaters in long-distance quantum communication.

3.8.2 Entanglement Distillation

Imperfect entangled pairs (with fidelity F < 1) can be purified into fewer pairs with higher fidelity using local operations and classical communication (LOCC). The BBPSSW (Bennett et al., 1996) and DEJMPS protocols achieve this by sacrificing some pairs to improve the quality of the remaining ones — essential for practical quantum communication over noisy channels.

Applications

Quantum Internet

Entanglement distribution over long distances enables a quantum internet connecting quantum computers and sensors. The Micius satellite (2017) demonstrated entanglement distribution over 1200 km between ground stations in China.

Device-Independent QKD

By using Bell inequality violations to certify security, device-independent QKD removes the need to trust the measurement devices. First demonstrated experimentally in 2022, it provides the strongest possible security guarantees.

Quantum Repeaters

Entanglement swapping and purification protocols enable quantum communication beyond the direct transmission range. Quantum repeaters divide long channels into shorter segments, establishing end-to-end entanglement through intermediate Bell measurements.

Quantum Sensing and Metrology

Entangled states of N particles can achieve Heisenberg-limited precision scaling as 1/N, surpassing the standard quantum limit of 1/√N. Applications include atomic clocks, magnetometry, and gravitational wave detection.

3.9 Fundamental No-Go Theorems

Entanglement is constrained by several fundamental no-go theorems that define the boundaries of what is possible with quantum information.

3.9.1 No-Cloning Theorem

It is impossible to create an exact copy of an arbitrary unknown quantum state. If a unitary U could clone arbitrary states (U|ψ〉|0〉 = |ψ〉|ψ〉), then for two different states |ψ〉 and |φ〉, linearity of U would require:

$$\langle\psi|\phi\rangle = (\langle\psi|\phi\rangle)^2$$

This is satisfied only if 〈ψ|φ〉 = 0 or 1 — the states must be identical or orthogonal. The no-cloning theorem is the foundation of quantum cryptography: an eavesdropper cannot copy quantum states without disturbing them.

3.9.2 No-Communication Theorem

Entanglement cannot be used for faster-than-light signaling. Alice's local operations on her half of an entangled pair do not change the statistics of Bob's measurements: ρ_B = Tr_A(ρ_AB) is independent of Alice's choice of measurement basis. This ensures consistency with special relativity.

3.9.3 Monogamy of Entanglement

Entanglement is monogamous: if qubit A is maximally entangled with qubit B, it cannot be entangled at all with qubit C. Quantitatively (Coffman-Kundu-Wootters inequality):

$$C_{A|B}^2 + C_{A|C}^2 \leq C_{A|BC}^2$$

Monogamy is the reason QKD works: if Eve becomes entangled with the key qubits, Alice and Bob's entanglement is reduced, detectable as an increased error rate.

Key Equations Summary

Bell State |Φ&sup+;〉:

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

von Neumann Entropy:

$$S(\rho_A) = -\text{Tr}(\rho_A \log_2 \rho_A) \leq 1 \text{ ebit}$$

CHSH Inequality:

$$|S| \leq 2 \text{ (classical)}, \qquad S_{\text{QM}}^{\text{max}} = 2\sqrt{2} \text{ (Tsirelson)}$$

BB84 Eavesdropping QBER:

$$\text{QBER} = 25\% \text{ (intercept-resend)}, \qquad \text{threshold} = 11\%$$

Concurrence:

$$C(\rho) = \max(0, \lambda_1 - \lambda_2 - \lambda_3 - \lambda_4)$$

Historical Context

1935 — Einstein, Podolsky, Rosen: Published the EPR paper arguing quantum mechanics is incomplete, coining the concept of entanglement.

1964 — Bell: Proved that no local hidden variable theory can reproduce all predictions of quantum mechanics, providing a testable criterion.

1982 — Aspect et al.: Performed the first convincing Bell test with fast-switching polarizers, violating Bell's inequality by 5 standard deviations.

1984 — Bennett & Brassard: Proposed the BB84 quantum key distribution protocol, launching the field of quantum cryptography.

1993 — Bennett et al.: Proposed quantum teleportation; experimentally realized by Bouwmeester et al. (1997) and Boschi et al. (1998).

2015 — Hensen et al.: First loophole-free Bell test at TU Delft, simultaneously closing the locality and detection loopholes.

2022 — Nobel Prize: Awarded to Aspect, Clauser, and Zeilinger for experiments with entangled photons, establishing the violation of Bell inequalities.

Interactive Simulation

This simulation demonstrates the CHSH inequality violation, comparing quantum correlations with the local hidden variable bound, and simulates a BB84 QKD protocol.

Bell Inequality Violation & QKD Simulation

Python

script.py113 lines

import numpy as np
import matplotlib.pyplot as plt

np.random.seed(42)

fig, axes = plt.subplots(2, 2, figsize=(12, 10))
fig.patch.set_facecolor("#0a0a0a")
for ax in axes.flat:
    ax.set_facecolor("#111111")

# Plot 1: CHSH correlation E(a,b) = -cos(a-b) for entangled state
ax1 = axes[0, 0]
theta = np.linspace(0, 2 * np.pi, 300)
E_quantum = -np.cos(theta)
E_classical = np.where(np.abs(theta % (2*np.pi) - np.pi) < np.pi/2,
                       -1 + 2*np.abs(theta % (2*np.pi) - np.pi)/(np.pi),
                       2*np.abs(theta % (2*np.pi) - np.pi)/(np.pi) - 1)
# Simple classical model: linear interpolation
theta_norm = theta / np.pi
E_class_simple = np.where(theta_norm <= 1, -1 + 2*theta_norm, 3 - 2*theta_norm)
E_class_simple = np.where(theta_norm <= 2, E_class_simple, E_class_simple)

ax1.plot(theta * 180 / np.pi, E_quantum, color="#a78bfa", linewidth=2, label="Quantum (singlet)")
ax1.plot(theta * 180 / np.pi, E_class_simple, color="#f97316", linewidth=2, linestyle="--", label="Local HV (optimal)")
ax1.set_xlabel("Angle difference (degrees)", color="white")
ax1.set_ylabel("Correlation E(a,b)", color="white")
ax1.set_title("Quantum vs Classical Correlations", color="#c4b5fd", fontsize=14)
ax1.legend(facecolor="#1a1a2e", edgecolor="#7c3aed", labelcolor="white")
ax1.tick_params(colors="white")
for spine in ax1.spines.values():
    spine.set_color("#7c3aed")

# Plot 2: CHSH S parameter as function of angle
ax2 = axes[0, 1]
phi_vals = np.linspace(0, np.pi, 200)
# Alice: 0, pi/2; Bob: phi, phi + pi/2
# S = E(0,phi) + E(0,phi+pi/2) + E(pi/2,phi) - E(pi/2,phi+pi/2)
# For singlet: E(a,b) = -cos(a-b)
S_vals = np.array([
    -np.cos(0 - phi) + (-np.cos(0 - (phi + np.pi/2))) +
    (-np.cos(np.pi/2 - phi)) - (-np.cos(np.pi/2 - (phi + np.pi/2)))
    for phi in phi_vals
])
ax2.plot(phi_vals * 180 / np.pi, np.abs(S_vals), color="#a78bfa", linewidth=2, label="|S| quantum")
ax2.axhline(y=2, color="#f97316", linestyle="--", linewidth=2, label="CHSH bound = 2")
ax2.axhline(y=2*np.sqrt(2), color="#c084fc", linestyle=":", linewidth=2, label="Tsirelson = 2sqrt(2)")
ax2.set_xlabel("Bob angle phi (degrees)", color="white")
ax2.set_ylabel("|S|", color="white")
ax2.set_title("CHSH Parameter vs Measurement Angle", color="#c4b5fd", fontsize=14)
ax2.legend(facecolor="#1a1a2e", edgecolor="#7c3aed", labelcolor="white", fontsize=9)
ax2.tick_params(colors="white")
for spine in ax2.spines.values():
    spine.set_color("#7c3aed")

# Plot 3: BB84 simulation
ax3 = axes[1, 0]
N = 1000
alice_bases = np.random.randint(0, 2, N)  # 0=Z, 1=X
alice_bits = np.random.randint(0, 2, N)
bob_bases = np.random.randint(0, 2, N)

# Without eavesdropper
matching = alice_bases == bob_bases
sifted_key_no_eve = alice_bits[matching]
bob_results_no_eve = alice_bits[matching]  # perfect channel
errors_no_eve = np.sum(sifted_key_no_eve != bob_results_no_eve)

# With eavesdropper (intercept-resend)
eve_bases = np.random.randint(0, 2, N)
eve_results = np.where(eve_bases == alice_bases, alice_bits,
                       np.random.randint(0, 2, N))
bob_results_eve = np.where(bob_bases == eve_bases, eve_results,
                           np.random.randint(0, 2, N))
matching_eve = alice_bases == bob_bases
errors_eve = np.sum(alice_bits[matching_eve] != bob_results_eve[matching_eve])
qber_eve = errors_eve / np.sum(matching_eve) if np.sum(matching_eve) > 0 else 0

categories = ["No Eve\nQBER", "With Eve\nQBER", "Security\nThreshold"]
values = [0, qber_eve * 100, 11]
colors_bar = ["#a78bfa", "#f97316", "#ef4444"]
bars = ax3.bar(categories, values, color=colors_bar, alpha=0.8, width=0.5)
ax3.set_ylabel("QBER (%)", color="white")
ax3.set_title("BB84 QKD Error Rates", color="#c4b5fd", fontsize=14)
for bar, val in zip(bars, values):
    ax3.text(bar.get_x() + bar.get_width()/2., bar.get_height() + 0.5,
             str(round(val, 1)) + "%", ha="center", va="bottom", color="white", fontsize=11)
ax3.tick_params(colors="white")
for spine in ax3.spines.values():
    spine.set_color("#7c3aed")

# Plot 4: Entanglement entropy vs state parameter
ax4 = axes[1, 1]
theta_ent = np.linspace(0.01, np.pi/2 - 0.01, 200)
# State: cos(theta)|00> + sin(theta)|11>
p1 = np.cos(theta_ent)**2
p2 = np.sin(theta_ent)**2
S_ent = -p1 * np.log2(p1) - p2 * np.log2(p2)
ax4.plot(theta_ent * 180 / np.pi, S_ent, color="#a78bfa", linewidth=2)
ax4.axhline(y=1, color="#c084fc", linestyle="--", alpha=0.5, label="Max (Bell state)")
ax4.axvline(x=45, color="#c084fc", linestyle=":", alpha=0.5)
ax4.set_xlabel("Parameter theta (degrees)", color="white")
ax4.set_ylabel("Entanglement entropy (ebits)", color="white")
ax4.set_title("Entanglement of cos(t)|00> + sin(t)|11>", color="#c4b5fd", fontsize=14)
ax4.legend(facecolor="#1a1a2e", edgecolor="#7c3aed", labelcolor="white")
ax4.tick_params(colors="white")
for spine in ax4.spines.values():
    spine.set_color("#7c3aed")

plt.tight_layout()
plt.savefig("output.png", dpi=150, bbox_inches="tight", facecolor="#0a0a0a")
plt.show()
print("Plot saved: Bell inequality violation, BB84 QKD, and entanglement entropy.")

Click Run to execute the Python code

Code will be executed with Python 3 on the server

Conceptual Questions

Q1: Why can't entanglement be used for faster-than-light communication?

Even though measurement of one entangled particle instantaneously affects the other's state, the individual measurement outcomes are random. Without classical communication to compare results, Bob cannot determine what Alice measured. The reduced density matrix ρ_B = Tr_A(ρ_AB) is independent of Alice's measurement choice.

Q2: What does a CHSH value of S = 2.8 mean physically?

It means the correlations between measurement outcomes cannot be explained by any theory where (1) outcomes are predetermined before measurement (realism) and (2) one measurement cannot influence a distant one instantaneously (locality). Nature violates at least one of these classical assumptions.

Q3: How does the no-cloning theorem protect QKD?

An eavesdropper cannot copy quantum states without disturbing them. Any attempt to extract information about the key introduces detectable errors. The QBER threshold of 11% for BB84 accounts for the most general quantum attack strategies.

Further Topics

Open Questions and Frontiers

• Loophole-free Bell tests: While loopholes have been individually and collectively closed, achieving all closures simultaneously with high statistical significance in a single experiment remains a technical frontier. Cosmic Bell tests use quasar light to set measurement bases, pushing the freedom-of-choice loophole back billions of years.
• Quantum networks: Building a global quantum internet requires distributing entanglement over thousands of kilometers via quantum repeaters. Current demonstrations reach ~600 km in fiber and ~1200 km via satellite.
• Entanglement in many-body systems: Understanding the role of entanglement in quantum phase transitions, topological order, and thermalization is a major frontier. The area law of entanglement entropy constrains the efficiency of classical simulation methods.
• Macroscopic entanglement: Creating and verifying entanglement between increasingly massive objects (nanoparticles, mirrors, macroscopic oscillators) tests the boundary between quantum and classical physics.

← Non-Classical Light States Next: Optical Bloch Equations →