文章基本信息

标题：Geometry of Quantum Computation with Qutrits
本地全文：下载
作者：Bin Li ; Zu-Huan Yu ; Shao-Ming Fei 等
期刊名称：Scientific Reports
电子版ISSN：2045-2322
出版年度：2013
卷号：3
DOI：10.1038/srep02594
出版社：Springer Nature
摘要：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 ⁿ ). As an example, three-qutrit systems are investigated in detail.