Optimal Probabilistic Storage and Retrieval of Unitary Channels

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00107863" target="_blank" >RIV/00216224:14330/19:00107863 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1103/PhysRevLett.122.170502" target="_blank" >http://dx.doi.org/10.1103/PhysRevLett.122.170502</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1103/PhysRevLett.122.170502" target="_blank" >10.1103/PhysRevLett.122.170502</a>

Result language
angličtina
Original language name
Optimal Probabilistic Storage and Retrieval of Unitary Channels
Original language description
We address the question of quantum memory storage for quantum dynamics. In particular, we design an optimal protocol for N -> 1 probabilistic storage and retrieval of unitary channels on d-dimensional quantum systems. If we access the unknown unitary gate only N times, the optimal success probability of perfect single-use retrieval is N /(N -1 + d(2)). The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10300 - Physical sciences

Project
<a href="/en/project/GA16-22211S" target="_blank" >GA16-22211S: Rényi entropies in quantum information processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)