Wednesday, November 20, 2019, 1:30 pm — Conference room 201, Bldg 734
In exchange-only quantum computation, qubits are encoded using three or more spin-1/2 particles and quantum gates can be performed by switching on and off, or "pulsing", the isotropic exchange interaction between spins. Finding efficient pulse sequences for realizing two-qubit gates in this way is complicated by the large search space in which they live, and has typically involved numerical brute force search. Here I will give a simple analytic derivation of the most efficient known exchange-pulse sequence for carrying out a controlled-NOT gate, originally found numerically by Fong and Wandzura. I will then show how the ideas behind this derivation can be used to analytically find new pulse sequences for two-qubit gates beyond controlled-NOT.
Hosted by: Layla Hormozi
15310 | INT/EXT | Events Calendar
Not all computers/devices will add this event to your calendar automatically.
A calendar event file named "calendar.ics" will be placed in your downloads location. Depending on how your device/computer is configured, you may have to locate this file and double click on it to add the event to your calendar.
Event dates, times, and locations are subject to change. Event details will not be updated automatically once you add this event to your own calendar. Check the Lab's Events Calendar to ensure that you have the latest event information.