Fig. 4: Qubit teleportation between non-neighbouring network nodes.
From: Qubit teleportation between non-neighbouring nodes in a quantum network
a, Circuit diagram of the teleportation protocol using notation defined in Fig. 3. m (n) is the number of attempts needed to herald entanglement for the AB (BC) entangled link. See the Supplementary Information for the full circuit diagram. b, Teleported state fidelities for the six cardinal states and their average (Avg.). The grey lines show the expected fidelities from simulations. The dashed lines in b–d represent the classical bound of 2/3. c, Average teleported state fidelity for the different outcomes of the BSM on Charlie. The right-most bar shows the resulting fidelity when no feed-forward operation on Alice would be applied. The numerical values of the bar plots shown in b and c can be found in Extended Data Tables 1 and 2. d, Average state fidelity for a conditional and an unconditional teleportation, for different detection window lengths of the two-node entanglement generation processes. The blue-bordered data point is the same point as shown in b. All error bars represent one standard deviation.
