Asymptotic performance of port-based teleportation

DOI10.1007/S00220-020-03884-0zbMATH Open1460.81009arXiv1809.10751OpenAlexW3103046569MaRDI QIDQ2223729FDOQ2223729

Authors: Matthias Christandl, Felix Leditzky, Christian Majenz, Graeme Smith, Florian Speelman, Michael Walter 

Publication date: 1 February 2021

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number $N$ of ports, the error of the optimal protocol is proportional to the inverse square of $N$. We prove this by deriving an achievability bound, obtained by relating the corresponding optimization problem to the lowest Dirichlet eigenvalue of the Laplacian on the ordered simplex. We also give an improved converse bound of matching order in the number of ports. In addition, we determine the leading-order asymptotics of PBT variants defined in terms of maximally entangled resource states. The proofs of these results rely on connecting recently-derived representation-theoretic formulas to random matrix theory. Along the way, we refine a convergence result for the fluctuations of the Schur-Weyl distribution by Johansson, which might be of independent interest.

Full work available at URL: https://arxiv.org/abs/1809.10751

Recommendations

• Optimality of the pretty good measurement for port-based teleportation
• Characterising port-based teleportation as universal simulator of qubit channels
• Square-root measurements and degradation of the resource state in port-based teleportation scheme
• Performances and robustness of quantum teleportation with identical particles
• General teleportation as a quantum channel

zbMATH Keywords

Young diagramquantum channelquantum teleportationrepresentation theorysymmetric groupquantum communicationsentanglement fidelityport-based teleportationprogrammable quantum processors

Mathematics Subject Classification ID

Applications of group representations to physics and other areas of science (20C35) Random matrices (probabilistic aspects) (60B20) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94) Channel models (including quantum) in information and communication theory (94A40) Quantum channels, fidelity (81P47) LOCC, teleportation, dense coding, remote state operations, distillation (81P48)

Cites Work

• Probability. Theory and examples.
• Geometrical structure of Laplacian eigenfunctions
• Title not available (Why is that?)
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Title not available (Why is that?)
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Title not available (Why is that?)
• Title not available (Why is that?)
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Optimal multiple quantum statistical hypothesis testing
• Averaging sets: A generalization of mean values and spherical designs
• Discrete orthogonal polynomial ensembles and the Plancherel measure
• A ‘Pretty Good’ Measurement for Distinguishing Quantum States
• Simple construction of quantum universal variable-length source coding
• The quantum reverse Shannon theorem based on one-shot information theory
• Nonzero Kronecker coefficients and what they tell us about spectra
• A sharp upper bound for the first Dirichlet eigenvalue and the growth of the isoperimetric constant of convex domains
• The spectra of quantum states and the Kronecker coefficients of the symmetric group
• Programmable Quantum Gate Arrays
• On the distributions of the lengths of the longest monotone subsequences in random words
• Eigenvalue distributions of reduced density matrices
• Small designs for path-connected spaces and path-connected homogeneous spaces
• An Upper Bound for the First Zero of Bessel Functions
• Deviation Inequalities on Largest Eigenvalues
• A Large Deviation Principle for the Reduction of Product Representations
• Programmable quantum processors
• Symmetry properties of product states for the system of N n-level atoms
• Quantum position verification in the random oracle model
• Position Based Cryptography
• Position-based quantum cryptography: impossibility and constructions
• Random words, quantum statistics, central limits, random matrices
• Uniform upper and lower bounds on the zeros of Bessel functions of the first kind
• Quantum non-malleability and authentication
• Recoupling coefficients and quantum entropies
• A monogamy-of-entanglement game with applications to device-independent quantum cryptography
• Sample-optimal tomography of quantum states
• Efficient quantum tomography
• Efficient quantum tomography. II
• A simplified formalism of the algebra of partially transposed permutation operators with applications
• Instantaneous non-local computation of low T-depth quantum circuits

Cited In (10)

• Minimal port-based teleportation
• The asymmetric quantum cloning region
• Continuous variable port-based teleportation
• A simplified formalism of the algebra of partially transposed permutation operators with applications
• From port-based teleportation to Frobenius reciprocity theorem: partially reduced irreducible representations and their applications
• Linear programming with unitary-equivariant constraints
• Characterising port-based teleportation as universal simulator of qubit channels
• Square-root measurements and degradation of the resource state in port-based teleportation scheme
• Optimality of the pretty good measurement for port-based teleportation
• Optimal port-based teleportation

Uses Software

• GitHub

This page was built for publication: Asymptotic performance of port-based teleportation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223729)