To the recorded seminar

The “No-Programming Theorem” asserts that perfect universal quantum processors cannot exist. These are hypothetical devices that execute a unitary gate that is choosable arbitrarily and itself provided as a (quantum) input. In my talk, I will present a recent quantitative version of this theorem, which is about approximate universal quantum processors.

(The talk is based on the preprint arXiv:2007.10363, which is joint work with Yuxiang Yang and Giulio Chiribella.)