PreprintarXiv licencearXiv
A simple proof of unitary parallelization via port-based teleportation
Abstract
Port-based teleportation (PBT) is a variant of quantum teleportation that does not require corrections on the teleported state: starting with N shared EPR states, Alice can teleport a qudit to Bob by performing a measurement on her system and informing Bob which of his N `ports' to retrieve the state, up to infidelity decaying with N. Existing efficient quantum circuits of PBT rely on representation theory tools such as the Schur transform. In this note, we report an elementary efficient circuit for PBT, which has depth polylog(N,d). As a corollary, this gives a simple proof that all n-qubit unitaries can be parallelized to poly(n) depth, recovering a recent result due to Nehoran--Slote--Yuen and OpenAI.
Related
- One-to-One Correspondence Between Deterministic Port-Based Teleportation and Unitary Estimation
- Quantifying Teleportation Overhead in Distributed Unitary Coupled-Cluster Ansätze
- Simple proof of conditions requiring maximal entanglement for local state verification and discrimination
- MLegS: A modern mapped Legendre spectral method solver for unbounded domains with parallelization
- Teleportation Game: Quantum Teleportation in Multi-Agent Systems for Interactive Music
BibTeX
@misc{anshu2026simple,
title = {{A simple proof of unitary parallelization via port-based teleportation}},
author = {Anurag Anshu and Quynh T. Nguyen},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30761},
eprint = {2610.30761},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30761},
}
RIS
TY - UNPB
TI - A simple proof of unitary parallelization via port-based teleportation
AU - Anurag Anshu
AU - Quynh T. Nguyen
PY - 2026
DA - 2026/10/28
PB - arXiv
DO - 10.48550/arxiv.2610.30761
UR - https://arxiv.org/abs/2610.30761
AB - Port-based teleportation (PBT) is a variant of quantum teleportation that does not require corrections on the teleported state: starting with N shared EPR states, Alice can teleport a qudit to Bob by performing a measurement on her system and informing Bob which of his N `ports' to retrieve the state, up to infidelity decaying with N. Existing efficient quantum circuits of PBT rely on representation theory tools such as the Schur transform. In this note, we report an elementary efficient circuit for PBT, which has depth polylog(N,d). As a corollary, this gives a simple proof that all n-qubit unitaries can be parallelized to poly(n) depth, recovering a recent result due to Nehoran--Slote--Yuen and OpenAI.
ER -