Port-Based Teleportation: Theory & Applications

• Port-based teleportation is a quantum protocol that uses multiple entangled pairs to transmit an unknown state by selecting one of Bob's ports without additional correction operations.
• The protocol's performance is characterized by metrics such as success probability and entanglement fidelity, with optimized schemes achieving error scaling improvements from O(N⁻¹) to O(N⁻²).
• Its analysis leverages advanced representation theory, efficient circuit algorithms, and resource recycling techniques, making it pivotal for programmable quantum channel simulation and asynchronous communication.

Port-based teleportation (PBT) is a family of quantum teleportation protocols in which Alice’s classical message identifies which one of Bob’s $N$ subsystems contains the output state, so Bob performs only port selection and discarding rather than an outcome-dependent correction unitary. In the standard setting, Alice and Bob share $N$ bipartite $d$-dimensional entangled pairs, Alice performs a joint measurement on the input and her halves of the ports, and the protocol is evaluated either by success probability or by entanglement fidelity, depending on whether a failure branch is allowed. This correction-free decoding makes PBT structurally different from Bennett teleportation, but perfect deterministic PBT is impossible with finitely many ports; its importance comes instead from exact finite-$N$ characterizations, asymptotic optimality theory, and its role in programmable processing, channel simulation, and asynchronous or instantaneous non-local tasks (Studziński et al., 2016, Christandl et al., 2018).

1. Operational definition and protocol variants

In deterministic PBT, Alice and Bob share $N$ ports $A_1B_1,\dots,A_NB_N$, each local system is $d$-dimensional, and the shared resource can be written as

$$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$

with $\operatorname{Tr}(O_A^\dagger O_A)=d^N$. Alice measures the input together with $A_1,\dots,A_N$, sends an outcome $N$0, and Bob keeps $N$1. In the non-optimized scheme $N$2; in the optimized scheme $N$3 is chosen to maximize teleportation fidelity (Studziński et al., 2021).

The two standard variants are probabilistic and deterministic PBT. Probabilistic PBT has a failure outcome $N$4; when the outcome is $N$5, teleportation is perfect, and the figure of merit is the success probability. Deterministic PBT has only $N$6 output labels, so some port is always produced, but the induced channel is approximate and is quantified by entanglement fidelity $N$7, with average state fidelity

$N$8

Operationally, probabilistic PBT optimizes success subject to exact conditional transmission, whereas deterministic PBT optimizes fidelity under guaranteed output (Studziński et al., 2016).

A recurrent misconception is that “no correction” means “no classical communication.” PBT still requires one-way classical communication from Alice to Bob; what disappears is the need for Bob to implement a nontrivial unitary conditioned on that message. The message only selects a port. This distinction is precisely what makes PBT composable in settings where intermediate adaptive correction unitaries are undesirable or impossible (Christandl et al., 2018).

2. Representation-theoretic structure

The exact analysis of PBT is controlled by the spectrum of the PBT operator

$N$9

which belongs to the algebra of partially transposed permutation operators. This observation converts the apparent $d$0-dimensional spectral problem into a structured problem in the representation theory of $d$1, $d$2, and the partially transposed permutation algebra (Studziński et al., 2016).

Schur–Weyl duality and the partially reduced irreducible representation formalism organize the relevant blocks by pairs $d$3, where $d$4 and $d$5 is obtained from $d$6 by adding one box. In this block basis, the eigenvalues of $d$7 are explicit: $d$8 with $d$9 the dimensions of the symmetric-group irreps and $N$0 the corresponding Schur–Weyl multiplicities. This is the core exact finite-$N$1 structural result underlying both deterministic and probabilistic PBT in arbitrary local dimension (Studziński et al., 2016).

The same machinery also controls square-root measurements and their square roots. In the recycling analysis, the relevant SRM blocks are either genuine projectors or pseudo-projectors depending on whether a forbidden irrep $N$2 of height $N$3 appears. That distinction determines the explicit blockwise square root and makes one-round recycling fidelities computable in arbitrary dimension by purely group-theoretic data (Studziński et al., 2021).

A practical consequence is algorithmic. For fixed $N$4, the number of Young diagrams with bounded height grows polynomially in $N$5, so the properties of any fixed-dimension PBT scheme can be determined in polynomial time once the representation-theoretic data are available (Studziński et al., 2016).

