Entanglement in Quantum Information

Quantum information uses entanglement as a resource for tasks involving communication, computation, cryptography, error correction, and networks. This volume supplies the structural language: tensor products, reduced states, Bell states, Schmidt decompositions, entanglement measures, and LOCC.

The full resource theories and protocols belong in Quantum Information and Computation. Information-Theoretic Foundations routes operational questions among carrier, state, entropy, entanglement-measure, process, and resource owners; this page retains the structural entanglement bridge without taking over detailed circuit identities, capacity theorems, security proofs, or fault-tolerance constructions.

The guiding distinction is:

$$\text{definition of entanglement} \quad\neq\quad \text{operational resource theory} \quad\neq\quad \text{specific protocol}.$$

The first is owned by this volume. The second and third use this volume as their input.

Qubits and Registers

A qubit is a two-dimensional quantum system with Hilbert space $\mathbb C^2$. An $n$-qubit register has

$$\mathcal H_n = (\mathbb C^2)^{\otimes n}.$$

The computational basis is

$$\{ \lvert b_1b_2\cdots b_n\rangle : b_j\in\{0,1\} \}.$$

This tensor-product structure is what makes entanglement possible. A two-qubit pure state

$$\lvert\psi\rangle = \sum_{i,j=0}^{1} C_{ij}\lvert ij\rangle$$

is a product state exactly when the coefficient matrix has rank one. Otherwise it is entangled.

Quantum information often packages this same structure into circuits. A one-qubit gate is local relative to a chosen register split. A two-qubit gate can be local or nonlocal depending on which subsystems it couples. Entangling gates are valuable because local operations alone cannot create entanglement from product inputs.

Bell Pairs and Ebits

The standard Bell pair

$$\lvert\Phi^+\rangle = \frac{1}{\sqrt2} \left( \lvert00\rangle+\lvert11\rangle \right)$$

has maximally mixed one-qubit reductions:

$$\rho_A = \rho_B = \frac12 I.$$

Its entanglement entropy is one bit:

$$S(\rho_A) = 1 \quad \text{bit}.$$

One maximally entangled two-qubit pair is called one ebit. The ebit is a unit of bipartite pure-state entanglement, much as a bit is a unit of classical information. It is not a new particle or a new observable; it is a resource unit defined relative to a bipartite tensor-product split.

Bell pairs are the cleanest examples, but quantum information uses many other entangled states: partially entangled pairs, GHZ states, graph states, stabilizer states, cluster states, continuous-variable squeezed states, and noisy mixed states. The right state depends on the protocol and noise model.

Teleportation Preview

Quantum Teleportation uses shared entanglement plus classical communication to simulate the transfer of an unknown qubit state. In resource shorthand,

$$1\ \text{ebit} + 2\ \text{classical bits} \longrightarrow 1\ \text{qubit transmission}.$$

This notation is not an equation of physical particles. It is resource accounting: if Alice and Bob already share one Bell pair, then Alice can perform a Bell-basis measurement, send two classical bits, and Bob can apply a Pauli correction to recover the input state.

The protocol does not transmit information faster than light. Bob needs Alice’s classical bits before he knows which correction to apply. The entanglement supplies nonlocal correlation; the classical message supplies the causal record.

For this volume, the important ingredients are:

• a Bell pair as a shared entangled state;
• a Bell-basis measurement as a joint measurement;
• conditional states after measurement;
• local Pauli corrections;
• LOCC as the allowed operational setting.

The detailed Bell-basis identity, circuit proof, reference-system test, no-signaling argument, and fidelity benchmarks belong to the canonical Quantum Teleportation page.

Superdense Coding Preview

Superdense Coding reverses the resource viewpoint. If Alice and Bob already share one Bell pair, then Alice can encode two classical bits by applying one of four local Pauli operations to her qubit and sending that qubit to Bob:

$$1\ \text{ebit} + 1\ \text{qubit transmission} \longrightarrow 2\ \text{classical bits}.$$

The algebra is the local-Pauli labeling of Bell states:

$$\begin{array}{ccl} I\otimes I &:& \lvert\Phi^+\rangle,\\ Z\otimes I &:& \lvert\Phi^-\rangle,\\ X\otimes I &:& \lvert\Psi^+\rangle,\\ XZ\otimes I &:& \lvert\Psi^-\rangle, \end{array}$$

