Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2302.04543 · npj Quantum Information

Noisy qudit vs multiple qubits: conditions on gate efficiency for enhancing fidelity

Denis Janković, Jean-Gabriel Hartmann, Mario Ruben, Paul-Antoine Hervieux

Published Jun 10, 2024• 39 citations
arXivHTMLPDF

Abstract

Abstract As qubit-based platforms face near-term technical challenges in terms of scalability, qudits, d -level bases of quantum information, are being implemented in multiple platforms as an alternative for Quantum Information Processing (QIP). We compare the infidelity scalings of single qudit and multiqubit systems within identical Hilbert space dimensions and noisy environments in the Lindblad formalism. We find them to be gate-independent to first-order and present an analytically-derived critical curve $$({d}^{2}-1)/3{\log }_{2}(d)$$ ( d 2 − 1 ) / 3 log 2 ( d ) that benchmarks the operational time efficiency of qudits and qubits relative to their decoherence times. This comparison reveals conditions under which qudits offer competitive gate efficiencies compared to leading qubit platforms. Our findings, supported by numerical simulations testing the applicability and limits of the linear response formalism, highlight the relevance of qudits in near-term QIP. This provides a benchmark for evaluating qudit platforms, specifically those with lower dimensionality, in terms of their operational efficiency relative to the qubit state-of-the-art.

DOI
10.1038/s41534-024-00829-6

Related papers

Nonlinearity of the Fidelity in Open Qudit Systems: Gate and Noise Dependence in High-dimensional Quantum Computing

Jean-Gabriel Hartmann, Denis Janković, Rémi Pasquier +2 more

High-dimensional quantum computing has generated significant interest due to its potential to address scalability and error correction challenges faced by traditional qubit-based systems. This paper investigates the Average Gate Fidelity (AGF) of single qudit systems under Markovian noise in the Lindblad formalism, extending previous work by developing a comprehensive theoretical framework for the calculation of higher-order correction terms. We derive general expressions for the perturbative expansion of the Average Gate Infidelity (AGI) in terms of the environmental coupling coefficient and validate these with extensive numerical simulations, emphasizing the transition from linear to nonlinear behaviour in the strong coupling regime. Our findings highlight the dependence of AGI on qudit dimensionality, quantum gate choice, and noise strength, providing critical insights for optimising quantum gate design and error correction protocols. Additionally, we utilise our framework to identify universal bounds for the AGI in the strong coupling regime and explore the practical implications for enhancing the performance of near-term qudit architectures. This study offers a robust foundation for future research and development in high-dimensional quantum computing, contributing to the advancement of robust, high-fidelity quantum operations.

arXiv:2406.15141•Quantum•Apr 7, 2025•6 citations

On the role of entanglement in qudit-based circuit compression

Xiaoqin Gao, Paul Appel, Nicolai Friis +2 more

Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the major experimental challenges since it requires controlled interactions between individual systems. To make the most of quantum hardware it is crucial to process information in the most efficient way. One promising avenue is to use higher-dimensional systems, qudits, as the fundamental units of quantum information, in order to replace a fraction of the qubit-entangling gates with qudit-local gates. Here, we show how the complexity of multi-qubit circuits can be lowered significantly by employing qudit encodings, which we quantify by considering exemplary circuits with exactly known (multi-qubit) gate complexity. We discuss general principles for circuit compression, derive upper and lower bounds on the achievable advantage, and highlight the key role played by entanglement and the available gate set. Explicit experimental schemes for photonic as well as for trapped-ion implementations are provided and demonstrate a significant expected gain in circuit performance for both platforms.

arXiv:2209.14584•Quantum•Oct 16, 2023•19 citations

Efficient realization of quantum algorithms with qudits

Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko, Aleksey K. Fedorov

Abstract The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits). Our method uses a transpilation of a circuit in the standard qubit form, which depends on the characteristics of a qudit-based processor, such as the number of available qudits and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization of quantum algorithms highlighting potential advantages of qudits. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set. We then illustrate our method by considering an example of an efficient implementation of a 6-qubit quantum algorithm with qudits. In this particular example, we demonstrate how using qudits allows a decreasing amount of two-body interactions in the qubit circuit implementation. We expect that our findings are of relevance for ongoing experiments with noisy intermediate-scale quantum devices that operate with information carriers allowing qudit encodings, such as trapped ions and neutral atoms, as well as optical and solid-state systems.

arXiv:2111.04384•EPJ Quantum Technology•Jun 26, 2024•64 citations

A short review on qudit quantum machine learning

