Bell-basis measurement Created 2026-09-29 Updated 2026-10-06
A Bell-basis measurement is the four-outcome projective measurement whose projectors are onto the four Bell states. It jointly measures two qubits and is the sender's measurement in quantum teleportation.
Suppose independent resource pairs have density matrices . An ideal complete Bell-basis measurement, followed by outcome-dependent Pauli gates, produces a chosen Bell state with white-noise visibility : either white-noise input makes the remote pair maximally mixed. If the reported label is reliable with probability and otherwise uniformly random, averaging the erroneous corrections makes that branch maximally mixed too, so . A second independent detector of the same quality during quantum teleportation adds another factor to the teleported Bloch vector.
Distributing one half of through a quantum bit-flip channel produces . Ideal quantum teleportation with error-free classical correction bits induces the same bit-flip map on the input: conjugating the resource error by any Pauli gate correction changes at most its sign. For a pure target the squared quantum fidelity is . This describes noise in resource distribution, not a perfect resource supplied by an independent channel.
Bouwmeester quantum teleportation experiment Created 2026-10-20 Updated 2026-10-25
Dik Bouwmeester and colleagues demonstrated selected-outcome photon-polarization quantum teleportation. An ultraviolet pump traversed a nonlinear crystal twice: one passage supplied an entangled pair, the other the input photon and its trigger partner. The input and one resource photon interfered at a beam splitter; output-detector coincidences selected their antisymmetric Bell state. Narrow filters made their coherence time exceed the pump duration, preserving temporal indistinguishability.
The reported pump pulses were long at ; photons filtered to bandwidth had a quoted coherence time. A polarization analyzer measured the remote output. Trigger-conditioned fourfold coincidences excluded a double-pair background without subtraction. The selected Bell result had ideal probability ; this demonstration did not distinguish and actively correct all four outcomes.[ref]
Classical communication Created 2026-10-07 Updated 2026-10-14
Classical communication transmits a distinguishable classical record, such as measurement bits, between parties. In quantum teleportation it tells the receiver which local correction to apply. Quantum no-signalling prevents shared entanglement alone from transmitting the record. A classical message cannot propagate across a spacelike separation in a relativistic protocol.
Exact quantum teleportation that preserves an arbitrary reference requires at least two classical bits from sender to receiver, even with preshared quantum entanglement. For the essential reduction, encode two classical bits in the four Bell states by Pauli gates on the sender's half of a Bell pair. Teleportation as an identity channel on a reference transfers this half while preserving the encoding. The receiver then has both halves and recovers both bits by a Bell-basis measurement, as in superdense coding.
The classical bit bound itself has a short no-communication theorem proof. For possible messages and possible classical transmissions, let be the receiver's subnormalized conditional density matrix before decoding. The no-communication theorem gives , independent of , so . For each transmission , let be the decoding POVM. Averaging over equiprobable messages,
Perfect decoding of four messages requires , hence at least two classical bits. This applies to the preshared resources of the proposed quantum teleportation protocol as well as the Bell pair used for the encoding.
A quantum teleportation protocol in which a further participant supplies a resource or classical measurement record needed for exact reconstruction of an arbitrary unknown input at the receiver. Without that cooperation, some classical information about the input may remain accessible; control need not mean complete information-theoretic concealment.
Dicke-resource telecloning Created 2026-10-14 Updated 2026-10-20
For odd , a symmetric quantum teleportation resource can encode an unknown qubit into . Begin with , apply a controlled-NOT gate from the input to the sender's resource qubit, apply a Pauli X gate to that resource qubit and a Hadamard gate to the input, and measure those two qubits. The four unnormalized remaining vectors are , , and . Each outcome has probability . Since interchanges and , and acts as logical up to the common phase , local Pauli corrections make the output independent of the result. The one-qubit reduction of Dicke-state superpositions gives
For this distributes imperfect copies, as required by the no-cloning theorem. For it reduces to exact quantum teleportation.
A shared resource enables deterministic exact transmission of an arbitrary unknown qubit using only local operations and classical communication if and only if it can produce a shared Bell pair deterministically by such operations. Sufficiency follows from quantum teleportation. For necessity, prepare a Bell pair locally at the sender and apply the purported transmission protocol to one half: exact identity-channel action leaves a shared Bell pair between the retained reference and the receiver. A separable shared resource cannot satisfy this condition because local operations and classical communication preserve separability.
Charlie's Hadamard basis measurement, Alice's Bell-basis measurement and communicated correction bits give deterministic GHZ-assisted quantum teleportation. Let the unknown input be . Charlie measures in the Hadamard basis and labels by , by . The identity
shows that is conditionally a Bell pair with phase label . Charlie sends that one classical bit to Bob. The procedure for localizing a Bell pair from a GHZ state supplies precisely the missing conditional information; forgetting leaves the mixed reduced state of the preceding part.
Alice performs the usual Bell-basis measurement on . Operationally, she applies , applies , and measures and in the computational basis, obtaining bits . She sends both bits to Bob. To track the correction without a convention ambiguity, conditional on the normalized state on is
Projecting Charlie's factor onto his recorded Hadamard basis state gives Bob, up to the global phase ,
Consequently the inverse Pauli correction is
Bob applies first and second. The measurements on Charlie and on Alice commute because they act on different systems, so deriving the conditional state with Alice's measurement first gives the same protocol as Charlie measuring first. Each triple has probability , independent of the unknown input, and every triple succeeds after correction.
Figure 1.
Three classical bits complete GHZ-assisted teleportation
. Original protocol diagram for a previously distributed GHZ resource on A, B and C. Alice performs CNOT from Q to A, then H on Q and Z-basis readout of Q and A. Charlie performs H followed by Z-basis readout, equivalent to X-basis measurement. Bob receives s, t and c, applies X to the power t, then Z to the power s XOR c. The dashed lines carry classical bits. Details.
This uses one previously shared GHZ state, two classical bits from Alice and one from Charlie, with no quantum transmission during the transfer. The standard Bell-measurement/Pauli-correction mechanism was established in the original quantum teleportation proposal.[ref] Here Charlie's record supplies the Bell-pair phase, giving a controlled quantum teleportation protocol. Alice's input is consumed by her measurement; Bob reconstructs its state without learning and without making a second surviving copy.
Combine the hypothetical protocol with superdense coding. Before a message is chosen, Alice and Bob share a further Bell pair , with at Alice and at Bob, in addition to any resources needed for the hypothetical quantum teleportation protocol. To encode two classical bits , Alice applies the Pauli gates , preparing
The four choices are the four mutually orthogonal Bell states. Alice now uses the hypothetical protocol to teleport to Bob using only one classical bit. Its assumed preservation of the joint quantum state gives Bob both and in
Bob performs a Bell-basis measurement. Explicitly, a controlled-NOT gate , followed by a Hadamard gate on , gives
A computational-basis measurement therefore recovers both message bits with certainty after only one transmitted classical bit. The initial Bell pairs are shared before the message is chosen and carry no message themselves. This proves the classical communication lower bound for exact qubit teleportation: a perfect protocol preserving an external reference needs at least two transmitted classical bits.
Write the arbitrary initial pure state as
The reference vectors need not be normalized or orthogonal. By linearity, the same quantum teleportation calculation, with the identity operator on , gives the post-gate quantum state
Thus each outcome still has probability . Bob's Pauli gate correction leaves the normalized joint quantum state
All operations act trivially on , so the result is independent of its holder or location. This establishes teleportation as an identity channel on a reference, preserving quantum entanglement with the untouched reference. Since every corrected branch is the same, discarding the classical outcomes also leaves the required joint density matrix.
Alice holds the input qubit in and her half of a shared Bell pair ; Bob holds . Alice applies a controlled-NOT gate , then a Hadamard gate on . In the system order , the initial quantum state is
After these two quantum gates, direct expansion yields the quantum teleportation identity
Alice performs computational-basis measurements on , and sends the two classical bits to Bob. Each outcome has probability , independently of the input pure state. Bob applies the indicated Pauli gates: first , then , so his total correction is . In every branch,
This proves exact quantum teleportation using one Bell pair and two classical bits. Alice's original qubit has been measured; the protocol transfers the quantum state without leaving her another copy.
Let the unknown input qubit be , with . Alice holds , Bob holds , and the shared Bell pair is . All three-qubit strings below use the order . Initially,
The Bell-basis teleportation identity gives
Thus a perfect Bell state analyzer on Alice's two qubits identifies the Pauli operator affecting Bob's quantum state.
To display the intermediate three-qubit states explicitly, realize that Bell-basis measurement by a controlled-NOT gate , a Hadamard gate on , and two computational-basis measurements. After the controlled-NOT gate,
After the Hadamard gate,
Measuring gives with probability for each outcome, independently of . Conditional on that result, the normalized three-qubit post-measurement state is
If the Bell state analyzer is instead regarded as an ideal direct projective measurement preserving the measured qubits, replace here by the corresponding Bell state; Bob's factor is identical. A destructive optical analyzer records the same label but absorbs Alice's photons.
Alice sends the two classical bits to Bob. During transmission the above conditional three-qubit state is unchanged. Bob then applies the inverse Pauli operator :
The final conditional three-qubit state is therefore . The protocol transmits two classical bits per teleported qubit, consuming one shared Bell pair. Without Alice's record Bob averages over four Pauli operators and has density matrix , so quantum teleportation respects the no-communication theorem. Alice's input has been measured and is no longer an independent copy, consistent with the no-cloning theorem.
Label the unknown input , Alice's resource photon , and Bob's resource photon . First distribute photon through the channel while keeping photon with Alice; at this leaves the perfect shared Bell state . When the input arrives, the three-qubit state is
Alice applies , giving
She next applies , producing
These two gates followed by computational measurement implement a perfect Bell state analyzer. For outcome the normalized conditional state is , with probability . Alice sends the two classical bits ; Bob applies , recovering exactly. Averaging before reception of the bits gives Bob , independent of the input, so this protocol provides no faster-than-light communication.
For , directly sending the original qubit is already perfect. Quantum teleportation therefore has no fidelity advantage in this ideal case and consumes a shared entangled pair plus classical communication. Its operational advantage is that entanglement can be distributed beforehand: once the unknown input appears, only classical information need travel, and the original input photon need not itself propagate to Bob. The Bell measurement consumes the input; it does not create a second copy.
Figure 1.
Quantum teleportation corrections and restricted superdense coding readout
. Original teleportation circuit with the distributed resource, two measurement bits and conditional corrections, beside the four Bell-state computational-basis outcome probabilities. The right panel describes direct measurement without a two-qubit Bell decoder, not measurement after an unrestricted decoding circuit. Details.
After the first Bell-basis measurement and the announced correction, the shared Werner state has visibility . Ideal quantum teleportation through that resource is the depolarizing channel
One way to see this is to separate the singlet branch, which teleports perfectly with the appropriate known correction convention, from , which has no correlations and yields .
The additional Bell-basis measurement at Alice's station has its own independent reliable branch of probability . In its random-label branch the correction averages the four Pauli gates, again giving . Hence the actual teleported density matrix is
On sifted BB84 rounds, Bob measures in Alice's preparation basis. The preserved component gives the correct bit with certainty; the maximally mixed component gives an error with probability . Therefore
For it vanishes; if either parameter is zero it is . The result presumes successful full Bell-basis measurement outcomes and independent stated imperfections, without extra loss, polarization drift or dark counts.
The no-cloning theorem states that no fixed deterministic quantum operation can perfectly duplicate every unknown pure state. For a unitary copier with a fixed blank, suppose it cloned two normalized vectors . Preservation of inner products would give , impossible for a nonorthogonal distinct pair with overlap strictly between zero and one in modulus. Including an environment does not help: its final overlap has modulus at most one, so one would require . Thus a universal perfect copier is impossible. Orthogonal known alternatives do not contradict this restriction.
Label the three qubits as input , Alice's entangled qubit and Bob's qubit . Initially their joint state is
The controlled-NOT gate from to changes this to
Apply and to the first qubit and group by Alice's two computational-basis outcomes. The result is
In expanded form the last two Bob factors are and . Their Alice labels must be and ; the repeated labels in the source are printing errors.
Alice measures her two qubits and sends the two classical bits to Bob. Each outcome has probability and Bob's conditional state is . He applies to recover the input, up to physically irrelevant global phase. Explicitly the corrections for are . This is quantum teleportation: Alice's input is consumed by measurement, so no second surviving copy is created. Before her classical message, Bob's reduced density operator is , independent of the input, so the protocol also supplies no faster-than-light communication.
A measurement in quantum mechanics with outcomes is specified, in the single-operator-per-outcome description, by linear operators satisfying . Its effects form a positive operator-valued measure. The two measurement postulates are the Born rule for outcomes and the conditional state update:
For a density operator the corresponding formulas are and . More general quantum instruments have multiple operators for each outcome and sum these terms. For a projective measurement of an observable , take ; the outcome value is and the postmeasurement state lies in its eigenspace. A POVM alone specifies probabilities, whereas the measurement operators or instrument also specify the backaction.
For quantum teleportation, Alice and Bob initially share the Bell pair . Alice also holds the input , with . The shared entanglement is a resource; the two transmitted classical bits alone could not transfer an arbitrary unknown quantum state.
Alice applies a controlled-NOT gate with as control and as target, then a Hadamard gate to . Starting from , direct expansion gives
For example, the four receiver vectors are , , , and . Thus the gate calculation fixes the ordering of the Pauli corrections, including the last branch's sign.
Alice measures in the computational basis, obtaining . The Born rule gives each outcome probability , independent of the input amplitudes. Bob's normalized conditional state is . Alice sends the two outcome bits. Bob applies the inverse, , and hence
The same circuit is a Bell-basis measurement on Alice's two qubits, expressed using ordinary gates followed by computational-basis measurements. It restores the state without Alice or Bob knowing .
By linearity, the calculation also holds when the input is entangled with a reference: each outcome has branch map , and after correction every branch is one-half of the identity map. Summing the four corrected density operators gives exactly the original input density operator, with all reference correlations preserved. This is teleportation as an identity channel on a reference. Without the two classical bits Bob must average the four uncorrected states, giving , so the process cannot signal before the message arrives. The Bell pair is consumed and Alice retains no copy of the unknown state, in accordance with the no-cloning theorem.
Let be Alice's unknown qubit, with pure state . Alice and Bob initially share the Bell state . Alice holds and Bob holds . Define the Bell basis
Expanding in this orthonormal basis gives the Bell-basis teleportation identity
For example, the last branch on is , which is ; the ordering of the Pauli operators therefore matters.
Alice performs a projective measurement in the Bell basis on her two local qubits. Each outcome has probability , independent of the unknown amplitudes. She encodes the four possible outcomes as two classical bits and sends them to Bob. For outcomes , respectively, Bob applies the local unitary operations
These are inverses of the corresponding branch Pauli operators, so Bob obtains exactly the unknown input qubit in every branch. Using instead of as the last correction also succeeds up to an irrelevant overall phase. Alice need not know or . Every quantum operation is local to one of the parties, and the only transmitted information is the two-bit classical outcome. The shared Bell pair is consumed.
Before the message arrives, Bob's density operator is
so no unknown-state information is available without the classical communication. Alice's original qubit has been included in the destructive Bell-basis measurement; the protocol creates no extra copy. Since the corrected transformation is the identity on every input vector and is linear, it also preserves entanglement with an external reference and transfers mixed inputs. Thus this is deterministic quantum teleportation, using precisely one shared maximally entangled Bell pair, two classical bits, and local operations.