up to harmless global phases. Bob can distinguish the four Bell states by a Bell-basis measurement after receiving Alice’s qubit.

The resource accounting includes the shared Bell pair prepared in advance. Dense coding does not say that an isolated qubit always carries two classical bits. The canonical protocol page gives the circuit identity, orthogonality proof, capacity interpretation, and noisy-resource analysis.

Entangling Gates

An entangling gate is a unitary operation that can turn at least one product input into an entangled output. A standard example is Hadamard followed by CNOT:

$$(H\otimes I)\lvert00\rangle = \frac{1}{\sqrt2} \left( \lvert00\rangle+\lvert10\rangle \right),$$

and then

$$\operatorname{CNOT} (H\otimes I)\lvert00\rangle = \frac{1}{\sqrt2} \left( \lvert00\rangle+\lvert11\rangle \right) = \lvert\Phi^+\rangle.$$

Local one-qubit gates can rotate, rephase, or relabel entanglement, but they cannot create it from a product state. Nonlocal gates, interactions, or measurements with appropriate conditioning are needed to generate entanglement between registers.

This distinction is central in circuit models, measurement-based computation, and hardware design. Entanglement is not the only ingredient in quantum computational advantage, but it is one of the structural resources that separates genuinely multiparty quantum evolution from independent one-qubit dynamics.

Error Correction and References

Quantum error correction can be understood through entanglement with a reference system. Imagine a logical system $L$ entangled with an inaccessible reference $R$. A good code protects the information in $L$ by preserving the joint correlations between $R$ and the encoded system despite noise.

This viewpoint avoids a common misconception: a code is not just preserving a list of possible basis states. It must preserve arbitrary superpositions, and therefore it must preserve entanglement with external systems. If a noise process destroys the entanglement between the encoded system and a reference, it has destroyed quantum information even if some classical labels remain recoverable.

Stabilizer codes, graph states, syndrome measurements, and fault-tolerant gates all use entanglement structure, but their detailed theory belongs to quantum information. This volume supplies the background: tensor products, local measurements, conditional states, stabilizer-state previews, and reduced density operators.

Distillation and Noisy Entanglement

Realistic shared states are noisy. A mixed state may be entangled but not close to a Bell pair. Entanglement distillation asks whether many noisy shared copies can be transformed by LOCC into fewer high-fidelity Bell pairs.

Schematically,

$$\rho_{AB}^{\otimes n} \xrightarrow{\ \operatorname{LOCC}\ } \lvert\Phi^+\rangle^{\otimes m} \quad \text{approximately}.$$

The rate $m/n$ depends on the state and on the allowed protocols. Some entangled mixed states are not distillable under standard assumptions; these are called bound entangled states. This is one reason mixed-state entanglement is much richer than pure-state Schmidt entropy.

For this volume, the key point is operational: LOCC cannot create entanglement from separable inputs, but it can manipulate entanglement already present in noisy states. Entanglement Distillation owns the recurrence and hashing protocols, their Bell-error maps, and the required acceptance-and-yield accounting. Distillation, dilution, and entanglement cost are quantum-information topics built on the structural fact developed here.

Quantum Networks

Quantum networks distribute entanglement between spatially separated nodes. The basic operations include:

• preparing entangled links;
• storing quantum states in memories;
• performing local measurements at intermediate nodes;
• sending classical heralding signals;
• applying local corrections conditioned on those signals.

Entanglement Swapping is the simplest network primitive. Suppose $A$ is entangled with $B$, and $C$ is entangled with $D$:

$$\lvert\Phi^+\rangle_{AB} \otimes \lvert\Phi^+\rangle_{CD}.$$

A Bell-basis measurement on $B,C$ can conditionally prepare an entangled state of $A,D$, even though $A$ and $D$ did not directly interact. The conditioning information is classical, so again there is no faster-than-light signaling.

Network protocols add engineering and noise questions: losses, heralding rates, memory lifetimes, purification, routing, and trust assumptions. This volume contributes the state language; the protocol analysis belongs to quantum communication.

What This Page Owns

This page owns the bridge from structural entanglement to quantum-information uses. It does not own:

• the full teleportation, superdense-coding, or entanglement-swapping protocol derivations;
• quantum channel capacity theorems;
• cryptographic security proofs;
• stabilizer-code construction details;
• fault-tolerance thresholds;
• network repeater architectures.

