Minimal Port-based Teleportation

TL;DR

This paper introduces a minimal, efficient port-based teleportation protocol for qubits that achieves high success probability and fidelity with fewer resources, and provides methods to compare and convert between protocols.

Contribution

It presents a new minimal PBT protocol that is not reducible from existing protocols, along with methods for protocol comparison and conversion.

Findings

Success probability approaches 1 as N increases.

Fidelity is high, with an error of order 1/N.

Protocol uses N maximally entangled states efficiently.

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.