Part I. Mental Model · Chapter 7
Entanglement Without Faster-Than-Light Myths
Entanglement is the most abused word in quantum computing, and the abuse always follows the same script: correlation mistaken for communication. This chapter defines entanglement in one line, proves it with one circuit, and shows why the strongest correlation in physics still cannot carry a single chosen bit.
In this chapter 7 sections
Reader question. What does it mean for a joint state to be entangled, and why do its correlations not enable controllable signaling?
A pure joint state is entangled when it cannot be factored into subsystem states; Bell-state measurements show correlations across chosen settings, but each party's local marginal remains independent of the other party's setting, so no chosen message is available locally.
- This chapter does not derive every Bell inequality or discuss loophole-free experimental engineering in depth.
- It does not claim all strong correlation is entanglement or that entanglement alone creates algorithmic advantage.
Factorability is the dividing line
Turn the definition into coefficient equations.
Entanglement means the state of a composite system cannot be written as a product of independent subsystem states. The information is in the joint state; the parts, considered separately, carry less than the whole. That is the complete definition, and everything else in this chapter is a consequence of it.
For two qubits, a product state has the form ; each qubit has its own state, and the pair is just the two descriptions stapled together. An entangled state permits no such stapling. The standard first example is the Bell state : measured in the computational basis, the pair comes out 00 or 11, never 01 or 10.
Here is the sentence the myths depend on your skipping: correlation is not controllable messaging. The two outcomes match when compared, but each local outcome is random on its own, and neither party can choose which shared result appears. A mailbox requires choosing what to send; entanglement offers no such knob.
Evidence boundary. Entangled pure states are joint states that cannot be expressed as tensor products of subsystem states. [John Watrous] [Michael A. Nielsen]
Build the Bell pair gate by gate
Trace H and CNOT from |00>.
Two qubits live in a four-dimensional basis; , , , ; and a general state is . If the Bell state were secretly a product, you could write it as , which expands to:
Matching the Bell state forces and while and stay nonzero. But kills either or : if then , and if then . Either way a term that must be nonzero vanishes. No choice of four numbers escapes, so the state is genuinely joint; not approximately, not usually, but always.
This is worth doing once by hand, because it converts entanglement from an aura into arithmetic. The "mystery" is a system of four equations with no solution.
Evidence boundary. Bell-state correlations violate constraints on local hidden-variable explanations under suitable measurement settings. [John S. Bell] [Michael A. Nielsen]
Local marginals remain featureless
Compute each subsystem's distribution without access to the other record.
The headline trap is equating entanglement with faster-than-light messaging. The correlations are real and stronger than any classical shared-variable story can reproduce; Bell tests settle that; but strength of correlation is not control of outcome. Any product, pitch, or plot that routes a chosen message through an entangled pair alone has left the physics.
The quieter trap is treating entanglement as automatically good. Entanglement can be a resource, a symptom, a debugging challenge, or a source of unwanted coupling. When your qubits entangle with the environment instead of each other, the phenomenon has a different name; decoherence; and it is the enemy of everything Part VI of this book builds. The same mathematics, pointed the wrong way, is the main thing hardware teams fight.
Evidence boundary. Quantum theory preserves no-signaling because local marginal statistics do not depend on a spacelike-separated measurement choice. [John Preskill] [John Watrous]
Notation contract: joint basis order 00, 01, 10, 11; subsystem labels A/B; marginals sum over the other subsystem; measurement settings explicitly named.
Correlations appear only in comparison
Show the role of basis choice and classical record matching.
That observation prices everything downstream. Product states are cheap to simulate; highly entangled states are expensive in a straightforward statevector representation, which is both why quantum hardware is hard to imitate classically and why tensor-network methods; classical algorithms that exploit limited entanglement structure; can simulate more than naive counting suggests. Entanglement structure, not qubit count, sets the difficulty.
It also sets the protocol menu. Teleportation, superdense coding, and error correction all spend carefully prepared entanglement alongside classical communication and measurement. In every case the classical leg is load-bearing: remove it and the protocol collapses back to unexplained coincidences.
A signaling test any explanation must pass
Vary one side's setting and check the other marginal.
No-signaling Bell-pair simulator
| Field | Reader-visible record |
|---|---|
| Format | Two-party interactive with exported joint and marginal tables |
| Verification | Automated sweep over both measurement settings verifies normalized joints, expected correlations, and invariant remote marginals. |
| Availability | Source-embedded acceptance record; no separate download is claimed |
{
"artifact": "No-signaling Bell-pair simulator",
"format": "Two-party interactive with exported joint and marginal tables",
"acceptance_test": "Automated sweep over both measurement settings verifies normalized joints, expected correlations, and invariant remote marginals.",
"publication_state": "source-embedded contract and worked fixture"
}
Scope boundary
- This chapter does not derive every Bell inequality or discuss loophole-free experimental engineering in depth.
- It does not claim all strong correlation is entanglement or that entanglement alone creates algorithmic advantage.
Depth commitment. One factorization proof, one circuit trace, two setting tables, and a marginal invariance test.
Practice problem
For a Bell pair, compute joint and marginal probabilities for Z/Z and Z/X settings and state which records reveal correlation.
- Deliverable
- Two probability tables, four marginals, and a one-paragraph signaling verdict.
- Pass condition
- The simulator regenerates all tables and asserts Alice's marginal is unchanged across Bob's settings.
Verification record
Expected solution form. Exact projector calculation plus automated marginal-invariance test.
Model answer. For |Phi+>, Z/Z gives 00 and 11 with probability one half each; both local marginals are uniform. Z/X gives each joint labeled result probability one quarter, again with uniform marginals. Correlation appears only after the two classical records and their settings are compared.
Model result and check. The test compares remote marginals elementwise and fails on any setting-dependent difference.
Acceptance test. The simulator regenerates all tables and asserts Alice's marginal is unchanged across Bob's settings.
Provenance
Sources and review
- John Watrous. The Theory of Quantum Information. Cambridge University Press / University of Waterloo. 2018textbook
- Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press. 2010textbook
- John S. Bell. On the Einstein Podolsky Rosen paradox. Physics Physique Fizika. 1964primary paper
- John Preskill. Lecture Notes for Physics 219: Quantum Computation. California Institute of Technology. 2018graduate lecture notes
The load-bearing claims in the chapter are mapped inline to this registered source set. A citation supports only the bounded claim beside it.