The basic one-bit teleportation primitive uses the input as qubit 1 and a fresh quantum ancilla as qubit 2. Apply the Controlled-Z gate and measure qubit 1 in the equatorial qubit measurement basis with angle . If is the result, the normalized post-measurement state on qubit 2 is
Both results have probability one half. For example, writing , the unnormalized branch is . Thus is applied deterministically as a logical gate with known Pauli frame ; a permitted conditional Pauli X gate would remove this byproduct physically.
The literal resource restriction does not need an unstated direct Pauli X gate. A Pauli Z gate can be enacted by applying to the data and a fixed quantum ancilla. Two consecutive angle-zero one-bit teleportations, with results , map an arbitrary current state to . Apply the available to remove the latter factor, up to an irrelevant global phase. This implements a heralded : if , the input is unchanged; if , the required Pauli X gate has been applied.
If the original result is and a physically corrected output is required, repeat this heralded Pauli X correction using controlled-Z and measurements until . Each attempt succeeds with probability one half independent of the input, so it terminates with probability one, using two attempts on average. Only , fixed ancillary quantum states and single-qubit quantum measurements are used. This exact physical correction has no finite worst-case measurement bound; the standard finite deterministic realization is the logical Pauli frame version, which suffices for the later output-simulation parts.
Label the measured vertex of the four-cycle by , its two neighbours by , and the opposite vertex by . The edges are . By the definition of a graph state,
All Controlled-Z gates commute. Conditioning on the computational basis value of vertex , the factors on edges and act on their other endpoints as and , since . The remaining edges form the three-vertex path :
The Born rule gives probability one half for either result. Normalizing proves
This is computational-basis measurement of a graph-state vertex: remove the measured vertex and apply a known Pauli Z gate byproduct to each neighbour. The chosen labels specify precisely which factors occur; any vertex of the square can serve as vertex by relabelling.
The path graph state is . The factor commutes with both the Controlled-Z gates and the quantum measurement of vertex . Treat as the input of one-bit teleportation. The equatorial qubit measurement result therefore gives the normalized state
Here the subscript on expresses the teleported input factor; it is not an extra operation on the already measured vertex. Use to obtain
The exclusive or exponent is equivalent to the printed sum because . The conditional probability of is one half for either , by the one-bit teleportation branch norm. This calculation concerns an equatorial measurement of a graph-state leaf; no third remaining qubit or extra factor is present.
Let the ideal two-qubit output before final quantum measurements be
The PDF places only on the upper wire, followed by the Controlled-Z gate and a quantum measurement in the computational basis on each output wire. Measure vertex of the square in the computational basis, obtaining , then vertex of the surviving path in the fixed equatorial qubit measurement basis at angle , obtaining . Put . The previous part gives .
Commute its Pauli frame through the Controlled-Z gate. Since and commutes with , the actual output is
Finally measure vertices in the computational basis, with raw results . A Pauli X gate flips a computational basis result, whereas a Pauli Z gate changes only its phase. Thus the purely classical correction is
This four-cycle graph-state simulation of an entangle-and-measure circuit reproduces the full joint output distribution, not just each marginal. All measurement bases are fixed beforehand, and no physical byproduct correction is necessary. As a check, the ideal Controlled-Z gate is diagonal in the output basis, so for and for , independently of . The measurement procedure gives exactly these probabilities after its classical relabelling.

Articles by others on the same topic (0)

There are currently no matching articles.