By the same authors

From the same journal

From the same journal

Higher-dimensional performance of port-based teleportation

Research output: Contribution to journalArticle

Full text download(s)

Published copy (DOI)

Author(s)

Department/unit(s)

Publication details

JournalScientific Reports
DateAccepted/In press - 18 Aug 2016
DatePublished (current) - 8 Sep 2016
Volume6
Number of pages6
Original languageEnglish

Abstract

Port-based teleportation (PBT) is a variation of regular quantum teleportation that operates without a final unitary correction. However, its behavior for higher-dimensional systems has been hard to calculate explicitly beyond dimension d = 2. Indeed, relying on conventional Hilbert-space representations entails an exponential overhead with increasing dimension. Some general upper and lower bounds for various success measures, such as (entanglement) fidelity, are known, but some become trivial in higher dimensions. Here we construct a graph-theoretic algebra (a subset of Temperley-Lieb algebra) which allows us to explicitly compute the higher-dimensional performance of PBT for so-called “pretty-good measurements” with negligible representational overhead. This graphical algebra allows us to explicitly compute the success probability to distinguish the different outcomes and fidelity for arbitrary dimension d and low number of ports N, obtaining in addition a simple upper bound. The results for low N and arbitrary d show that the entanglement fidelity asymptotically approaches N/d^2 for large d, confirming the performance of one lower bound from the literature.

Bibliographical note

© Authors, 2016

    Research areas

  • Port-based teleportation, Quantum information

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations