<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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Colloquium: Qudits for decomposing multiqubit gates and realizing quantum algorithms

Evgeniy O. Kiktenko, Aleksey K. Fedorov, Anastasiia S. Nikolaeva
12 citations
Reviews of Modern Physics
Quantum Computing Algorithms and Architecture
29.77
article

Colloquium: Qudits for decomposing multiqubit gates and realizing quantum algorithms

Evgeniy O. Kiktenko, Aleksey K. Fedorov, Anastasiia S. Nikolaeva
article en
12 citations

Abstract

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.

Reviews of Modern PhysicsVol. 97(2)
National University of Science and Technology (RU), National University of Science and Technology (ZW), Russian Quantum Center (RU)
Russian Science Foundation, National University of Science and Technology
Openalex Percentile: Top 0%
Quantum Computing Algorithms and Architecture
29.77
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.