Source extract: users.physics.ox.ac.uk/~Foot/C2/pdf/C22005Q7.pdf
The year is attributed from the preserved Oxford support-page record; it is not printed on the held page.
TODO: The remainder of this historical paper is not held. Only the supplied question material is covered.
The printed opening block offers a choice of two protocols for 8 marks in total. All three choices are solved here. Sections 1 and 2 below identify the subsequent unlettered blocks, worth 10 and 7 marks respectively; these section numbers are navigation labels.
In quantum dense coding, a shared Bell pair lets Alice send two classical bits by transmitting one qubit. Use photon polarization as the computational basis, , , and define the Bell statesAlice and Bob initially share . Alice encodes a two-bit message by applying the Pauli operator to her qubit:The last minus sign is a global phase. Alice transmits her photon to Bob, who now holds both qubits and uses a Bell-basis measurement to identify the message. The four Bell states are orthogonal, so an ideal Bell state analyzer decodes them without error. The resource cost is one previously shared Bell pair and one transmitted qubit per two classical bits; the shared quantum entanglement is consumed. Before transmission Bob's reduced density matrix is for every message, consistent with the no-communication theorem.
The BBO crystal supplies the polarization-entangled photon pair. An ultraviolet laser pumps this nonlinear optical crystal; spontaneous parametric down-conversion produces signal and idler photons with and phase matching . In a noncollinear type-II phase matching arrangement, collect the intersections of the two emission cones. The alternatives and must be indistinguishable in arrival time, spectrum and spatial mode. Compensation of birefringence and adjustment of the relative quantum phase then give ; a local Pauli X gate converts it to . Half-wave plates and other waveplates implement Alice's Pauli gates. The BBO is the pair source; the message is encoded subsequently by the local optical elements.[ref]
New High-Intensity Source of Polarization-Entangled Photon Pairs by Paul G. Kwiat and others. 1995, Figures 1 and 2: intersecting type-II emission cones and compensation; Table I: four Bell states
A basic passive linear optics Bell state analyzer with no extra resources identifies only two of the four polarization Bell states unambiguously. Thus the ideal two-bit capacity presupposes complete Bell-basis measurement; that basic optical implementation alone does not attain it deterministically.
In entanglement swapping, start with independent Bell pairs . Send qubits 2 and 3 to a central Bell state analyzer, retaining 1 and 4 at separate endpoints. Reordering the tensor product factors to group 23 and 14 gives the identityConsequently each ideal Bell-basis measurement outcome has probability and projects 14 onto the corresponding Bell state, even though those two photons have never interacted. Communicating the two-bit result permits an endpoint Pauli gate to convert every outcome into the same chosen Bell pair. Without that record, the endpoints have , a product state, rather than a known entangled state.
The optical Bell state analyzer overlaps photons 2 and 3 at a balanced beam splitter, with matched spatial modes, spectra and arrival times, and resolves the output photon polarizations using polarizing beam splitters and single-photon detectors. Two-photon interference maps Bell states to different output patterns. The antisymmetric gives one photon in each output with opposite polarizations. The symmetric gives two opposite-polarization photons in the same output; the two polarization detectors there can resolve this pattern. The states give same-polarization pairs and remain mutually ambiguous in this basic setup. The detected pattern therefore heralds a particular endpoint Bell state. With ideal detection this arrangement succeeds unambiguously on two of four equally likely inputs, with probability ; the successful events can be selected. A complete analyzer would accept all four outcomes. The endpoint quantum entanglement is conditional on the measurement record, so it enables no instantaneous signalling.[ref]
Experimental Entanglement Swapping: Entangling Photons That Never Interacted by Jian-Wei Pan and others. 1998, experimental Bell projection and conditional endpoint correlations
For quantum key distribution with Bell pairs, a source distributes one photon to Alice and its partner to Bob. One implementation is the Ekert protocol, using the spin singlet state . Each party independently chooses a polarization measurement setting after distribution. Equal settings give opposite outcomes; Bob reverses his outcome-to-bit assignment so these rounds give matching random bits. Other setting pairs test a Bell inequality, with ideal spin singlet state correlation for the corresponding Bloch sphere axes. The optical polarizer angles correspond to twice those angles on the appropriate Bloch sphere great circle.
Over an authenticated public classical channel, Alice and Bob announce settings and detection times, select coincident detection rounds, and perform key sifting. They reveal a test sample to estimate the quantum bit error rate and the chosen Bell inequality signal, discarding all revealed bits. Excess disturbance causes an abort. Otherwise information reconciliation makes the retained strings agree and privacy amplification shortens them to remove an adversary's residual information, including information disclosed during reconciliation. The tested quantum entanglement supplies correlations unavailable to an independently prepared classical mixture; a security claim also requires stated detector and sampling assumptions.[ref]
Quantum cryptography based on Bell's theorem by Artur K. Ekert. 1991, entanglement-based key distribution and Bell-correlation test
Each photon polarization analyzer uses a setting-dependent waveplate followed by a polarizing beam splitter. A single-photon detector on each output converts the routed photon into an electrical click, recording the outcome and its time. For example, a single-photon avalanche diode is a reverse-biased photodiode operated above breakdown: absorption creates a charge carrier, impact ionization triggers an avalanche, and the resulting pulse is registered. A quenching circuit lowers the bias to stop the avalanche and then resets the device. The detector dead time during recovery limits the count rate; dark counts produce false clicks, and imperfect detection loses rounds. The polarization information comes from the preceding analyzer, while the detector registers which output fired. Coincidence timing associates Alice's and Bob's records with the same emitted pair. [ref]
https://www.thorlabs.co.jp/images/Catalog/V21/V21_7_LightAnalysis.pdf. Thorlabs, Light Analysis catalogue, Single Photon Counter Modules: Geiger-mode operation, active quenching, blind time and dark counts
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 givesThus 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 isIf 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.
For teleportation with an ambiguous Bell-state phase label, write . The Bell-basis measurement outcomes and each occur with probability . In either case a correct guess gives Bob , while the wrong guess differs by the Pauli Z gate and gives . The other two Bell states are identified correctly. Since Alice guesses each ambiguous label with probability , the overall wrong-correction probability is . Averaging over the actual quantum measurement outcome and her guess gives the phase-flip channelConditional only on an ambiguous analyzer result, the output is ; that conditional channel has weight in the displayed unconditional result. There is no rejection of those rounds.
Use the teleportation fidelity for a pure state target, namely the squared quantum fidelityThis compares the input with the resulting mixed state; averaging state vectors before forming a density matrix would give a different, incorrect answer. Direct substitution givesThus the maximum is , attained by and up to a global phase, because these are eigenstates of the Pauli Z gate. The minimum is , attained by every equal-weight quantum superpositionon the equator of the Bloch sphere. The unsquared quantum fidelity is if that alternative convention is used. No average over different input quantum states is needed for the requested state-dependent answer.
The three printed unlettered blocks are identified below by navigation labels 1, 2 and 3. Their mark allocations are 10, 10 and 5 respectively.
A universal quantum gate set can implement any unitary operator on any finite number of qubits, exactly when arbitrary continuous gate parameters are allowed, or to arbitrary accuracy with a suitable finite gate alphabet. More precisely, for every target and there is a finite quantum circuit with in operator norm. This ignores only an overall global phase of the complete operation. Universality lets a fixed collection of controllable elementary operations run arbitrary quantum algorithms rather than requiring a different physical interaction for each algorithm.
All single-qubit unitary gates, together with the controlled-NOT gate between selectable pairs, form an exact universal quantum gate set. One way to see sufficiency is to eliminate entries of a finite unitary matrix by two-level rotations between computational basis vectors; these rotations decompose into controlled single-qubit rotations, which in turn decompose into single-qubit gates and controlled-NOT gates. Single-qubit gates alone preserve product states and cannot supply general quantum entanglement. A finite approximate universal example is the Hadamard gate, the T gate , and the controlled-NOT gate; finite exact words over a finite alphabet cannot represent every continuously parameterized unitary operator exactly.
Distinguish the Hamiltonian operator from the Hadamard gate . For the printed collisional phase gate,As written, has units of energy. The Schrödinger equation givesbecause only has a nonzero energy eigenvalue. In the ordered computational basis , defineIf an interaction strength is instead quoted as an angular frequency , the Hamiltonian operator is and . An alternative definition with would have . The minus sign above follows the usual time-evolution operator convention. At these conventions give the same .
For the quantum circuit, use on the first qubit to move the selective minus sign from to :Conjugating the target of this Controlled-Z gate by the Hadamard gate gives the required controlled-NOT gate:The rightmost matrix acts first. Thus the network applies , then , then , and maps to , where is exclusive or.
Controlled-NOT from the printed collisional phase gate
. Time runs from left to right. Pauli X gates act on the first wire and Hadamard gates on the second, before and after the selective phase gate. The phase gate changes the sign of 01 only. Details.Define the Hadamard basis and write . After the two-qubit quantum state isApplying the Hadamard gate to the first qubit gives the normalized quantum stateFor , , soThe first is a product state. The second is exactly the minus Bell state in the printed phase gate convention; its reduced density matrices are .
For three qubits, let use the ordered pair and the ordered pair . The two diagonal quantum gates commute. For their action before the final Hadamard gates isIf is even this is , and gives . If is odd, group the quantum superposition by the middle qubit:Since and , the final states areThe odd case is a GHZ state: each individual qubit has reduced density matrix , and it is related to by the local Pauli gates . Conversely, applying those gates converts to that standard form. They have not been applied in the printed network, so the actual output used in the next part is .
Keep the actual odd- GHZ state from the preceding calculation. Resolving its first qubit in the Hadamard basis givesThus the outcome leaves and the outcome leaves , each with probability . Conditional on a known result the remaining qubits share a maximally entangled state.
When the result is not revealed, the appropriate density matrix is the probability-weighted mixture from a nonselective quantum measurement:The cross terms cancel. The displayed convex combination of product states proves directly that this is a separable quantum state. It still has perfect computational-basis measurement anticorrelation, so it is not itself a product state. It also equals the partial trace , as required by the no-communication theorem: a local quantum measurement with an unobserved outcome cannot change the remote reduced density matrix.
Articles by others on the same topic
There are currently no matching articles.
