BEGIN:VCALENDAR
PRODID:-//Columba Systems Ltd//NONSGML CPNG/SpringViewer/ICal Output/3.3-
 M3//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20261118T182123Z
DTSTART:20261123T150000Z
DTEND:20261123T160000Z
SUMMARY:Ashot Aslanyan: Geometry of Quantum Computation
UID:{http://www.columbasystems.com/customers/uom/gpp/eventid/}sjt-mwmg6lt
 s-e3unqj
DESCRIPTION:Abstract:\n\nA quantum computation on n qubits is a finite se
 quence of elementary gates (unitaries acting on at most two qubits) whos
 e product approximates a target unitary U ? SU(2?)\; a family of circuit
 s is called efficient if the number of gates grows polynomially in n. Su
 ch a computation can be modelled as a curve U(t) in SU(2?) solving U? = 
 ?iH(t)U\, U(0) = I\, U(T) = U\, where H(t) is a time-dependent Hermitian
  operator (a curve in the Lie algebra). Following Nielsen et al. [[quant
 -ph/0603161v2] Quantum Computation as Geometry]\, we will introduce a qu
 adratic cost on SU(2?) that penalizes generators acting on more than two
  qubits\, and extend it to a right-invariant Riemannian metric on SU(2?)
 . We will show that the Riemannian distance from the identity to U is\, 
 up to polynomial factors\, comparable to the minimal number of gates nee
 ded to synthesize U\, so that Riemannian geometry (geodesics\, curvature
 \, conjugate points) can be brought to bear on the study of efficient qu
 antum circuits. We will conclude with generalisations and open questions
 . 
STATUS:TENTATIVE
TRANSP:TRANSPARENT
CLASS:PUBLIC
LOCATION:Frank Adams room 1\, Alan Turing Building\, Manchester
END:VEVENT
END:VCALENDAR
