BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
PRODID::-//Obvius//NONSGML ICal//DA
BEGIN:VEVENT
UID:2158726@qmath.ku.dk
DESCRIPTION:Title: Quantum Circuits for Isometries
\nSpeaker: Raban Iten
\
 nAbstract: Every quantum operation can be decomposed into a sequence of si
 ngle-qubit and Controlled-Not (C-NOT) gates. In many experimental archite
 ctures\, single-qubit gates are relatively ‘cheap’ to perform compared
  to C-NOTs (for instance\, being less susceptible to noise)\, and hence it
  is desirable to minimize the number of C-NOT gates required to implement 
 a circuit. I will consider the task of constructing an arbitrary isometry 
 from m qubits to n qubits\, while trying to minimize the number of C-NOT g
 ates required.  I will show a lower bound and then give an explicit gate 
 decomposition that gets within a factor of about two of this bound. Throug
 h Stinespring’s theorem this points to a C-NOT-efficient way to perform 
 an arbitrary quantum operation.\n\nhttps://qmath.ku.dk/events/quantum-lunc
 h/quantum-lunch-2015/39-15/
SUMMARY:Quantum Lunch: Quantum Circuits for Isometries
LOCATION:The Quantum Lunch room\, 04.4.20
ORGANIZER:Christian Majenz
DTSTART:20150916T100000Z
DTSTAMP:20150916T100000Z
DTEND:20150916T110000Z
END:VEVENT
END:VCALENDAR