Geometry of quantum computation with qutrits.
Ontology highlight
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.
SUBMITTER: Li B
PROVIDER: S-EPMC3763255 | biostudies-other | 2013
REPOSITORIES: biostudies-other
ACCESS DATA