Optimal probabilistic storage and retrieval of unitary channels

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

• Michal Sedlák, Slovak Academy of Sciences
• Thursday 10 October 2019, 14:15-15:15
• MR15, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

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.

This talk is included in these lists:

• All CMS events
• CMS Events
• CQIF Seminar
• DAMTP info aggregator
• Hanchen DaDaDash
• Interested Talks
• MR15, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• bld31

Note that ex-directory lists are not shown.