Ashot Aslanyan: Geometry of Quantum Computation
| Dates: | 23 November 2026 |
| Times: | 15:00 - 16:00 |
| What is it: | Seminar |
| Organiser: | Department of Mathematics |
| Speaker: | Ashot Aslanyan (Manchester) |
|
|
Abstract:
A quantum computation on n qubits is a finite sequence of elementary gates (unitaries acting on at most two qubits) whose product approximates a target unitary U ? SU(2?); a family of circuits is called efficient if the number of gates grows polynomially in n. Such 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 quadratic 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 needed to synthesize U, so that Riemannian geometry (geodesics, curvature, conjugate points) can be brought to bear on the study of efficient quantum circuits. We will conclude with generalisations and open questions.
Speaker
Ashot Aslanyan (Manchester)
Travel and Contact Information
Find event
Frank Adams room 1
Alan Turing Building
Manchester