ロード中...
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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Nature Publishing Group
2013
|
| 主題: | |
| オンライン･アクセス: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3763255/ https://ncbi.nlm.nih.gov/pubmed/24005379 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/srep02594 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|