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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Optimal probabilistic storage and retrieval of unitary channels

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Wolfson Lecture Theatre, Bullard Cambridge Judge Business School, LT1 Cambridge University Engineering Department, Lecture Room 3

Other talks

Title TBC Title to be confirmed Title and abstract tba Title to be confirmed Emergency Medicine and Metabolic Medicine RNA-Mediated Regulation of Germinal Centre B-Cell Fitness: a tale of two DEAD-box RNA helicases
 

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