BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2021/newsitem/12844/24
 -June-2021-DIEP-Seminars-Maris-Ozols
DTSTAMP:20210621T141718
SUMMARY:DIEP Seminars, Maris Ozols
ATTENDEE;ROLE=Speaker:Maris Ozols (UvA)
DTSTART;TZID=Europe/Amsterdam:20210624T110000
LOCATION:Zoom
DESCRIPTION:Any Boolean function can in principle 
 be decomposed into elementary logical gates, such 
 as AND, OR and NOT, that act only on one or two bi
 ts at a time. Similarly, any operation on a quantu
 m computer can be broken up into elementary gates 
 that act only on one or two qubits at a time. I wi
 ll explain how this works and what consequences th
 is has for quantum algorithm design.
X-ALT-DESC;FMTTYPE=text/html:\n  <p>Any Boolean fu
 nction can in principle be decomposed into element
 ary logical gates, such as AND, OR and NOT, that a
 ct only on one or two bits at a time. Similarly, a
 ny operation on a quantum computer can be broken u
 p into elementary gates that act only on one or tw
 o qubits at a time. I will explain how this works 
 and what consequences this has for quantum algorit
 hm design.</p>\n
URL:/NewsandEvents/Archives/2021/newsitem/12844/24
 -June-2021-DIEP-Seminars-Maris-Ozols
CONTACT:Soroush Rafiee Rad at soroush.r.rad at gma
 il.com
END:VEVENT
END:VCALENDAR