arXiv:2610.30761
A simple proof of unitary parallelization via port-based teleportation
Anurag Anshu, Quynh T. Nguyen
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 $\operatorname{polylog}(N,d)$. As a corollary, this gives a simple proof that all $n$-qubit unitaries can be parallelized to $\operatorname{poly}(n)$ depth, recovering a recent result due to Nehoran--Slote--Yuen and OpenAI.
AI Summary
The paper asks whether port-based teleportation (PBT) can be implemented in depth polylogarithmic in both the number of ports and the local dimension, and uses this to recover a recent unitary-parallelization result. It treats deterministic, approximate PBT with shared EPR pairs, replacing representation-theoretic circuit constructions with a reflection-based protocol. For local dimension $d$, a positive multiple $N$ of $d$, and $0<\delta<1$, the construction has depth $\operatorname{polylog}(Nd/\delta)$, width $\operatorname{poly}(N,d,\log(1/\delta))$, and diamond-norm error at most $2(d^2-1)/N+\delta$. The protocol introduces orthogonal flag levels and applies one support reflection that approximately transfers the input into a coherent superposition of correctly teleported, flagged ports. An approximate-eigenstate calculation bounds the teleportation error. Choosing a maximally entangled flag and encoding the input into an antisymmetric subspace turns the reflection into a function of two commuting sums of swaps. Their integer eigenvalues are extracted through coherent random SWAP tests; products of controlled permutations allow these tests to be implemented in polylogarithmic depth. Replacing the EPR resources with Choi states yields, for any $n$-qubit unitary, an implementation with diamond error $\varepsilon$, depth $\operatorname{poly}(n,\log(1/\varepsilon))$, and width $2^{O(n)}\operatorname{poly}(1/\varepsilon)$. This recovers an existing result rather than establishing unitary parallelization for the first time. The bounds assume arbitrary-angle one- and two-qubit gates, unrestricted connectivity, and initialized ancillas. The construction is approximate and trades shallow depth for polynomial width in PBT parameters, or exponential width in the unitary’s qubit count.
In a few prompts, ChatGPT Astra came up with the protocol in this note, in particular the remarkable single reflection teleportation protocol.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- Added missing references