Efficient Algorithms for All Port-Based Teleportation Protocols

Watch a conference talk from TQC 2024 that presents groundbreaking solutions for implementing port-based teleportation (PBT) protocols efficiently across all scenarios. Learn about exponential improvements in ancilla requirements and polynomial enhancements in gate complexity for both probabilistic and deterministic implementations, using either maximally entangled or optimized resource states. Explore a flexible framework that extends beyond PBT to other pretty good measurement cases, particularly valuable when Petz recovery approaches prove inefficient. Delivered at the 19th Conference on the Theory of Quantum Computation, Communication and Cryptography at the Okinawa Institute for Science and Technology, this presentation advances theoretical quantum information science through innovative algorithmic approaches to quantum teleportation.