Measurement, Interference, and Quantum Protocols

Introduction

Quantum computing differs from classical computing not only because information can be represented by qubits, but also because information is transformed and extracted according to the laws of quantum mechanics. Measurement produces classical outcomes, interference changes the probabilities of those outcomes, and entanglement creates correlations that have no classical equivalent. These three ideas form the operational foundation of many quantum algorithms and communication protocols.

This chapter develops the Born rule for measurement, explains constructive and destructive interference, and applies these ideas to four foundational protocols: Bell-state preparation, quantum teleportation, superdense coding, and the BB84 quantum key-distribution protocol. The emphasis is on circuit reasoning, probability calculations, implementation discipline, and the practical limitations of real devices.

Learning objectives

By the end of this chapter, you should be able to:

1. Calculate measurement probabilities from a quantum state.
2. Explain how amplitudes interfere and distinguish interference from entanglement.
3. Prepare and identify Bell states.
4. Trace the steps of quantum teleportation and explain why classical communication is required.
5. Explain how superdense coding transmits two classical bits using one transmitted qubit and shared entanglement.
6. Describe the BB84 protocol and explain how eavesdropping creates detectable errors.
7. Implement these protocols using a quantum-circuit framework while recognizing noise, sampling, and security limitations.

1. Quantum states, amplitudes, and measurement

A single qubit is described by a normalized state

where α and β are generally complex probability amplitudes. Normalization requires

The quantities |α|² and |β|² are real probabilities. If the qubit is measured in the computational basis, the outcome 0 occurs with probability |α|² and the outcome 1 occurs with probability |β|². The state then collapses to the state corresponding to the observed result.

For n qubits, the computational basis contains 2ⁿ basis states. A general state is

with

Here, x labels a computational-basis bit string and c_x is its amplitude. Measurement gives basis state |x⟩ with probability |c_x|². The sum of probabilities is one because the state is normalized.

Measurement operators

A projective measurement in the computational basis uses projectors

For a state |ψ⟩, the probability of result m is

and, when p(m) is nonzero, the post-measurement state is

These equations apply to ideal projective measurements. More general measurements use positive operator-valued measures, but projective measurement is sufficient for the protocols in this chapter.

Worked example: a single-qubit measurement

Suppose

Since |i| = 1,

and

The relative phase i does not affect a direct computational-basis measurement. It can, however, affect later interference after another gate is applied. This distinction is essential: phase may be invisible in one measurement basis but operationally important in another.

2. Interference: amplitudes before probabilities

Quantum alternatives combine as amplitudes, not as classical probabilities. If two computational paths lead to the same final state, their amplitudes add before the modulus squared is taken. For two complex amplitudes a and b, the resulting probability is

where a* is the complex conjugate of a and Re denotes the real part. The final term is the interference term. It may be positive, negative, or zero.

• Constructive interference occurs when amplitudes reinforce one another.
• Destructive interference occurs when amplitudes cancel.
• Relative phase, not global phase, determines observable interference.

A global phase multiplies the whole state by e^{iφ}; it has no effect on measurement probabilities. A relative phase changes the relationship between components and can change future outcomes.

Hadamard interference

The Hadamard gate acts as

and

Applying H twice gives the identity operation:

The two contributions to |1⟩ cancel, while the contributions to |0⟩ reinforce. This is not a change in total probability; it is a redistribution of probability caused by phase-sensitive addition.

A useful circuit pattern is H–Z–H. Since Z|0⟩ = |0⟩ and Z|1⟩ = −|1⟩,

The phase introduced by Z becomes a measurable bit flip after the second Hadamard. Thus, interference converts phase information into measurement information.

3. Entanglement and Bell states

Two qubits are entangled when their joint state cannot be expressed as a product of two single-qubit states. The four Bell states are

The sign difference is a relative phase. It cannot be observed by measuring only in the computational basis for some states, but it can be revealed by an appropriate basis change.

Bell-state preparation

Starting with |00⟩, apply H to the first qubit and then a controlled-NOT with the first qubit as control and the second as target:

A CNOT maps |a,b⟩ to |a,b ⊕ a⟩, where ⊕ denotes addition modulo 2. Measuring either qubit of |Φ⁺⟩ in the computational basis gives 0 or 1 with equal probability, but the two results always agree. This correlation does not allow faster-than-light communication; each local result remains random.

Bell-state analysis can be implemented by applying CNOT, with the first qubit controlling the second, followed by H on the first qubit, and then measuring both qubits. The four Bell states map to the four computational-basis strings 00, 01, 10, and 11, subject to the chosen qubit-order convention.