Tiago de Souza Farias, Lucas Friedrich, Jonas Maziero

As quantum devices scale toward practical machine learning applications, the binary qubit paradigm faces expressivity and resource efficiency limitations. Multi-level quantum systems, or qudits, offer a promising alternative by harnessing a larger Hilbert space, enabling richer data embeddings, more compact variational circuits, and support for multi-valued problem structures. In this work, we review the role of qudits in quantum machine learning techniques, mainly variational quantum algorithms and quantum neural networks. Drawing on recent experimental demonstrations, including high-level superconducting transmons, qutrit-based combinatorial optimization, and single-qudit classifiers, we highlight how qudit architectures can reduce circuit depth and parameter counts while maintaining competitive fidelity. We further assess the evolving software ecosystem, from specialized simulators and differentiable-programming libraries to extensions of mainstream frameworks. We also identify key challenges in control complexity, noise management, and tooling maturity.

arXiv:2505.05158•May 8, 2025•3 citations

Qudits and High-Dimensional Quantum Computing

Yuchen Wang, Zixuan Hu, Barry C. Sanders +1 more

Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP gate, and the multi-level-controlled gate. We then present the qudit version of several representative quantum algorithms including the Deutsch-Jozsa algorithm, the quantum Fourier transform, and the phase estimation algorithm. Finally we discuss various physical realizations for qudit computation such as the photonic platform, iron trap, and nuclear magnetic resonance.

arXiv:2008.00959•Frontiers in Physics•Nov 10, 2020•591 citations

Leveraging high-dimensional qudits for quantum communication and computation

Yaron Bromberg, Ohad Lib

Photons can carry quantum information not only in two-level systems (qubits) but also in d-level systems known as qudits. A single photon distributed across d optical modes can encode up to log2(d) qubits of information, allowing for more efficient use of quantum resources and increased resilience to noise. This advantage, however, comes at a price: implementing quantum gates and performing measurements in high-dimensional Hilbert spaces is significantly more demanding than in the qubit case. To tackle these challenges, I will present our recent work developing new protocols and optical hardware that enable quantum communication and computation with high-dimensional qudits encoded in the temporal or spatial modes of single and entangled photons. I will discuss our experimental implementations of quantum key distribution using weak coherent pulses [Sulimany et al., NPJ Quantum Information 11, 16 (2025)], single photons from quantum dots [Halevi et al., Optica Quantum 2, 351 (2024)], and entangled photon pairs [Lib et al., Optica Quantum 3, 182 (2025)]. In the latter, we demonstrated projective measurements in two mutually unbiased bases for $d = 25$ using a multi-plane light converter (MPLC). I will also show how the same MPLC platform can be used to perform elementary operations in measurement-based quantum computation with high-dimensional cluster states [Lib and Bromberg, Nat. Photonics 18, 1218 (2024)]. Throughout the talk, I will discuss the tradeoffs between qubit- and qudit-based approaches and highlight the regimes where high-dimensional systems offer a practical advantage.

