Geometry of Quantum Computation with Qutrits
Bin Li, Zuhuan Yu, and Shao-Ming Fei
Contact the author: Please use for correspondence this email.
Submission date: 29. Jan. 2014
published in: Scientific Reports, 3 (2013), art-no. 2594
DOI number (of the published article): 10.1038/srep02594
Download full preprint: PDF (166 kB), PS ziped (310 kB)
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 eﬃcient 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(3n). As an example, three-qutrit systems are investigated in detail.