4. Quantum teleportation

Quantum teleportation transfers an unknown qubit state from one party, conventionally Alice, to another, Bob. It does not transmit matter, and it does not transmit classical information instantaneously. The protocol requires:

• one unknown input qubit;
• one shared Bell pair;
• two classical bits sent from Alice to Bob;
• two conditional corrections performed by Bob.

Let the input be

and let Alice and Bob share |Φ⁺⟩. The initial three-qubit state is

Alice applies CNOT from the input qubit to her entangled qubit, then H to the input qubit, and measures both of her qubits. The state can be rearranged as

The first two positions in each term are Alice’s measurement bits. Bob’s state is therefore one of four Pauli-transformed versions of |ψ⟩:

Here I is the identity, X exchanges |0⟩ and |1⟩, and Z changes the phase of |1⟩. After receiving the two classical bits, Bob applies the appropriate correction and obtains |ψ⟩.

The protocol does not violate the no-cloning principle: Alice’s original state is destroyed by measurement. It also does not violate relativity because Bob cannot reconstruct the state until the classical bits arrive.

Practical implementation considerations

In a software framework, teleportation requires careful qubit indexing and classical-register control. A typical implementation prepares the Bell pair, entangles the input, measures Alice’s qubits, and applies classically controlled X and Z gates to Bob’s qubit. Some platforms support dynamic classical control directly; others represent the correction logic through conditional operations or deferred measurement in simulations.

5. Superdense coding

Superdense coding uses a shared Bell pair to transmit two classical bits by sending only one qubit. The parties first prepare |Φ⁺⟩. Alice encodes a two-bit message by applying one of four operations to her qubit:

Alice sends her qubit to Bob. Bob applies CNOT with Alice’s received qubit as control and his retained qubit as target, then applies H to the received qubit. Measuring both qubits recovers the two-bit message.

The apparent capacity advantage depends on a resource that was established beforehand: shared entanglement. It does not mean that a single isolated qubit carries two arbitrary classical bits. The protocol illustrates how entanglement and interference can be used jointly for communication.

6. Quantum key distribution: BB84

Quantum key distribution aims to let two legitimate users establish a shared secret key while detecting interference by an eavesdropper. BB84 uses two preparation bases:

• Computational basis: |0⟩ and |1⟩.
• Hadamard or diagonal basis: |+⟩ = (|0⟩ + |1⟩)/√2 and |−⟩ = (|0⟩ − |1⟩)/√2.

Alice randomly chooses a bit and a basis, prepares the corresponding state, and sends the qubit. Bob independently chooses a random basis and measures. After transmission, they publicly compare bases but not bit values. They retain only positions where their bases agree; this is called sifting.

If no noise or eavesdropping occurs, the sifted bits agree. If Eve measures every qubit in a randomly chosen basis and resends her result, she selects the wrong basis with probability 1/2. Conditional on a wrong basis, Bob obtains the wrong bit with probability 1/2. Therefore the expected error rate in the sifted key is

This is the intercept-resend error rate under the idealized assumptions of random independent bases and perfect devices. QBER means quantum bit error rate and is calculated as

A real protocol publicly compares a sample of sifted bits to estimate QBER, performs error correction, and then privacy amplification. Privacy amplification shortens the key so that any partial information potentially available to Eve becomes negligible. A practical security claim requires authenticated classical communication; otherwise a man-in-the-middle attack can impersonate both parties.

Why BB84 detects eavesdropping

The essential principle is measurement disturbance. States from different bases are nonorthogonal. For example,

so a computational-basis measurement cannot perfectly distinguish |+⟩ from |−⟩. Eve must introduce uncertainty and therefore detectable errors when she guesses the wrong basis.

BB84 is not a complete security solution by itself. Device imperfections, biased random-number generators, photon loss, detector vulnerabilities, weak sources, and inadequate authentication can invalidate an implementation. Modern deployments may use decoy states, entanglement-based security proofs, measurement-device-independent designs, or continuous-variable variants.

7. Worked protocol example

Consider an illustrative teleportation experiment in which the unknown state is |+⟩. Alice and Bob prepare |Φ⁺⟩, Alice performs the Bell measurement, and her result is 10. According to the teleportation table, Bob’s state before correction is Z|+⟩ = |−⟩. Bob applies Z and obtains |+⟩. If Bob measures in the computational basis, either result occurs with probability 1/2. If he first applies H and then measures computationally, the result is 0 with probability 1, because H|+⟩ = |0⟩.

