Optimal Probabilistic Storage and Retrieval of Unitary Channels

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

SEDLÁK Michal BISIO Alessandro ZIMAN Mário

Year of publication 2019
Type Article in Periodical
Magazine / Source Physical Review Letters
MU Faculty or unit

Faculty of Informatics

Citation
Web http://dx.doi.org/10.1103/PhysRevLett.122.170502
Doi http://dx.doi.org/10.1103/PhysRevLett.122.170502
Keywords quantum learning; quantum networks
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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.