Port-based teleportation in arbitrary dimension

Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver’s side. Evaluating the performance of PBT was computationally intractable and previous attempts succeeded only with small systems. We study PBT protocols and fully characterize their performance for arbitrary dimensions and number of ports. We develop new mathematical tools to study the symmetries of the measurement operators that arise in these protocols and belong to the algebra of partially transposed permutation operators. First, we develop the representation theory of the mentioned algebra which provides an elegant way of understanding the properties of subsystems of a large system with general symmetries. In particular, we introduce the theory of the partially reduced irreducible representations which we use to obtain a simpler representation of the algebra of partially transposed permutation operators and thus explicitly determine the properties of any port-based teleportation scheme for fixed dimension in polynomial time.

[1]  E. Knill,et al.  A scheme for efficient quantum computation with linear optics , 2001, Nature.

[2]  Satoshi Ishizaka,et al.  Quantum teleportation scheme by selecting one of multiple output ports , 2009, 0901.2975.

[3]  Structure and properties of the algebra of partially transposed permutation operators , 2013, 1308.2653.

[4]  H. Buhrman,et al.  Quantum communication complexity advantage implies violation of a Bell inequality , 2015, Proceedings of the National Academy of Sciences.

[5]  Satoshi Ishizaka,et al.  Some remarks on port-based teleportation , 2015, 1506.01555.

[6]  Ekert,et al.  "Event-ready-detectors" Bell experiment via entanglement swapping. , 1993, Physical review letters.

[7]  R. Jozsa.  An introduction to measurement based quantum computation , 2005, quant-ph/0508124.

[8]  Commutant structure ofU ⊗(n−1) ⊗U ∗ transformations , 2013 .

[9]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[10]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[11]  B. M. Fulk.  MATH , 1992 .

[12]  Jonathan Oppenheim,et al.  Generalized teleportation and entanglement recycling. , 2012, Physical review letters.

[13]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[14]  I. Chuang,et al.  Quantum Teleportation is a Universal Computational Primitive , 1999, quant-ph/9908010.

[15]  J. Eisert,et al.  Advances in quantum teleportation , 2015, Nature Photonics.

[16]  Salman Beigi,et al.  Simplified instantaneous non-local quantum computation with applications to position-based cryptography , 2011, 1101.1065.

[17]  D. Gross,et al.  Novel schemes for measurement-based quantum computation. , 2006, Physical review letters.

[18]  F. Martini,et al.  Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels , 1997, quant-ph/9710013.

[19]  C. Curtis,et al.  Representation theory of finite groups and associated algebras , 1962 .

[20]  Satoshi Ishizaka,et al.  Asymptotic teleportation scheme as a universal programmable quantum processor. , 2008, Physical review letters.

[21]  Samuel L. Braunstein,et al.  Higher-dimensional performance of port-based teleportation , 2016, Scientific Reports.

[22]  M. Horodecki,et al.  Commutant structuture of Ux...xUxU* transformations , 2013, 1305.6183.