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

The Qudit Advantage: System-Level Joules-per-Solution Comparison of a Qudit Architecture Against 17 Conventional Qubit Quantum Computing Platforms

Rowan Brad Quni-Gudzinas

Published Aug 6, 2026• 0 citations
Publisher

Abstract

JPCUB framework extended to qudit architectures. Under model assumptions, qudit platform projects below 10^-2 J/sol. CRITICAL CAVEAT: JPCUB framework has not been externally validated. All estimates are hypothesis, not demonstrated result. v0.6.1: corrected paper body with self-DOI fix. AI-QUALITY-GATE-1 fixes applied. See ERRATA.md.
DOI
10.5281/zenodo.21826595

Related papers

[SUPERSEDED] The Qudit Advantage: System-Level Joules-per-Solution Comparison of a Qudit Architecture Against 17 Conventional Qubit Quantum Computing Platforms

Rowan Brad Quni-Gudzinas

SUPERSEDED by v0.6.1 (DOI 10.5281/zenodo.21879117). This record was created via the deposit API under a detached concept (21879020). The canonical version chain is v0.4 (21827737) -> v0.5 (21878856) -> v0.6 (21879110) -> v0.6.1 (21879117) under concept 21826595. This record is retained for DOI stability but is not the canonical publication.

•Aug 10, 2026•0 citations

JPCUB Competitive Landscape v2.0: System-Level Joules-per-Solution Estimates for 17 Quantum Computing Platforms from Published Specifications

Rowan Brad Quni-Gudzinas

Companion paper to JPCUB P0 (DOI 10.5281/zenodo.21637028). Computes joules-per-solution (JPCUB) estimates for 17 quantum computing platforms from published specifications: 13 gate-model (7 superconducting, 4 trapped-ion, 2 neutral-atom) plus 2 annealing, 1 photonic, and 1 pre-commercial target. Key finding: gate speed dominates joules-per-solution. Superconducting platforms (0.05-0.71 J/sol) lead via 30-500 ns gates; neutral atoms (0.32-0.62 J/sol) balance Rydberg-gate speed with room-temperature operation; trapped ions (8.5-16.3 J/sol) rank last because 50-100 us gate times overwhelm the room-temperature power advantage. Only IBM Eagle has a published JPCUB (0.89 J/sol, P0). All other values are conservative system-level upper bounds pending independent measurement per JPCUB P0 adversarial validation provisions. Includes reproducible computation script and full specification-source traceability. Full text and updates: https://papers.qnfo.org/papers/jpcub-competitive-landscape/

•Aug 6, 2026•0 citations

Revising the Joules-per-Compute (JPCUB) Benchmark: Normalizing Energy Efficiency by Logical-Qubit Operations

Rowan Brad Quni-Gudzinas

Current joules-per-compute (JPCUB) benchmarks normalize energy consumption per physical gate, conflating logical operations with error-correction overhead. This obscures trade-offs between qubit connectivity, gate fidelity, and fault-tolerant design, hindering equitable comparisons of quantum processors. We propose a revised JPCUB metric that normalizes energy use per logical-qubit operation, isolating logical computation from error-correction infrastructure. The protocol involves executing standardized logical circuits (e.g., Clifford operations) on surface-code qubits, measuring total energy, and decomposing it into logical gate costs and error-correction overhead. By standardizing benchmark circuits and energy measurement techniques, this approach enables reproducible evaluations of quantum architectures. Simulations suggest [to verify] a 2–5× reduction in JPCUB for fault-tolerant systems compared to uncorrected benchmarks, highlighting the interplay between logical efficiency and error-correction demands. ## 1. Introduction Quantum computing architectures face escalating energy demands as they scale, necessitating rigorous metrics to evaluate efficiency. The existing JPCUB benchmark, which quantifies energy per physical gate [arXiv:2006.07065], fails to distinguish between the energy required for logical operations and that consumed by error correction. Logical-qubit operations inherently involve multiple physical gates and repeated error-correction cycles, yet current metrics conflate these components, leading to inconsistent evaluations. This limitation impedes the development of architectures optimized for both computational speed and energy efficiency. Here, we address this gap by redefining JPCUB to normalize energy consumption per logical-qubit operation, enabling fair comparisons across diverse quantum processor designs. ## 2. Background Quantum processors execute logical operations through sequences of physical gates, with error correction ensuri

