Efficient Quantum Algorithm for Port-based Teleportation

Understand

In this paper, we provide the first efficient algorithm for port-based teleportation, a unitarily equivariant version of teleportation useful for constructing programmable quantum processors and performing instantaneous nonlocal computation (NLQC).

• The latter connection is important in AdS/CFT, where bulk computations are realized as boundary NLQC.
• Our algorithm yields an exponential improvement to the known relationship between the amount of entanglement available and the complexity of the nonlocal part of any unitary that can be implemented using NLQC.
• Similarly, our algorithm provides the first nontrivial efficient algorithm for an approximate universal programmable quantum processor.