Asymptotic performance of port-based teleportation

DOI10.1007/s00220-020-03884-0zbMath1460.81009arXiv1809.10751OpenAlexW3103046569MaRDI QIDQ2223729

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

Publication date: 1 February 2021

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

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

zbMATH Keywords

symmetric groupYoung diagramrepresentation theoryquantum teleportationquantum channelquantum communicationsentanglement fidelityport-based teleportationprogrammable quantum processors

Mathematics Subject Classification ID

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

Related Items (4)

The asymmetric quantum cloning region ⋮ Continuous variable port-based teleportation ⋮ Optimality of the pretty good measurement for port-based teleportation ⋮ Square-root measurements and degradation of the resource state in port-based teleportation scheme

Uses Software

• GitHub

Cites Work

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

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