Unknown

Dataset Information

0

Geometry of quantum computation with qutrits.


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

Similar Datasets

| S-EPMC4070285 | biostudies-literature
| S-EPMC6731091 | biostudies-literature
| S-EPMC6410807 | biostudies-literature
| S-EPMC3504357 | biostudies-literature
| S-EPMC3983618 | biostudies-other
| S-EPMC8612683 | biostudies-literature
| S-EPMC7643990 | biostudies-literature
| S-EPMC4064337 | biostudies-literature
| S-EPMC6205432 | biostudies-literature
| S-EPMC3658012 | biostudies-other