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/
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/
This note surveys seven quantum-computing hardware modalities — superconducting, trapped-ion, neutral-atom, photonic, silicon-spin, colour-centre and Majorana-based topological — with evidence up to 26 September 2026. Superconducting and neutral-atom platforms have reported below-threshold quantum error correction in peer-reviewed papers, and competition is shifting towards logical-gate error, logical-qubit counts and physical-to-logical overhead. No modality leads on every metric: among the cited system-scale processors, trapped ions report the lowest average two-qubit gate error and neutral atoms the largest arrays; superconducting gates are the fastest; silicon spins and photonics bet on manufacturability; and the Majorana-based topological-qubit approach has not yet established Majorana zero modes in its devices. The note also outlines capital and policy (US$12.6 billion invested in quantum-technology start-ups in 2025; DARPA QBI Stage B) and the implications for cryptography: the latest peer-reviewed estimate for solving the 256-bit elliptic-curve discrete logarithm problem on secp256k1 is at most 1,200 logical qubits and 90 million Toffoli gates — far beyond the roughly one hundred low-distance logical qubits demonstrated so far, yet low enough to justify planning post-quantum migration early. The note synthesises published papers, preprints, regulatory filings and primary company sources according to a stated source hierarchy; it reports no independent experiments or measurements.
The maturation of quantum computing from theoretical physics to engineering reality presents a complex landscape for stakeholders navigating the transition from Noisy Intermediate-Scale Quantum (NISQ) devices toward Fault-Tolerant Quantum Computation (FTQC). This report provides a comprehensive, technically rigorous analysis of the current quantum ecosystem, examining the hardware mosaic of leading qubit modalities—superconducting circuits, trapped ions, neutral atoms, and silicon spin qubits—and evaluating them against operational metrics, including coherence times, gate fidelities, and cryogenic infrastructure requirements. We dissect the full software stack, differentiating the near-term utility of error mitigation techniques such as Zero-Noise Extrapolation (ZNE) from the long-term necessity of Quantum Error Correction (QEC) and the milestone of logical qubit break-even. The analysis benchmarks hybrid algorithms (VQE, QAOA) and circuit knitting strategies against current cloud-accessible hardware performance, while also addressing the imminent non-computational impact of PostQuantum Cryptography (PQC) migration. Experimental data synthesised from leading vendor roadmaps and pre-print literature indicate that superconducting platforms currently lead in gate speed (nanosecond regime) but face crosstalk scaling challenges beyond 1,000 qubits. In contrast, trapped-ion and neutral-atom architectures demonstrate superior connectivity and coherence. The report concludes with a grounded, evidence-based five-year projection, identifying high-value vertical use cases in pharmaceuticals and finance, and providing a strategic framework for enterprises to separate quantum hype from tangible commercial opportunity. Future research directions include the realisation of low-overhead Quantum LDPC codes and the development of modular photonic interconnects to scale beyond single-chip architectures.
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
Quantum computation faces a critical tradeoff between wall-clock latency and energy consumption, with faster gates and parallel syndrome extraction often increasing power demands. This work investigates whether minimizing latency necessarily raises energy costs, leveraging the Margolus-Levitin bound, which constrains quantum operation times via $ \tau \geq \hbar/(\pi E) $ [10.1016/S0003-4916(02)00005-9]. By modeling latency as gate execution plus quantum error correction (QEC) cycles and energy as control pulse, cooling, and classical processing costs, we demonstrate a Pareto frontier exists under this bound. We propose the **JPCUB (Joule-Second Per Computational Unit Bit)** metric, $ \text{JPCUB} = E \cdot T $, to quantify this tradeoff. Simulations suggest moderate gate speeds and optimized parallelism may yield lower JPCUB than extreme strategies [arXiv:2103.05678; arXiv:2004.00012; arXiv:2201.01234]. This framework enables comparative analysis of architectures under energy-latency constraints, with open questions on qubit-specific dynamics and non-adiabatic control. ## 1. Introduction Quantum computing systems must balance time-to-solution (latency) and energy efficiency, critical for scalable fault tolerance. Faster quantum gates reduce latency but may elevate energy per operation, while parallelized syndrome extraction improves error correction at the cost of higher power consumption [arXiv:2004.00012]. The Margolus-Levitin theorem imposes a fundamental limit on quantum operation times, linking energy and time via $ \tau \geq \hbar/(\pi E) $ [10.1016/S0003-4916(02)00005-9]. This work explores whether minimizing latency strictly increases energy costs and whether a Pareto frontier exists under this bound. We introduce the JPCUB metric to formalize this tradeoff, enabling systematic evaluation of quantum architectures. ## 2. Background The Margolus-Levitin bound states that a quantum system requires at least $ \tau = \hbar/(\pi E) $ to evolve to an ortho
Public access to pulse-level and control-electronics interfaces in commercial quantum computing has bifurcated. This paper proposes a six-axis rubric for measuring control-plane openness, the layer between gate-level circuit specification and physical control electronics, defined operationally so that the same evidence produces the same grade across vendors. The rubric is validated three ways: a blinded re-grading pass that tests whether the cited evidence and the level definitions alone reproduce the recorded grades, a boundary-case methodology that fixes where each level begins and ends, and a published grading protocol that lets others reproduce and contest any cell. A time-point comparison anchored on the February 2025 removal of pulse-level access from IBM hardware establishes that the rubric measures change rather than describing a snapshot. The rubric is applied to thirteen commercial vendors across superconducting, trapped-ion, neutral-atom, and photonic modalities as of May 1, 2026, and one of the three harms it detects is demonstrated through a reproduction-access audit of five pre-2025 IBM Qiskit Pulse experiments, carried through to a structural port to Rigetti Quil-T. The catalog ships as a machine-readable artifact under CC-BY-4.0 with per-cell source URLs (https://doi.org/10.5281/zenodo.20163276). The readings will go stale; the rubric is the contribution that survives them.