- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Asymptotic performance of port-based teleportation
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Asymptotic performance of port-based teleportation Leditzky, Felix
Description
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. arXiv:1809.10751, joint work with M. Christandl, C. Majenz, G. Smith, F. Speelman, M. Walter
Item Metadata
Title |
Asymptotic performance of port-based teleportation
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2019-07-26T09:49
|
Description |
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.
arXiv:1809.10751, joint work with M. Christandl, C. Majenz, G. Smith, F. Speelman, M. Walter
|
Extent |
43.0 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: University of Colorado Boulder
|
Series | |
Date Available |
2020-01-23
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0388352
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Postdoctoral
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International