3. Performance regimes and asymptotics

For probabilistic PBT with optimization over both measurement and resource state, the optimal success probability is exactly

$N$6

This formula is valid for all $N$7 and $N$8, so for fixed $N$9, $N$0 as $N$1, while for fixed $N$2, $N$3 as $N$4 (Studziński et al., 2016).

Deterministic PBT exhibits a sharper separation between EPR-restricted and fully optimized resource states. With maximally entangled ports and the standard pretty-good measurement, the entanglement fidelity obeys

$N$5

for every $N$6. By contrast, in fully optimized deterministic PBT,

$N$7

Thus optimization of the resource state changes the asymptotic rate from $N$8 to $N$9, not merely the constant factor (Christandl et al., 2018).

The converse side is equally important. The optimal deterministic error is fundamentally quadratic in $A_1B_1,\dots,A_NB_N$0: achievability is governed by the first Dirichlet eigenvalue of the Laplacian on the ordered simplex, while converse bounds match the same $A_1B_1,\dots,A_NB_N$1 order. This identifies the asymptotic cost of removing Bob’s correction operation in deterministic teleportation (Christandl et al., 2018).

A different regime emerges at fixed low $A_1B_1,\dots,A_NB_N$2 and large local dimension. For PGM-based PBT with $A_1B_1,\dots,A_NB_N$3, exact higher-dimensional calculations show that the entanglement fidelity satisfies

$A_1B_1,\dots,A_NB_N$4

and, for fixed $A_1B_1,\dots,A_NB_N$5,

$A_1B_1,\dots,A_NB_N$6

This indicates that high-dimensional PBT with few ports becomes fidelity-limited by $A_1B_1,\dots,A_NB_N$7 scaling even though the port-identification measurement itself becomes nearly perfect (Wang et al., 2022).

4. Optimal measurements and optimized resources

A central structural result is that the pretty-good measurement, or square-root measurement,

$A_1B_1,\dots,A_NB_N$8

is not merely near-optimal in deterministic PBT: it is exactly optimal for the standard port state of $A_1B_1,\dots,A_NB_N$9 maximally entangled pairs, and the same specific measurement remains optimal even when the port state is itself optimized over all admissible symmetric choices. In other words, within deterministic PBT, optimization changes the resource state but not the optimal measurement (Leditzky, 2020).

The proof strategy is based on semidefinite-program duality plus symmetry reduction. PBT is recast as a structured state-discrimination problem for the ensemble of reduced resource states $d$0, and the dual-feasible operator constructed from the PGM performance matches the primal value exactly. The representation-theoretic block structure supplies the explicit dual certificate (Leditzky, 2020).

In the fully optimized deterministic setting, the remaining optimization can be expressed through the teleportation matrix $d$1, a combinatorial object indexed by Young diagrams of $d$2. The optimal fidelity is

$d$3

where $d$4 is the principal submatrix corresponding to diagrams of height at most $d$5. When $d$6, the full spectrum is explicit,

$d$7

so $d$8 and $d$9 in that regime (Mozrzymas et al., 2017).

For qubits, this specializes to the exact formula

$$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$0

recovering the original optimal qubit result in closed form. The optimized resource operator is diagonal in the Schur–Weyl decomposition and is determined by the Perron eigenvector of $$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$1 (Mozrzymas et al., 2017).

5. Recycling, degradation, and noisy resources

PBT consumes entanglement nontrivially: after one teleportation round, the unused ports are no longer a tensor product of maximally entangled pairs. This motivates recycling protocols, where the post-measurement resource is reused. For deterministic PBT in arbitrary dimension, one-round recycling fidelities were derived explicitly in terms of Schur–Weyl data, and for $$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$2 rounds the general bound

$$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$3

shows that the total error grows at most additively in the number of rounds. An important nuance is that better teleportation performance does not imply better recycling performance: in qubits, the optimized deterministic scheme can recycle slightly worse than the non-optimized one, despite being the better teleportation protocol (Studziński et al., 2021).

For local Pauli noise on qubit resource pairs, the noisy deterministic PBT channel remains analytically tractable. The resulting channel is exactly a Pauli channel that factors as the finite-$$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$4 PBT depolarizing map composed with an effective Pauli channel induced by the noisy resource, with fidelities

$$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$5