This example demonstrates three related ideas. First, teleportation preserves an arbitrary state, not merely a classical bit. Second, the intermediate state at Bob depends on Alice’s classical result. Third, an appropriate basis change converts phase information into a deterministic measurement through interference.

8. Illustrative case: laboratory verification of protocols

Background

A teaching laboratory has access to a cloud quantum processor and a circuit simulator. The aim is to verify Bell correlations, teleportation, superdense coding, and BB84-like basis statistics.

Problem

Initial tests show that Bell-state measurements produce approximately 47% 00, 48% 11, and a small number of other outcomes. Teleportation fidelity is lower than expected, and the measured QBER is 8%.

Analysis

The Bell results are consistent with the expected ideal correlations but indicate noise or readout errors. Teleportation fidelity is affected by the same two-qubit gate errors, measurement errors, and decoherence during the circuit. An 8% QBER cannot immediately be attributed to eavesdropping; it may arise from the physical device, transmission loss, imperfect state preparation, or basis-selection software.

Approach

The students first run the simulator to establish ideal distributions. They then use calibration data, increase the number of shots, randomize circuit execution order, and compare results with and without dynamical decoupling where available. For BB84, they reserve a random test subset of sifted bits, estimate confidence intervals for QBER, and avoid interpreting a single small sample as proof of security.

Outcome

The simulator produces the expected ideal distributions. Hardware results improve after calibration-aware qubit selection and shorter circuits, but residual errors remain. The class concludes that protocol correctness and implementation security are different questions: a mathematically correct circuit may still perform poorly or be insecure on imperfect hardware.

Learning points

1. Measurement results are statistical samples, not exact probabilities from one run.
2. Bell correlations should be compared with an ideal model and an error model.
3. QBER is a diagnostic quantity, not by itself a complete security certificate.
4. Reproducible experiments require documented qubit order, gate sequence, shot count, random seeds where appropriate, and device conditions.

9. Implementation and professional practice

A reliable implementation should follow these practices:

• Write the state convention and qubit-order convention explicitly.
• Test each circuit in an ideal simulator before using hardware.
• Use state-vector calculations for small circuits to inspect amplitudes and shot-based simulations to inspect sampling.
• Separate quantum operations, measurements, classical communication, and conditional corrections.
• Repeat experiments over enough shots to estimate probabilities.
• Record calibration time, noise model, gate set, and software version.
• Distinguish a protocol demonstration from a security proof or production cryptographic system.

For N independent shots in which an event has probability p, the estimated frequency has standard deviation

This binomial approximation assumes independent identically distributed shots. It shows why increasing N improves statistical precision approximately as 1/√N, while it does not remove systematic hardware errors.

10. Limitations, ethics, and contemporary directions

Quantum communication protocols can be misunderstood as automatically secure or automatically faster than classical systems. Security depends on assumptions about devices, randomness, authentication, implementation, and adversarial capabilities. Organizations should not replace deployed cryptographic systems solely because a laboratory protocol works on a simulator.

Quantum networks face photon loss, memory lifetime limits, synchronization problems, imperfect entanglement distribution, and the need for quantum repeaters. Current research includes fault-tolerant quantum networking, device-independent security, measurement-device-independent QKD, photonic integration, and hybrid quantum-classical control.

Responsible practice includes realistic claims, transparent reporting of error rates, protection of experimental data, and recognition that quantum cryptography does not solve endpoint compromise or poor key management. Quantum technologies also have dual-use implications, especially where cryptographic capabilities and infrastructure security are concerned.

Chapter Summary

Measurement converts quantum amplitudes into classical outcomes according to the Born rule. A normalized amplitude c produces probability |c|², and projective measurement changes the state to the observed subspace. Interference occurs because amplitudes add before probabilities are calculated; relative phase can therefore create reinforcement or cancellation.

Bell states demonstrate entanglement and correlated measurement outcomes. Quantum teleportation transfers an unknown state using a shared Bell pair and two classical bits, while superdense coding transmits two classical bits by sending one qubit after shared entanglement has been established. BB84 uses incompatible measurement bases to make eavesdropping detectable through an increased QBER. In every case, correct implementation requires attention to qubit ordering, measurement statistics, noise, authentication, and the assumptions underlying security claims.

Key Terms

Amplitude: A complex number whose squared magnitude contributes to measurement probability.

Born rule: The rule stating that a measurement outcome has probability equal to the expectation value of its projector.

Bell state: One of four maximally entangled two-qubit states.

Basis: A set of states used to represent or measure a quantum system.

Bit: A classical binary information unit.

Bit flip: The X operation that maps |0⟩ to |1⟩ and |1⟩ to |0⟩.

