Asymptotic performance of port-based teleportation

QuICS Seminar

Christian Majenz (CWI, Netherlands)
Wednesday, March 7, 2018 - 11:00am
CSS 3100A

Port-based teleportation (PBT) is a variant of the well-known task of quantum teleportation where the receiver Bob, instead of having to apply a non-trivial correction unitary, merely has to pick up the right quantum system at a “port” specified by the classical message he received from Alice. While much more resource-demanding than standard teleportation, PBT has applications to instantaneous non-local computation and can be used to attack position-based quantum cryptography. A perfect PBT protocol would violate the linearity of quantum theory, so there is a trade-off between error and entanglement consumption (or the number of ports) which can be analyzed using representation theory of the symmetric and unitary groups. In particular the resource state has a “purified" Schur-Weyl duality symmetry. I will give an introduction to the task of PBT and its symmetries, and show how the asymptotics of existing formulas for the optimal performance for a given number of ports can be derived using a connection between representation theory and the random matrix ensemble GUE_0.