Quantum teleportation scheme by selecting one of multiple output ports
read the original abstract
The scheme of quantum teleportation, where Bob has multiple (N) output ports and obtains the teleported state by simply selecting one of the N ports, is thoroughly studied. We consider both deterministic version and probabilistic version of the teleportation scheme aiming to teleport an unknown state of a qubit. Moreover, we consider two cases for each version: (i) the state employed for the teleportation is fixed to a maximally entangled state, and (ii) the state is also optimized as well as Alice's measurement. We analytically determine the optimal protocols for all the four cases, and show the corresponding optimal fidelity or optimal success probability. All these protocols can achieve the perfect teleportation in the asymptotic limit of $N\to\infty$. The entanglement properties of the teleportation scheme are also discussed.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Random dilation superchannel
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an appli...
-
Quantum Advantage in Storage and Retrieval of Isometry Channels
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
-
A resource theory of asynchronous quantum information processing
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the st...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.