Hybrid quantum-classical (HQC) computing is the dominant near-term paradigm, yet its energy accounting is rarely made explicit: the classical control, readout, cryogenic, and orchestration hardware surrounding the quantum processing unit (QPU) can dominate the total power budget, eroding any thermodynamic advantage the quantum subsystem might offer. We develop a quantitative framework that partitions the energy cost of hybrid workflows into three layers — quantum execution (including cryogenics), the classical-quantum interface (control/readout), and classical compute — parameterized by cycle time, shot count, error-correction overhead, and data volume crossing the boundary. We derive closed-form per-iteration energy expressions, a delegation (partitioning) criterion for assigning subtasks to the quantum layer, and a break-even condition under which quantum acceleration yields net thermodynamic benefit. All arithmetic is shown explicitly. For a representative variational-workload reference case (100 physical qubits, 10,000 shots/iteration, 1,000 iterations), we compute a total workflow energy of 27.7 MJ, of which the cryogenic/quantum layer accounts for 98.304%, the interface 0.49%, and classical compute 1.21%; the quantum subroutine must deliver a classical-equivalent speedup of ≈ 69× for thermodynamic break-even. We further show that (i) workload sharing across 10 concurrent workflows reduces total energy ≈ 6.8× and raises the non-quantum share to 11.5%, (ii) measurement batching reduces interface energy by a computed 8.3–10×, and (iii) at the device level, reversible control logic bounded by the Landauer limit (k_B T ln 2 ≈ 2.87 × 10⁻²¹ J at 300 K) offers up to a computed 5× reduction of the control-layer energy share, though this share is itself small at system scale. A 15-month staged validation roadmap is included. All quantitative results are analytically derived with stated assumptions or explicitly labeled projections; no empirical measurements are claimed. Full text and updates: papers.qnfo.org/papers/thermodynamic-budgeting-for-hybrid-quantum-classical-computing-a-three-layer-ene/
Hybrid quantum-classical (HQC) computing is the dominant near-term paradigm, yet its energy accounting is rarely made explicit: the classical control, readout, cryogenic, and orchestration hardware surrounding the quantum processing unit (QPU) can dominate the total power budget, eroding any thermodynamic advantage the quantum subsystem might offer. We develop a quantitative framework that partitions the energy cost of hybrid workflows into three layers — quantum execution (including cryogenics), the classical-quantum interface (control/readout), and classical compute — parameterized by cycle time, shot count, error-correction overhead, and data volume crossing the boundary. We derive closed-form per-iteration energy expressions, a delegation (partitioning) criterion for assigning subtasks to the quantum layer, and a break-even condition under which quantum acceleration yields net thermodynamic benefit. All arithmetic is shown explicitly. For a representative variational-workload reference case (100 physical qubits, 10,000 shots/iteration, 1,000 iterations), we compute a total workflow energy of 27.7 MJ, of which the cryogenic/quantum layer accounts for 98.304%, the interface 0.49%, and classical compute 1.21%; the quantum subroutine must deliver a classical-equivalent speedup of ≈ 69× for thermodynamic break-even. We further show that (i) workload sharing across 10 concurrent workflows reduces total energy ≈ 6.8× and raises the non-quantum share to 11.5%, (ii) measurement batching reduces interface energy by a computed 8.3–10×, and (iii) at the device level, reversible control logic bounded by the Landauer limit (k_B T ln 2 ≈ 2.87 × 10⁻²¹ J at 300 K) offers up to a computed 5× reduction of the control-layer energy share, though this share is itself small at system scale. A 15-month staged validation roadmap is included. All quantitative results are analytically derived with stated assumptions or explicitly labeled projections; no empirical measurements are claimed. Full text and updates: papers.qnfo.org/papers/thermodynamic-budgeting-for-hybrid-quantum-classical-computing-a-three-layer-ene/
Hybrid quantum–classical (HQC) computing refers to the approach of executing algorithms coherently on both quantum and classical resources. This approach makes the best use of current or near-term quantum computers by sharing the workload with classical high-performance computing. However, HQC algorithms often require a back-and-forth exchange of data between quantum and classical processors, causing system bottlenecks and leading to high latency in applications. The objective of this study is to investigate novel frameworks that unify quantum and reconfigurable resources for HQC and mitigate system bottleneck and latency issues. In this paper, we propose a reconfigurable framework for hybrid quantum–classical computing. The proposed framework integrates field-programmable gate arrays (FPGAs) with quantum processing units (QPUs) for deploying HQC algorithms. The classical subroutines of the algorithms are accelerated on FPGA fabric using a high-throughput processing pipeline, while quantum subroutines are executed on the QPUs. High-level software is used to seamlessly facilitate data exchange between classical and quantum workloads through high-performance channels. To evaluate the proposed framework, an HQC algorithm, namely variational quantum classification, and the MNIST dataset are used as a test case. We present a quantitative comparison of the proposed framework with a state-of-the-art quantum software framework running on a server-grade CPU. The results demonstrate that the FPGA pipeline achieves up to 8× improvement in runtime compared to the CPU baseline.
Today's Quantum Processing Units (QPUs) are too small and too noisy to solve large combinatorial optimization problems directly, so practical hybrid solvers split a problem into pieces and iterate a decompose-solve-aggregate loop over whatever backends are available: classical heuristics, simulators, emulators, or a QPU. In practice, the loop is a driver script. It sits on top of the quantum-HPC middleware, handling task generation, provenance, recovery, and portability. Instead, we treat the loop as a scientific workflow and ask what a workflow layer adds to a generic workflow management system and QPU-sharing middleware. Two decomposition patterns from real applications, iterative consensus (ADMM) and hierarchical partitioning, turn out to stress the orchestration layer very differently: over 120 managed runs, orchestration took 78.4% of end-to-end time for the iterative pattern, almost all of it in a per-round barrier, but only 6.2% for the hierarchical one. Our workflow model adds four things a generic engine does not have: a termination predicate residing in the task graph that reads the previous round's residuals, subproblem-level recovery with warm-start and quorum-deferred aggregation, failover from a QPU to a classical replica within a round, and a provenance schema that describes CPUs, simulators and QPUs with the same fields, including the shot budget included. We report the cost of each layer on our engine, show that speculative re-execution enable runs to complete under injected failures that stall an unmanaged driver. We also use the same provenance to give per-device latency tails across simulators, emulators and IQM QPUs.
Phase III of the Qubit Delusion series. Examines fundamental physical limits on computation: Landauer bound, Margolus-Levitin theorem, Bremermann limit, Bekenstein bound. Shows that quantum error-correction overhead (1e2-1e3 physical operations per logical operation) multiplies thermodynamic cost beyond what any polynomial algorithmic speedup can overcome. Proposes a falsifiable criterion: joules per solution on commercially relevant problems. Assesses all major quantum platforms against this criterion. Identifies reversible computing as the only paradigm that can approach the true physical limits. Full text and updates: https://papers.qnfo.org/papers/paper-physics-of-computation/
High-performance computing (HPC) has evolved over decades through multiple architectural transitions, from vector supercomputers to massively parallel CPU clusters and GPU-accelerated systems, continuously expanding the frontier of scientific discovery. With the emergence of quantum processing units (QPUs) as practical computational accelerators, a new opportunity arises to further extend this trajectory by integrating quantum and classical computing paradigms. Building on the emerging vision of Quantum Integrated High-Performance Computing (QHPC), this paper contributes a full-stack layered architecture that integrates QPUs as first-class accelerators within, not merely alongside, the classical HPC software and hardware stack, with tight, on-premise quantum-classical coupling as its defining characteristic. The architecture comprises of unified resource management, quantum-aware scheduling, hybrid workflow orchestration, middleware and programming abstraction, interconnect technologies, and a tiered execution model enabling seamless workload partitioning across classical and quantum backends. A central aspect of this architecture is a strong user requests abstraction layer that exposes heterogeneous resources through a unified job submission interface, similar in spirit to existing schedulers such as Slurm, allowing users to describe workloads in a consistent template independent of underlying compute type or location. Drawing insights from prior accelerator integration eras, we outline how QHPC can support emerging workloads in quantum chemistry, materials discovery, combinatorial optimization, and climate modeling. We conclude by highlighting open challenges in building scalable, reliable, and programmable quantum-classical infrastructures that seamlessly connect global users to heterogeneous compute resources for future quantum-classical HPC ecosystems.
Deep learning inference and training are increasingly limited not by raw throughput but by the energy cost of protecting computation against bit-level faults arising from aggressive low-voltage operation, near-threshold computing, or radiation-prone deployment environments. This paper reconciles three independent design studies into a single analytical assessment of a hybrid quantum-classical architecture in which a quantum co-processor supplies coherence-based primitives—syndrome extraction, amplitude-based confidence estimation, and quantum-enhanced sampling—to assist the error-correction layer of a classical deep-learning accelerator, rather than to replace it. We ground the design in the vertical/horizontal taxonomy of hybrid quantum-classical computing and in dataflow frameworks for orchestrating heterogeneous workloads. Our contribution is analytical, with all arithmetic shown: we derive the energy budget of classical error-correction codes (Hamming SEC-DED and BCH(t=2)) at realistic bit-error rates, the coherence-time and shot-count constraints a quantum co-processor must satisfy, and the break-even conditions under which quantum assistance reduces per-inference correction energy. With superconducting qubits at 100 µs coherence and 10 µs round-trip latency, quantum-assisted correction breaks even only at bit-error rates below approximately 8.2 × 10⁻¹² per bit (4.1 × 10⁻¹⁰ under the most favorable sunk-cost accounting)—far below any regime where correction is needed. Under a conservative fault model (per-MAC bit-error rate 10⁻⁵, margin-sensitivity κ = 0.02), the maximum defensible accuracy recovery is 0.2 percentage points, not 20%. We identify the failure modes that would falsify the approach, the parameter regimes that could revive it, and the experiments required to test it. The central finding is negative and robust: coherence-assisted error correction for deep learning cannot currently be justified on energy grounds, though bounded accuracy-recovery and s Full text and updates: papers.qnfo.org/papers/coherence-assisted-error-correction-for-deep-learning-a-reconciled-feasibility-a/
Hybrid quantum-classical algorithms represent the dominant computational paradigm for near-term quantum advantage: classical co-processors handle data pre-processing, parameter optimisation, and post-processing, while quantum processors execute short-depth circuits that exploit superposition and entanglement for tasks classically hard to simulate. Despite growing interest, a systematic framework for designing, benchmarking, and selecting hybrid architectures across diverse computational task categories has been absent. This paper proposes the Hybrid Quantum-Classical Algorithm Design (HQCAD) framework, covering four hybrid paradigms: Variational Quantum-Classical Loops (VQCL) for optimisation and ground-state estimation; Quantum-Enhanced Machine Learning (QEML) combining quantum feature maps with classical classifiers; Quantum-Classical Divide-and-Conquer (QCDC) for graph and combinatorial problems; and Quantum-Accelerated Monte Carlo (QAMC) for sampling-based inference. HQCAD is benchmarked on six tasks -- molecular ground-state energy, binary classification, graph partitioning, financial Monte Carlo, protein fold scoring, and logistics routing -- on IBM Quantum Eagle (127-qubit) and IonQ Aria (25-qubit). VQCL achieves chemical accuracy (error < 1.6 mHa) for H2O ground-state energy. QEML achieves test AUC = 0.924 vs. classical SVM 0.884 on a quantum-advantage dataset. QAMC delivers 8.4x variance reduction for financial option pricing vs. classical Monte Carlo at equal shot budget. HQCAD provides a task-adaptive hybrid algorithm selection methodology validated across six computational domains.