Quantum Computing, Communication, and Simulation•Mar 5, 2026•0 citations
Abstract As qubit-based platforms face near-term technical challenges in terms of scalability, qudits, d -level bases of quantum information, are being implemented in multiple platforms as an alternative for Quantum Information Processing (QIP). We compare the infidelity scalings of single qudit and multiqubit systems within identical Hilbert space dimensions and noisy environments in the Lindblad formalism. We find them to be gate-independent to first-order and present an analytically-derived critical curve (d2−1)/3log⁡2(d)({d}^{2}-1)/3{\log }_{2}(d)(d2−1)/3log2​(d) ( d 2 − 1 ) / 3 log 2 ( d ) that benchmarks the operational time efficiency of qudits and qubits relative to their decoherence times. This comparison reveals conditions under which qudits offer competitive gate efficiencies compared to leading qubit platforms. Our findings, supported by numerical simulations testing the applicability and limits of the linear response formalism, highlight the relevance of qudits in near-term QIP. This provides a benchmark for evaluating qudit platforms, specifically those with lower dimensionality, in terms of their operational efficiency relative to the qubit state-of-the-art.
High-dimensional quantum computing has generated significant interest due to its potential to address scalability and error correction challenges faced by traditional qubit-based systems. This paper investigates the Average Gate Fidelity (AGF) of single qudit systems under Markovian noise in the Lindblad formalism, extending previous work by developing a comprehensive theoretical framework for the calculation of higher-order correction terms. We derive general expressions for the perturbative expansion of the Average Gate Infidelity (AGI) in terms of the environmental coupling coefficient and validate these with extensive numerical simulations, emphasizing the transition from linear to nonlinear behaviour in the strong coupling regime. Our findings highlight the dependence of AGI on qudit dimensionality, quantum gate choice, and noise strength, providing critical insights for optimising quantum gate design and error correction protocols. Additionally, we utilise our framework to identify universal bounds for the AGI in the strong coupling regime and explore the practical implications for enhancing the performance of near-term qudit architectures. This study offers a robust foundation for future research and development in high-dimensional quantum computing, contributing to the advancement of robust, high-fidelity quantum operations.
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the major experimental challenges since it requires controlled interactions between individual systems. To make the most of quantum hardware it is crucial to process information in the most efficient way. One promising avenue is to use higher-dimensional systems, qudits, as the fundamental units of quantum information, in order to replace a fraction of the qubit-entangling gates with qudit-local gates. Here, we show how the complexity of multi-qubit circuits can be lowered significantly by employing qudit encodings, which we quantify by considering exemplary circuits with exactly known (multi-qubit) gate complexity. We discuss general principles for circuit compression, derive upper and lower bounds on the achievable advantage, and highlight the key role played by entanglement and the available gate set. Explicit experimental schemes for photonic as well as for trapped-ion implementations are provided and demonstrate a significant expected gain in circuit performance for both platforms.
Abstract The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits). Our method uses a transpilation of a circuit in the standard qubit form, which depends on the characteristics of a qudit-based processor, such as the number of available qudits and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization of quantum algorithms highlighting potential advantages of qudits. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set. We then illustrate our method by considering an example of an efficient implementation of a 6-qubit quantum algorithm with qudits. In this particular example, we demonstrate how using qudits allows a decreasing amount of two-body interactions in the qubit circuit implementation. We expect that our findings are of relevance for ongoing experiments with noisy intermediate-scale quantum devices that operate with information carriers allowing qudit encodings, such as trapped ions and neutral atoms, as well as optical and solid-state systems.
As quantum devices scale toward practical machine learning applications, the binary qubit paradigm faces expressivity and resource efficiency limitations. Multi-level quantum systems, or qudits, offer a promising alternative by harnessing a larger Hilbert space, enabling richer data embeddings, more compact variational circuits, and support for multi-valued problem structures. In this work, we review the role of qudits in quantum machine learning techniques, mainly variational quantum algorithms and quantum neural networks. Drawing on recent experimental demonstrations, including high-level superconducting transmons, qutrit-based combinatorial optimization, and single-qudit classifiers, we highlight how qudit architectures can reduce circuit depth and parameter counts while maintaining competitive fidelity. We further assess the evolving software ecosystem, from specialized simulators and differentiable-programming libraries to extensions of mainstream frameworks. We also identify key challenges in control complexity, noise management, and tooling maturity.
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP gate, and the multi-level-controlled gate. We then present the qudit version of several representative quantum algorithms including the Deutsch-Jozsa algorithm, the quantum Fourier transform, and the phase estimation algorithm. Finally we discuss various physical realizations for qudit computation such as the photonic platform, iron trap, and nuclear magnetic resonance.
Photons can carry quantum information not only in two-level systems (qubits) but also in d-level systems known as qudits. A single photon distributed across d optical modes can encode up to log2(d) qubits of information, allowing for more efficient use of quantum resources and increased resilience to noise. This advantage, however, comes at a price: implementing quantum gates and performing measurements in high-dimensional Hilbert spaces is significantly more demanding than in the qubit case. To tackle these challenges, I will present our recent work developing new protocols and optical hardware that enable quantum communication and computation with high-dimensional qudits encoded in the temporal or spatial modes of single and entangled photons. I will discuss our experimental implementations of quantum key distribution using weak coherent pulses [Sulimany et al., NPJ Quantum Information 11, 16 (2025)], single photons from quantum dots [Halevi et al., Optica Quantum 2, 351 (2024)], and entangled photon pairs [Lib et al., Optica Quantum 3, 182 (2025)]. In the latter, we demonstrated projective measurements in two mutually unbiased bases for d=25d = 25d=25 using a multi-plane light converter (MPLC). I will also show how the same MPLC platform can be used to perform elementary operations in measurement-based quantum computation with high-dimensional cluster states [Lib and Bromberg, Nat. Photonics 18, 1218 (2024)]. Throughout the talk, I will discuss the tradeoffs between qubit- and qudit-based approaches and highlight the regimes where high-dimensional systems offer a practical advantage.