  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.
