BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:UW-Physics-TWaP
BEGIN:VEVENT
SEQUENCE:0
UID:UW-Physics-Event-3867
DTSTART:20151217T160000Z
DURATION:PT1H0M0S
DTSTAMP:20200923T233537Z
LAST-MODIFIED:20151207T140835Z
LOCATION:5310 Chamberlin
SUMMARY:Designing Gates for a Spin-Based Quantum Computer\, R. G. Herb
Condensed Matter Seminar\, Daniel Zeuch\, Florida State
DESCRIPTION:After reviewing the basic notions of quantum computation w
ith electrons trapped in semiconductor quantum dots\, I focus on a com
puting scheme in which qubits are encoded using three spins each and a
rbitrary quantum gates are carried out by turning on and off\, or puls
ing\, the Heisenberg exchange Hamiltonian. While most work on finding
pulse sequences for two-qubit gates has been numerical\, I discuss seq
uences that were designed completely analytically [1\,2] and show\, in
particular\, the framework of the derivation [2] of the shortest know
n sequence for this particular scheme. At the end\, I draw parallels b
etween spin-based quantum computation and topological quantum computat
ion with non-Abelian anyons. I show that the basic problem of finding
two-qubit quantum gates\, addressed in [3]\, can be understood in simi
lar terms as the problem of finding two-qubit gate pulse sequences.

\n

\n[1] D. Zeuch\, R. Cipri\, and N. E. Bonesteel\, Phys. Rev.
B 90\, 045306 (2014).

\n[2] D. Zeuch and N. E. Bonesteel\, arXiv
preprint arXiv:1508.07524 (2015).

\n[3] C. Carnahan\, D. Zeuch\, a
nd N. E. Bonesteel\, arXiv preprint arXiv:1511.00719 (2015).

\n
URL:https://www.physics.wisc.edu/twap/?id=3867
END:VEVENT
END:VCALENDAR