BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//RLASKEY//CALENDEROUS//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20261019T074733Z
LAST-MODIFIED:20190122T163444Z
DTSTART:20190128T180000Z
DTEND:20190128T190000Z
UID:event2066@bu.edu
URL:http://physics.bu.edu/internal/events/show/2066
SUMMARY:Entanglement Complexity and Scrambling via Braiding of Nonabelions
DESCRIPTION:Featuring Zhicheng Yang\, Boston University\, Physics Departmen
	t\n\nPart of the Departmental Seminars.\n\nDissertation Committee:  Claudio
	 Chamon\, Andrei Ruckenstein\, Anatoli Polkovnikov\, So-Young Pi\, Michael 
	El-Batanouny\n\nAbstract: Scrambling is usually characterized by local entr
	opy production under time evolution. However\, scrambling can exhibit diffe
	rent complexities depending on the degree of randomness it produces\, and t
	here is a gap between maximal entanglement and complete randomization. We p
	ropose a measure of the degree of scrambling beyond entropic diagnostics by
	 studying the entanglement spectrum (ES) statistics. I will first present c
	oncrete examples in random unitary circuits and Hamiltonian systems\, where
	 this entanglement complexity can be detected via the ES. I will further ap
	ply this measure to random braids of non-Abelian anyons and demonstrate tha
	t the ES reveals a hierarchy of scrambling among different systems even for
	 the same amount of entanglement entropy.
LOCATION:SCI 352\, 590 Commonwealth Avenue\, 02215
STATUS:CONFIRMED
CLASS:PUBLIC
END:VEVENT
END:VCALENDAR