Bloch-sphere phase: The relative angular relationship between components of a qubit state.

CNOT: A controlled-NOT gate that flips the target when the control is 1.

Constructive interference: Reinforcement caused by amplitude addition.

Destructive interference: Cancellation caused by amplitude addition with opposing phase.

Entanglement: A joint quantum state that cannot be written as a product of subsystem states.

Global phase: A common phase factor with no observable effect on measurement probabilities.

Hadamard gate: A gate that creates equal superpositions and changes between computational and diagonal bases.

QBER: The fraction of compared key bits that disagree.

Quantum teleportation: A protocol for transferring an unknown quantum state using entanglement and classical communication.

Relative phase: The phase difference between components of a superposition.

Sifting: Retaining QKD results for which the sender and receiver used compatible bases.

Superdense coding: An entanglement-assisted protocol for communicating two classical bits by transmitting one qubit.

Review Questions

Short Answer Questions

1. State the normalization condition for a single-qubit state α|0⟩ + β|1⟩.
2. What is the difference between global phase and relative phase?
3. How are Bell states prepared from |00⟩?
4. Why are two classical bits required in quantum teleportation?
5. What is QBER and what does it measure?

Long Answer Questions

1. Explain the Born rule and derive the computational-basis probabilities for a general single-qubit state.
2. Explain constructive and destructive interference using the Hadamard gate as an example.
3. Describe quantum teleportation step by step, including the correction table.
4. Explain how superdense coding decodes four possible messages.
5. Describe BB84, including basis selection, sifting, eavesdropping, and privacy amplification.

Analytical / Application Questions

1. A qubit is prepared as (|0⟩ + i|1⟩)/√2. Calculate the computational-basis probabilities and explain how a later gate could reveal the relative phase.
2. Design a simulator experiment that compares ideal Bell-state correlations with noisy hardware results. Specify the measurements, number of shots, and metrics.
3. In an ideal intercept-resend BB84 attack, derive the expected sifted-key error rate and explain which assumptions are required for the result.

Multiple Choice Questions with Answers

Question 1

A qubit is in the state |ψ⟩ = (√3/2)|0⟩ + (1/2)|1⟩. What is the probability of measuring 1 in the computational basis?

A. 1/4

B. 1/2

C. 3/4

D. 1

Correct Answer: A. 1/4

Question 2

Which operation sequence prepares |Φ⁺⟩ from |00⟩?

A. X on qubit 1, then Z on qubit 2

B. H on qubit 1, then CNOT with qubit 1 as control

C. CNOT, then X on both qubits

D. Z on qubit 1, then H on qubit 2

Correct Answer: B. H on qubit 1, then CNOT with qubit 1 as control

Question 3

What is the principal role of the second Hadamard gate in an H–Z–H sequence?

A. It removes normalization

B. It converts phase information into measurable interference

C. It permanently destroys entanglement

D. It performs classical communication

Correct Answer: B. It converts phase information into measurable interference

Question 4

In teleportation, what must Bob receive before applying the appropriate correction?

A. Alice’s unknown quantum state directly

B. Two classical measurement bits

C. A second copy of the Bell pair

D. The measurement apparatus

Correct Answer: B. Two classical measurement bits

Question 5

In superdense coding, how many classical bits can be encoded using one transmitted qubit and one shared Bell pair?

A. One

B. Two

C. Three

D. Four

Correct Answer: B. Two

Question 6

Which BB84 states form the diagonal basis?

A. |0⟩ and |1⟩

B. |00⟩ and |11⟩

C. |+⟩ and |−⟩

D. |Φ⁺⟩ and |Φ⁻⟩

Correct Answer: C. |+⟩ and |−⟩

Question 7

Under ideal intercept-resend BB84, what is the expected sifted-key error rate?

A. 0%

B. 12.5%

C. 25%

D. 50%

Correct Answer: C. 25%

Question 8

Which statement about a global phase is correct?

A. It changes all measurement probabilities

B. It has no observable effect by itself

C. It is equivalent to a bit flip

D. It requires a classical communication channel

Correct Answer: B. It has no observable effect by itself

Question 9

For N independent shots and event probability p, which expression gives the binomial standard deviation of the estimated frequency?

A. p/N

B. √[p(1−p)/N]

C. Np(1−p)

D. √N/p

Correct Answer: B. √[p(1−p)/N]

Question 10

Why does BB84 require authenticated classical communication?

A. To create superposition

B. To prevent a man-in-the-middle attack

C. To increase photon wavelength

D. To eliminate all detector noise

Correct Answer: B. To prevent a man-in-the-middle attack