Qudits for decomposing multiqubit gates and realizing quantum algorithms
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916775811088384 |
|---|---|
| author | Kiktenko, Evgeniy O. Nikolaeva, Anastasiia S. Fedorov, Aleksey K. |
| author_facet | Kiktenko, Evgeniy O. Nikolaeva, Anastasiia S. Fedorov, Aleksey K. |
| contents | The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially interesting in the quantum-mechanical domain. In this Colloquium several ideas are reviewed that indicate how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms, which are represented via standard qubit circuits. The focus in the Colloquium is on techniques for leveraging qudits for simplifying decomposition of multiqubit gates and for compressing quantum information by encoding multiple qubits in a single qudit. As discussed in the Colloquium, these approaches can be efficiently combined. This allows a reduction in the number of entangling (two-body) operations and the number of quantum information carriers used compared to straightforward qubit realizations. These theoretical schemes can be implemented with quantum computing platforms of various natures, such as trapped ions, neutral atoms, superconducting junctions, quantum light, spin systems, and molecules. The Colloquium concludes by summarizing a set of open problems whose resolution will be an important further step toward employing universal qudit-based processors for running qubit algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_12003 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Qudits for decomposing multiqubit gates and realizing quantum algorithms Kiktenko, Evgeniy O. Nikolaeva, Anastasiia S. Fedorov, Aleksey K. Quantum Physics The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially interesting in the quantum-mechanical domain. In this Colloquium several ideas are reviewed that indicate how multilevel quantum systems, also known as qudits, can be used for efficient realization of quantum algorithms, which are represented via standard qubit circuits. The focus in the Colloquium is on techniques for leveraging qudits for simplifying decomposition of multiqubit gates and for compressing quantum information by encoding multiple qubits in a single qudit. As discussed in the Colloquium, these approaches can be efficiently combined. This allows a reduction in the number of entangling (two-body) operations and the number of quantum information carriers used compared to straightforward qubit realizations. These theoretical schemes can be implemented with quantum computing platforms of various natures, such as trapped ions, neutral atoms, superconducting junctions, quantum light, spin systems, and molecules. The Colloquium concludes by summarizing a set of open problems whose resolution will be an important further step toward employing universal qudit-based processors for running qubit algorithms. |
| title | Qudits for decomposing multiqubit gates and realizing quantum algorithms |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2311.12003 |