This factorization isolates architecture-induced error from resource-noise-induced error and underlies bounds for port-based entanglement teleportation (Kim et al., 2023).

Under pure dephasing, deterministic qubit PBT exhibits a different phenomenon. With noisy resource states but the original noiseless Ishizaka–Hiroshima measurement, the entanglement fidelity has an explicit closed form and converges, for large $$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$6, to a dephasing-limited plateau determined by the real part of the coherence factor: $$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$7 More strikingly, when one replaces the original measurement by the pretty-good measurement adapted to the noisy ensemble, the adapted measurement performs worse than the noiseless one for essentially all finite $$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$8. This is a concrete example where “noise adaptation” is not aligned with optimal operational performance (Bhati et al., 18 Feb 2026).

6. Algorithms, applications, and related protocols

PBT is operationally important because Bob may process all ports before learning Alice’s classical message and later keep only the correct output wire. This is the basic asynchronous feature formalized in later resource-theoretic work: among communication models compatible with asynchronous quantum information processing, the strongest PBT-like model is already as powerful as arbitrary one-way teleportation for surpassing the classical teleportation threshold (Kim et al., 17 Apr 2025).

From an algorithmic perspective, efficient implementation was long missing. An initial breakthrough gave the first efficient quantum algorithm for deterministic PBT with the standard resource and pretty-good measurement, using twisted Schur–Weyl duality and the twisted Schur transform, with polynomial time in $$|\Psi\rangle_{AB}=(O_A\otimes \mathbf{1}_B)\bigotimes_{i=1}^N |\psi_d^+\rangle_{A_iB_i}, \qquad |\psi_d^+\rangle=\frac{1}{\sqrt d}\sum_{i=1}^d |ii\rangle,$$9 and $\operatorname{Tr}(O_A^\dagger O_A)=d^N$0, $\operatorname{Tr}(O_A^\dagger O_A)=d^N$1 space, and constant spectral-norm error (Fei et al., 2023). Subsequent work provided explicit efficient circuits for probabilistic and deterministic PBT, both for EPR and optimized resource states, with two encodings of the Gelfand–Tsetlin basis. For constant local dimension and target error, the standard encoding achieves $\operatorname{Tr}(O_A^\dagger O_A)=d^N$2 time and $\operatorname{Tr}(O_A^\dagger O_A)=d^N$3 space, while the Yamanouchi encoding achieves $\operatorname{Tr}(O_A^\dagger O_A)=d^N$4 time and $\operatorname{Tr}(O_A^\dagger O_A)=d^N$5 space (Grinko et al., 2023).

The protocol is also a programmable simulator. For qubits, the Choi matrix of the channel simulated by PBT with a general resource state can be written explicitly in terms of that resource, so standard qubit PBT with variable program state becomes a universal simulator of qubit channels. Finite-port optimization of the resource improves concrete simulations, including amplitude damping, beyond the naive choice of taking $\operatorname{Tr}(O_A^\dagger O_A)=d^N$6 copies of the target channel’s Choi state (Pereira et al., 2019).

Several nonstandard descendants of PBT clarify which parts of its complexity arise from correction-free decoding and which arise from universality over unknown inputs. Port-based telecloning replaces the single-port output by an $\operatorname{Tr}(O_A^\dagger O_A)=d^N$7-subset of ports and asymptotically reaches the optimal universal $\operatorname{Tr}(O_A^\dagger O_A)=d^N$8 cloning fidelity without any receiver correction unitaries (Okada et al., 28 Jan 2025). Port-Based State Preparation, where Alice has a complete classical description of the target state, achieves error $\operatorname{Tr}(O_A^\dagger O_A)=d^N$9 with maximally entangled resources and this scaling is optimal for EPR resources; this strongly suggests that the polynomial scaling of ordinary PBT is tied to the unknown-input requirement rather than to port selection alone (Muguruza et al., 2024).

Taken together, these results place PBT at the intersection of teleportation theory, state discrimination, Schur–Weyl representation theory, programmable processing, and constrained quantum communication. Its defining operational move—replacing receiver-side correction by port selection—has generated a mathematically explicit theory with exact finite-$A_1,\dots,A_N$0 formulas, sharp asymptotics, nontrivial noise and recycling phenomena, and, more recently, efficient circuit constructions (Studziński et al., 2016, Christandl et al., 2018).