Campus Event Calendar
Event Entry
New for: D1, D2, D3, INET, D4, D5, D6
What and Who
Optimal universal programming of unitary gates
Renato Renner
ETH Zuerich
MPI Colloquium Series Distinguished Speaker
AG 1, INET, AG 5, RG1, SWS, AG 2, AG 4, D6, AG 3
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 28 October 2021
14:00
60 Minutes
Warning: Time has changed!
Virtual talk
Virtual talk
Saarbrücken
Abstract
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. This impossibility result depends however strongly on the requirement that the processor makes no errors. In my talk, I will present a recent robust version of the No-Programming Theorem. It basically answers the following question: Given a bound on the maximum tolerated error, what is the minimum size of the program that implements a unitary gate on a universal processor? As I shall explain, the answer to this question has an interesting connection to the Heisenberg limit of quantum metrology.
Contact
Virtual Meeting Details
Zoom
945 7732 1297
205903
public
Kurt Mehlhorn, 10/28/2021 07:00
Kurt Mehlhorn, 10/21/2021 10:49 -- Created document.
Kurt Mehlhorn, 10/21/2021 10:49 -- Created document.