When those pages exist, this page should point to them. Until then, it should keep the resource map clear and avoid presenting protocol sketches as complete theories.

Common Mistakes

• Treating entanglement as a signal that can transmit controllable information by itself.
• Saying teleportation moves matter rather than transferring an unknown quantum state using shared entanglement and classical communication.
• Ignoring the pre-shared Bell pair in dense-coding resource accounting.
• Assuming every entangled mixed state is easily distillable.
• Thinking local unitaries create entanglement because they can change the appearance of a state.
• Treating quantum error correction as classical repetition coding.
• Discussing network entanglement without the classical heralding information.

Cross-Links

• Quantum Information and Computation
• Quantum Teleportation
• Superdense Coding
• Entanglement Swapping
• Quantum Key Distribution
• Entangled States
• Bell States
• Classical Correlation versus Entanglement
• Local Unitary Equivalence
• Interactions and Coupling Terms
• Partial Trace
• Conditional States
• Schmidt Decomposition
• Entanglement Entropy
• Entanglement Measures
• Concurrence for Two Qubits
• Entanglement Witnesses
• LOCC Preview
• GHZ States
• Graph States
• Stabilizer States Preview
• Formula Sheet

References

• M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.
• J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018.
• M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press, 2017.
• C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states”, Physical Review Letters 69, 2881-2884, 1992, doi:10.1103/PhysRevLett.69.2881.
• C. H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels”, Physical Review Letters 70, 1895-1899, 1993, doi:10.1103/PhysRevLett.70.1895.
• C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, “Mixed-state entanglement and quantum error correction”, Physical Review A 54, 3824-3851, 1996, doi:10.1103/PhysRevA.54.3824.
• R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, “Quantum entanglement”, Reviews of Modern Physics 81, 865-942, 2009, doi:10.1103/RevModPhys.81.865.

Exercises

1. Bell-pair generation. Show that applying $H$ to the first qubit of $\lvert00\rangle$ and then CNOT gives $\lvert\Phi^+\rangle$.

Solution

First,

$$(H\otimes I)\lvert00\rangle = \frac{1}{\sqrt2} \left( \lvert00\rangle+\lvert10\rangle \right).$$

CNOT flips the second qubit when the first qubit is $1$, so

$$\operatorname{CNOT} \frac{1}{\sqrt2} \left( \lvert00\rangle+\lvert10\rangle \right) = \frac{1}{\sqrt2} \left( \lvert00\rangle+\lvert11\rangle \right) = \lvert\Phi^+\rangle.$$

2. One ebit. Compute the reduced state of either qubit of $\lvert\Phi^+\rangle$ and its entropy in bits.

Solution

Tracing out either qubit gives

$$\rho_A = \frac12 \lvert0\rangle\langle0\rvert + \frac12 \lvert1\rangle\langle1\rvert = \frac12 I.$$

The eigenvalues are $1/2$ and $1/2$, so

$$S(\rho_A) = -2\left( \frac12\log_2\frac12 \right) = 1.$$

The Bell pair has one ebit of entanglement.

3. Why teleportation needs a classical message. In one sentence, explain why teleportation does not allow faster-than-light signaling.

Solution

Bob’s output is not known to be the desired state until Alice’s two classical bits arrive and specify the required Pauli correction, so the usable information is limited by the classical communication channel.

4. Local gates. Can local one-qubit unitaries turn $\lvert00\rangle$ into a Bell state? Explain.

Solution

No. Local unitaries have the form $U_A\otimes U_B$, so

$$(U_A\otimes U_B)\lvert00\rangle = (U_A\lvert0\rangle)\otimes(U_B\lvert0\rangle),$$

which is still a product state. Creating a Bell state from $\lvert00\rangle$ requires a nonlocal entangling operation such as CNOT after a local superposition has been prepared.

5. Entanglement swapping. Why can a Bell-basis measurement on $B,C$ entangle $A,D$ in the state $\lvert\Phi^+\rangle_{AB}\otimes\lvert\Phi^+\rangle_{CD}$ without signaling from $B,C$ to $A,D$?

Solution

The Bell-basis measurement creates outcome-dependent conditional states. Once the classical outcome is known, parties can assign the corresponding entangled state to $A,D$ and apply any needed local correction. Before the classical outcome is received, the remote parties do not have a controllable signal or a known pure Bell state. The protocol uses entanglement plus classical conditioning, not faster-than-light communication.