•Sep 3, 2026•0 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

MQT Qudits: A Software Framework for Mixed-Dimensional Quantum Computing

Kevin Mato, Martin Ringbauer, Lukas Burgholzer +1 more

Quantum computing holds great promise for surpassing the limits of classical devices in many fields. Despite impressive developments, however, current research is primarily focused on qubits. At the same time, quantum hardware based on multi-level, qudit, systems offers a range of advantages, including expanded gate sets, higher information density, and improved computational efficiency, which might play a key role in overcoming not only the limitations of classical machines but also of current qubit-based quantum devices. However, working with qudits faces challenges not only in experimental control but particularly in algorithm development and quantum software. In this work, we introduce MQT Qudits, an open-source tool, which, as part of the Munich Quantum Toolkit (MQT), is built to assist in designing and implementing applications for mixed-dimensional qudit devices. We specify a standardized language for mixed-dimension systems and discuss circuit specification, compilation to hardware gate sets, efficient circuit simulation, and open challenges. MQT Qudits is available at github.com/cda-tum/mqt-qudits and on pypi at pypi.org/project/mqt.qudits.

arXiv:2410.02854•Oct 3, 2024•13 citations

qiskit-qudits: A Qiskit Extension for Simulating Qudit Circuits

Francesco Pudda

qiskit-qudits is a Qiskit extension that simulates d-level qudits by encoding each one into m = ceil(log_2 d) qubits. Qudit gates are exposed as ordinary Qiskit Gate and ControlledGate subclasses, and operations that are not unitary gates (measurement, reset, barrier, state preparation) as dedicated Instruction subclasses dispatched through a dedicated apply() hook; every gate carries both a dense encoded unitary (via NumPy's array protocol) and a qubit-level definition. Because d need not be a power of two, the encoded Hilbert space is generally larger than the logical one; the library resolves this by the identity-padding convention, in which every gate acts as the identity on the unphysical part of the encoded space. When every operand dimension is a power of two, gates decompose into a fixed, transpiler-recognisable cascade of standard qubit gates; otherwise the library falls back to exact dense unitary synthesis, so that dimensions 2 <= d <= 16 are supported exactly, not only powers of two. This paper describes the software's circuit model, gate hierarchy, decomposition strategy, and measurement/decoding machinery, states its limitations, and verifies the implementation numerically: the qudit QFT against the discrete Fourier transform for both power-of-two and non-power-of-two d, extending the check of the underlying theory paper, which could only be run for d = 2^m, and every gate's emitted decomposition against its dense unitary across the whole gate set.

quant-pharXiv:2608.22032•Aug 25, 2026•0 citations
Companion paper to JPCUB P0 (DOI 10.5281/zenodo.21637028). Computes joules-per-solution (JPCUB) estimates for 17 quantum computing platforms from published specifications: 13 gate-model (7 superconducting, 4 trapped-ion, 2 neutral-atom) plus 2 annealing, 1 photonic, and 1 pre-commercial target. Key finding: gate speed dominates joules-per-solution. Superconducting platforms (0.05-0.71 J/sol) lead via 30-500 ns gates; neutral atoms (0.32-0.62 J/sol) balance Rydberg-gate speed with room-temperature operation; trapped ions (8.5-16.3 J/sol) rank last because 50-100 us gate times overwhelm the room-temperature power advantage. Only IBM Eagle has a published JPCUB (0.89 J/sol, P0). All other values are conservative system-level upper bounds pending independent measurement per JPCUB P0 adversarial validation provisions. Includes reproducible computation script and full specification-source traceability. Full text and updates: https://papers.qnfo.org/papers/jpcub-competitive-landscape/
Current joules-per-compute (JPCUB) benchmarks normalize energy consumption per physical gate, conflating logical operations with error-correction overhead. This obscures trade-offs between qubit connectivity, gate fidelity, and fault-tolerant design, hindering equitable comparisons of quantum processors. We propose a revised JPCUB metric that normalizes energy use per logical-qubit operation, isolating logical computation from error-correction infrastructure. The protocol involves executing standardized logical circuits (e.g., Clifford operations) on surface-code qubits, measuring total energy, and decomposing it into logical gate costs and error-correction overhead. By standardizing benchmark circuits and energy measurement techniques, this approach enables reproducible evaluations of quantum architectures. Simulations suggest [to verify] a 2–5× reduction in JPCUB for fault-tolerant systems compared to uncorrected benchmarks, highlighting the interplay between logical efficiency and error-correction demands. ## 1. Introduction Quantum computing architectures face escalating energy demands as they scale, necessitating rigorous metrics to evaluate efficiency. The existing JPCUB benchmark, which quantifies energy per physical gate [arXiv:2006.07065], fails to distinguish between the energy required for logical operations and that consumed by error correction. Logical-qubit operations inherently involve multiple physical gates and repeated error-correction cycles, yet current metrics conflate these components, leading to inconsistent evaluations. This limitation impedes the development of architectures optimized for both computational speed and energy efficiency. Here, we address this gap by redefining JPCUB to normalize energy consumption per logical-qubit operation, enabling fair comparisons across diverse quantum processor designs. ## 2. Background Quantum processors execute logical operations through sequences of physical gates, with error correction ensuri
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.
Quantum computing holds great promise for surpassing the limits of classical devices in many fields. Despite impressive developments, however, current research is primarily focused on qubits. At the same time, quantum hardware based on multi-level, qudit, systems offers a range of advantages, including expanded gate sets, higher information density, and improved computational efficiency, which might play a key role in overcoming not only the limitations of classical machines but also of current qubit-based quantum devices. However, working with qudits faces challenges not only in experimental control but particularly in algorithm development and quantum software. In this work, we introduce MQT Qudits, an open-source tool, which, as part of the Munich Quantum Toolkit (MQT), is built to assist in designing and implementing applications for mixed-dimensional qudit devices. We specify a standardized language for mixed-dimension systems and discuss circuit specification, compilation to hardware gate sets, efficient circuit simulation, and open challenges. MQT Qudits is available at github.com/cda-tum/mqt-qudits and on pypi at pypi.org/project/mqt.qudits.
qiskit-qudits is a Qiskit extension that simulates d-level qudits by encoding each one into m = ceil(log_2 d) qubits. Qudit gates are exposed as ordinary Qiskit Gate and ControlledGate subclasses, and operations that are not unitary gates (measurement, reset, barrier, state preparation) as dedicated Instruction subclasses dispatched through a dedicated apply() hook; every gate carries both a dense encoded unitary (via NumPy's array protocol) and a qubit-level definition. Because d need not be a power of two, the encoded Hilbert space is generally larger than the logical one; the library resolves this by the identity-padding convention, in which every gate acts as the identity on the unphysical part of the encoded space. When every operand dimension is a power of two, gates decompose into a fixed, transpiler-recognisable cascade of standard qubit gates; otherwise the library falls back to exact dense unitary synthesis, so that dimensions 2 <= d <= 16 are supported exactly, not only powers of two. This paper describes the software's circuit model, gate hierarchy, decomposition strategy, and measurement/decoding machinery, states its limitations, and verifies the implementation numerically: the qudit QFT against the discrete Fourier transform for both power-of-two and non-power-of-two d, extending the check of the underlying theory paper, which could only be run for d = 2^m, and every gate's emitted decomposition against its dense unitary across the whole gate set.