Geometry of Quantum Computation with Qutrits

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 circuit...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Bin, Yu, Zu-Huan, Fei, Shao-Ming
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2013
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3763255/
https://www.ncbi.nlm.nih.gov/pubmed/24005379
http://dx.doi.org/10.1038/srep02594
Descripción
Sumario: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.

Ejemplares similares