<i>Colloquium</i>: Qudits for decomposing multiqubit gates and realizing quantum algorithms
Two-level systems---bits or qubits---are understood to generally be the most efficient primitives for information processing, classical or quantum. But this is not to say that there are no roles to be played by multilevel systems. This Colloquium surveys these possible roles for the quantum case. Here we speak of qudits: $d$-level quantum systems. In one interesting example, the use of just one three-level system permits a drastic simplification of the ``Toffoli gate,'' the basic three-qubit primitive of reversible logic. A survey is given of various qudit-qubit embeddings, and the current state of quantum computing experiments using qudits is reviewed.
Authors
- Evgeniy O. Kiktenko (ORCID: https://orcid.org/0000-0001-5760-441X)
- Aleksey K. Fedorov (ORCID: https://orcid.org/0000-0002-4722-3418)
- Anastasiia S. Nikolaeva (ORCID: https://orcid.org/0000-0002-8321-7103)
Institutions
- National University of Science and Technology (RU)
- National University of Science and Technology (ZW)
- Russian Quantum Center (RU)
Publication Details
- Journal
- Reviews of Modern Physics
- Published
- 2025-06-03
- DOI
- https://doi.org/10.1103/revmodphys.97.021003
- Citations
- 12
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 29.77
Funders
- Russian Science Foundation
- National University of Science and Technology