Search

MiS Preprint Repository

We have decided to discontinue the publication of preprints on our preprint server as of 1 March 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.

MiS Preprint
9/2014

Geometry of Quantum Computation with Qutrits

Bin Li, Zuhuan Yu and Shao-Ming Fei

Abstract

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum computation with $n$ qutrits. We show that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry of $SU(3^n)$. As an example, three-qutrit systems are investigated in detail.

Received:
Jan 29, 2014
Published:
Jan 30, 2014

Related publications

inJournal
2013 Journal Open Access
Bin Li, Zu-Huan Yu and Shao-Ming Fei

Geometry of quantum computation with qutrits

In: Scientific reports, 3 (2013), p. 2594