Minimal Port-based Teleportation

Abstract

There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high probability. We introduce the minimal set of requirements that define a feasible PBT protocol and construct a simple PBT protocol that satisfies these requirements: it teleports an unknown state of a qubit with success probability $p_{succ}=1-\frac{N+2}{2^{N+1}}$ and fidelity $1-O(\frac{1}{N})$ with the resource state consisting of $N$ maximally entangled states. This protocol is not reducible from either the deterministic or probabilistic PBT protocol. We define the corresponding efficient superdense coding protocols which transmit more classical bits with fewer maximally entangled states. Furthermore, we introduce rigorous methods for comparing and converting between different PBT protocols.

26 pages, published version

References in corpus (9)

• A derivation of quantum theory from physical requirements
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum teleportation scheme by selecting one of multiple output ports
• Complexity and entanglement in non-local computation and holography
• Generalized teleportation and entanglement recycling
• Efficient multi port-based teleportation schemes
• Optimality of the pretty good measurement for port-based teleportation
• Some remarks on port-based teleportation
• Optimal Multi-port-based Teleportation Schemes

Cited by in corpus (5)

• On the Duality of Teleportation and Dense Coding
• Quantum teleportation based on the elegant joint measurement
• Port-based entanglement teleportation via noisy resource states
• Asymptotic teleportation schemes bridging between standard and port-based teleportation
• A resource theory of asynchronous quantum information processing