Pith. sign in

REVIEW 4 cited by

Qudits for decomposing multiqubit gates and realizing quantum algorithms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.12003 v2 pith:BTXQ7URA submitted 2023-11-20 quant-ph

classification quant-ph
keywords quantumcolloquiuminformationalgorithmsqubitquditsusedcomputing
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum logic operations and algorithms in a single 25-level atomic qudit

    quant-ph 2025-07 conditional novelty 7.0 of 10

    A single 137Ba+ ion acts as a 25-level qudit with 99.51% heralded SPAM fidelity, and runs Bernstein-Vazirani and Toffoli circuits on up to four virtual qubits.

  2. Near-unity quantum interference of transverse spatial modes in an ultra-compact inverse-designed photonic device

    quant-ph 2025-05 conditional novelty 6.0 of 10

    Inverse-designed 3 µm transverse-mode beamsplitters achieve Hong-Ou-Mandel visibility up to 99.56±0.64%, averaging 99.38±0.41% across three copies.

  3. Compressed sensing quantum state tomography for qudits: A comparison of Gell-Mann and Heisenberg-Weyl observable bases

    quant-ph 2025-05 conditional novelty 5.0 of 10

    For the simulated rank-1 qudit states, the Heisenberg-Weyl observable basis consistently needs fewer measurements than the generalized Gell-Mann basis as qudit dimension grows, while both give high-fidelity reconstruction.

  4. Progress in the development of quantum algorithms and software

    quant-ph 2025-05 unverdicted novelty 2.0 of 10

    A review of the Russian Quantum Center's 2020-2024 quantum software roadmap, summarizing algorithms, emulators, error correction, and cloud execution, with no new results.

Pith tools