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