Cargando…
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...
Autores principales: | Li, Bin, Yu, Zu-Huan, Fei, Shao-Ming |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2013
|
Materias: | |
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 |
Ejemplares similares
-
Realization of efficient quantum gates with a superconducting qubit-qutrit circuit
por: Bækkegaard, T., et al.
Publicado: (2019) -
Entanglement monogamy in three qutrit systems
por: Li, Qiting, et al.
Publicado: (2017) -
Sudden Transition between Classical to Quantum Decoherence in bipartite correlated Qutrit Systems
por: Cárdenas-López, F. A., et al.
Publicado: (2017) -
Characterizing unextendible product bases in qutrit-ququad system
por: Yang, Ying-Hui, et al.
Publicado: (2015) -
Two Fundamental Experimental Tests of Nonclassicality with Qutrits
por: Ahrens, Johan, et al.
Publicado: (2013)