University of Cambridge > Talks.cam > CQIF Seminar > Optimal probabilistic storage and retrieval of unitary channels

Optimal probabilistic storage and retrieval of unitary channels

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sergii Strelchuk.

We address the question of a quantum memory storage of 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 may access the unknown unitary gate only N-times, we show that the optimal success probability of perfect retrieval of its single use 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.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity