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

Quantum Optimization and Reinforcement Learning for Real-Time Plasma Control: QUBO/QAOA Actuator Scheduling and Quantum RL for Shape Control, without Claimed Advantage

Priyanca Ford, G L Kulcinski

Published Sep 7, 2026• 1 citation
Publisher

Abstract

Real-time control of a compact spherical-tokamak breeder poses, at several points, a combinatorial-optimization problem inside a control cycle: which actuators to schedule, how to lay out a discrete blanket, and — the control-relevant case — how to sequence poloidal- and toroidal-field coil currents under hard constraints while tracking a shape and vertical-position target. Because these problems are naturally binary and quadratic, they are the canonical near-term target for quantum optimization, and it is a fair, testable question whether a quantum processor solves them faster or better than a classical one. This paper answers that question with a formal treatment and a pre-registered result. We derive compact quadratic-unconstrained-binary-optimization (QUBO) encodings for all three problems from first principles — pulse cadence as a number-partitioning Ising model, blanket layout as a penalty-embedded assignment, and coil-current/actuator scheduling as a fixed-point-encoded quadratic tracking objective built on the free-boundary equilibrium shape-response Jacobian — and map each to two fault-tolerant primitives, a depth-three quantum approximate optimization ansatz (QAOA, p=3) and a D\"urr–Hyer Grover minimum-finder. At the frozen breeder design point (I_p=9.66 MA, Q=3.076, P_fus=85.04 MW, negative triangularity δ=-0.30, B_0=8 T, κ=2.0, =1.20 m, aspect ratio A=2.5, centrepost peak field 16.84 T) the design-scale instances need 23–61 logical qubits and 5×10^3–5.5×10^7 T-gates, verified against the Fowler surface-code and D\"urr–Hyer formulas across 50 resource rows with zero discrepancies. On the question of whether quantum hardware helps, we report an explicit negative: classical simulated annealing matches or beats QAOA on all three breeder QUBOs out to n=120 variables; the exact-to-heuristic crossover sits at n=12–16 (exact optima in 0.03–292 s of wall time); the QAOA approximation ratio plateaus at 0.90–0.95 and the circuits become classically unverifiable past n≈24; and a fleet-scale (n=120) Grover formulation would need 1.8×10^18 oracle calls and 1.2×10^23 T-gates — a resource boundary, not a route. We therefore place variational quantum reinforcement learning for shape and vertical-position control on a dated, benchmark-gated schedule: a quantum policy is admitted only if it meets or beats the classical controller at equal wall-clock with a control-barrier-certified safety filter held inviolate. All quantum and classical runs were carried out on the NVIDIA GPU HPC campaign. The deliverable is the honest, resource-grounded map of where quantum computing does — and does not — pay for real-time fusion control. Key results (frozen anchors): N_T = 1.2 ×10^23. Methods & codes: FreeGSNKE, FreeGS, Sauter, QAOA, VQE, ADAPT-VQE. Live verification: 4 gate validator(s) with live-recompute cards (2 reproduced, 1 revised, 1 estimated). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included.

DOI
10.5281/zenodo.22645902

Related papers

Quantum Algorithms for the Real-Time Control Loop: HHL Equilibrium Reconstruction, Disruption State-Estimation, and Edge-Turbulence Simulation with Resource-Honest Advantage Accounting

Priyanca Ford, G L Kulcinski

The real-time control loop of a compact spherical-tokamak breeder must reconstruct the equilibrium, watch for disruptions, and shape the plasma edge faster than a 9.66 plasma at =1.20 can move — a loop served today by classical GPU surrogates and a demonstrated in-winding quantum sensor. This paper asks, and answers with equal weight on both sides, where a quantum computer (as distinct from a quantum sensor) could accelerate that loop. We formalise a stack of four control-loop quantum algorithms as rigorous problems: an HHL-class linear solver for live Grad–Shafranov equilibrium reconstruction; a quantum-kernel state-estimator for disruption and runaway-electron precursor detection inside the shattered-pellet mitigation window; a Hamiltonian simulation of edge and scrape-off-layer turbulence to feed a predictive detachment controller; and a quantum-machine-learning surrogate for live transport prediction. For each we derive the governing operator, its discretization, and its fault-tolerant complexity, and we place them against the classical frontier through an explicit advantage inequality. Alongside the designs we report a completed characterization: the quantum-ML classifier loses discriminating power as it scales — area under the receiver-operating-characteristic curve falls from 0.817 at four qubits to 0.691 at eight, the calibrated signature of exponential kernel concentration — and a fault-tolerant kernel evaluation is 9–11 orders of magnitude slower than the classical route for this problem. Fault-tolerant resource estimates for the solver-class algorithms (edge/scrape-off-layer kinetics: ~44 logical qubits and ~19 days of single-instance runtime; linear kinetics: 11–19 logical qubits) confirm that none clears the advantage bar today, and the equilibrium solve, costed in absolute terms, is on the order of 10^17 Toffoli-equivalent T-gates — eleven orders of magnitude beyond the sub-millisecond loop budget on any plausible magic-state throughput. The honest conclusion is stated once: there is no measured quantum advantage on these control problems today. The deliverable is a validated set of algorithm designs, a resource-honest map of where a fault-tolerant machine will and provably will not help, and a dated roadmap that keeps the classical loop authoritative until a quantum route clears an explicit latency-and-fidelity bar. All numbers trace to frozen entries in the Kronos Physics De-Risking Register by their serial identifiers. Key results (frozen anchors): iter = 1.6 2^n. Methods & codes: FreeGSNKE, FreeGS, CGYRO, Sauter, QAOA, VQE, ADAPT-VQE. Live verification: 9 gate validator(s) with live-recompute cards (5 estimated, 4 reproduced). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included.

•Sep 7, 2026•1 citation

Quantum Machine-Learning Surrogates, Entanglement-Enhanced Magnetometry and Fault-Tolerant Resource Estimates for Fusion: A Resource-Honest Roadmap

Priyanca Ford, Robert J. Weggel, C Weggel

Quantum computing and quantum sensing are routinely proposed as accelerants for fusion; a serious design program should test those proposals quantitatively rather than assume them. We deliver a resource-honest map of where the quantum toolbox helps a compact spherical-tokamak breeder and its tandem-mirror burner, and where it does not, formalised as three coupled estimation problems and computed on a single GPU-HPC campaign. On the machine-learning front we build a quantum-kernel transport surrogate and measure its classifier area-under-curve (AUC) falling with encoding width — 0.817 at four qubits to 0.691 at eight — the signature of exponential kernel concentration, for which we give the variance bound and the induced shot-cost scaling; at a realistic 37-logical-qubit problem the quantum Gram evaluation is 9–11 orders of magnitude slower than its classical counterpart. On the sensing front we derive the entanglement-advantage condition from the quantum Fisher information and specify the in-cryostat magnetometry chain for the breeder centrepost (peak field 16.84 T, kept formally distinct from the burner plug at 26.49 T): an NMR/EPR probe as the absolute monitor to ≤1 ppm, a SQUID and an NV-diamond ensemble (1 pT Hz^-1/2) for the 1 mT quench precursor, with the entanglement knee located at a normalised signal ≈0.14. Every Kronos in-bore diagnostic sits below the knee, where entanglement buys only +0.00077 AUC; above it (deep error-field mapping) a Heisenberg-limited protocol carries the standard-quantum-limit sensitivity from 5.7×10^-7 to 5.7×10^-8 T at 100 probes. On the fault-tolerant front we recompute the resource ledger from first formulas — the Grover iteration count 1.62^n and the surface-code footprint 2d^2 physical qubits per logical qubit — across 50 rows with zero discrepancy, and date the single fusion-relevant near-term niche: linear Vlasov kinetics at 11–19 logical qubits around 2029±2, with nonlinear five-dimensional gyrokinetics beyond 2035 and fleet-scale Grover search never practical (1.8×10^18 iterations). Three further workloads keep the verdict resource-honest: full six-dimensional kinetic Hamiltonian simulation at ~44 logical qubits and ~19 days, fault-tolerant phase estimation of the exact REBCO/alloy ground state at ~238 logical qubits and ~10^9 Toffoli gates, and a Harrow–Hassidim–Lloyd equilibrium linear solve at ~10^17 T-gates — all calibration-only. Two of the six quantum-track items are already twin-testable classically: a materials variational eigensolver reproduces a model ground state to 3.9×10^-6 Ha and reaches chemical accuracy on 3d alloy fragments with 4–14× shallower circuits than unitary coupled cluster (no advantage claimed), and a tensor-network kinetic solver compresses the distribution function with exponential rank convergence (2.2×10^-10 at bond rank 16, 0.19× storage). The honest bottom line is that nothing on the design critical path waits on quantum hardware — and establishing that, with the numbers behind it, is the result. Key results (frozen anchors): iter = 1.8 ×10^18; iter = 1.6 2^n. Methods & codes: CGYRO, GENE, QAOA, VQE, ADAPT-VQE. Live verification: 11 gate validator(s) with live-recompute cards (5 reproduced, 5 estimated, 1 revised). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included.

•Sep 7, 2026•2 citations

Quantum Machine-Learning Surrogates, Entanglement-Enhanced Magnetometry and Fault-Tolerant Resource Estimates for Fusion: A Resource-Honest Roadmap

Priyanca Ford, P I Ford, Robert J. Weggel +1 more

Quantum computing and quantum sensing are routinely proposed as accelerants for fusion; a serious design program should test those proposals quantitatively rather than assume them. We deliver a resource-honest map of where the quantum toolbox helps a compact spherical-tokamak breeder and its tandem-mirror burner, and where it does not, formalised as three coupled estimation problems and computed on a single GPU-HPC campaign. On the machine-learning front we build a quantum-kernel transport surrogate and measure its classifier area-under-curve (AUC) falling with encoding width — 0.817 at four qubits to 0.691 at eight — the signature of exponential kernel concentration, for which we give the variance bound and the induced shot-cost scaling; at a realistic 37-logical-qubit problem the quantum Gram evaluation is 9–11 orders of magnitude slower than its classical counterpart. On the sensing front we derive the entanglement-advantage condition from the quantum Fisher information and specify the in-cryostat magnetometry chain for the breeder centrepost (peak field 16.84 T, kept formally distinct from the burner plug at 26.49 T): an NMR/EPR probe as the absolute monitor to ≤1 ppm, a SQUID and an NV-diamond ensemble (1 pT Hz^-1/2) for the 1 mT quench precursor, with the entanglement knee located at a normalised signal ≈0.14. Every Kronos in-bore diagnostic sits below the knee, where entanglement buys only +0.00077 AUC; above it (deep error-field mapping) a Heisenberg-limited protocol carries the standard-quantum-limit sensitivity from 5.7×10^-7 to 5.7×10^-8 T at 100 probes. On the fault-tolerant front we recompute the resource ledger from first formulas — the Grover iteration count 1.62^n and the surface-code footprint 2d^2 physical qubits per logical qubit — across 50 rows with zero discrepancy, and date the single fusion-relevant near-term niche: linear Vlasov kinetics at 11–19 logical qubits around 2029±2, with nonlinear five-dimensional gyrokinetics beyond 2035 and fleet-scale Grover search never practical (1.8×10^18 iterations). Three further workloads keep the verdict resource-honest: full six-dimensional kinetic Hamiltonian simulation at ~44 logical qubits and ~19 days, fault-tolerant phase estimation of the exact REBCO/alloy ground state at ~238 logical qubits and ~10^9 Toffoli gates, and a Harrow–Hassidim–Lloyd equilibrium linear solve at ~10^17 T-gates — all calibration-only. Two of the six quantum-track items are already twin-testable classically: a materials variational eigensolver reproduces a model ground state to 3.9×10^-6 Ha and reaches chemical accuracy on 3d alloy fragments with 4–14× shallower circuits than unitary coupled cluster (no advantage claimed), and a tensor-network kinetic solver compresses the distribution function with exponential rank convergence (2.2×10^-10 at bond rank 16, 0.19× storage). The honest bottom line is that nothing on the design critical path waits on quantum hardware — and establishing that, with the numbers behind it, is the result.Key results (frozen anchors): y_i = 0 eq; hbar = 2 ×28.03; iter = 1.8 ×10^18; iter = 1.6 2^n.Methods & codes: CGYRO, GENE, QAOA, VQE, ADAPT-VQE.Live verification: 11 gate validator(s) with live-recompute cards (5 reproduced, 5 estimated, 1 revised). See the Verification section and data/verification.csv.Related: Paper page · De-risking register · 3D model · Learn more about KronosPart of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689).All numerical values are frozen design-point anchors; see the register.Public research artifact. No proprietary, financial, or supply-chain information is included.

•Sep 9, 2026•0 citations

Quantum-Assisted Optimization for Ergonomics-Aware Human–Robot Task Allocation in Human-Centric Manufacturing - A QUBO Formulation, Quantum-Annealing and QAOA Benchmark Against Classical Baselines

Peter Nimbe, Joshua Akowuje Weyori¹, Bernard Kyiewu +1 more

Abstract Industry 5.0 shifts the focus of manufacturing automation toward human well-being, not just efficiency or output. This means task-allocation systems now have to juggle production targets, ergonomic safety, and what the workforce can realistically handle. Here, we introduce what we call the Ergonomics-Aware Human–Robot Task Allocation (EA-HRTA) problem. Picture it as a complex assignment challenge: for every task, we have to consider execution cost, whether the person or robot has the right skills, the workload each can take on, and the total ergonomic strain humans can safely handle. We turn this challenge into a Quadratic Unconstrained Binary Optimization (QUBO) model, so it runs on both quantum-annealing machines and gate-model quantum computers. We lay out three key contributions: first, we develop a penalty-based QUBO model and show exactly how to set penalty weights so it actually works. Second, we roll out a complete system where the very same QUBO gets sent both to a D-Wave-style simulated-annealing sampler and to our own lightweight, dependency-free QAOA statevector simulator. Finally, we’ve built and open-sourced a benchmarking suite that lets you see how quantum solutions perform next to a quick, greedy heuristic and a full-scale CBC integer programming baseline.. Across 60 runs spanning problem sizes from 9 to 240 binary variables, quantum annealing maintains a 100% constraint-feasibility rate at every scale tested, matching classical baselines closely on small instances (within 2% of the exact optimum at N = 9) but exhibiting a solution-quality gap that widens to roughly 140% at N = 240 under fixed penalty weights and a fixed annealing schedule. QAOA achieves competitive cost values only at the smallest instance tested (N = 9) and loses feasibility entirely by N = 16, consistent with known near-term gate-model scalability limits. We report a warm-start ablation seeding the annealer with the greedy solution, which does not yield a consistent improvement, and use this negative result to motivate an adaptive-penalty and problem-decomposition research direction. Rather than claiming a present-day quantum advantage, this paper contributes a reusable ergonomics-aware QUBO formulation, a transparent and reproducible benchmark methodology for the human-centric manufacturing community, and an honest empirical map of where current quantum optimization methods stand relative to classical practice at realistic shop-floor problem sizes.

•Nov 13, 2026•0 citations

A Physics-Grounded QUBO Encoding of Irrigation Scheduling for QAOA

Alisher Ortikov, Alisher Ilhamov

Rotational irrigation scheduling in water-scarce Central Asia is a densely coupled combinatorial problem: soil-moisture memory links each irrigation decision to all later days within a zone, field adjacency couples zones on overlapping window days, and rigid canal rotations quantize water delivery in time. We formulate it as a Quadratic Unconstrained Binary Optimization (QUBO) by linearizing the root-zone water balance, so the quadratic crop-stress objective generates the physical couplings as 2-local Ising interactions with no higher-order terms; only the water-budget constraint requires an artificial all-to-all penalty, which we certify with an instance-adaptive weight bound an order of magnitude tighter than generic prescriptions. Every instance is built from observed data for a cotton district in Khorezm, Uzbekistan: NASA POWER meteorology, FAO-56 Penman--Monteith evapotranspiration, SoilGrids~2.0 hydraulics, measured capillary fluxes, and documented canal-rotation windows that enter as qubit-count reductions. We benchmark four tiers -- exact solvers, matched-budget heuristics, ideal-statevector quantum approximate optimization algorithm (QAOA), and noise-model plus IBM Heron execution -- and add a scaling study on soil instances up to 584 variables. Exact branch-and-bound proves optimality in seconds through 150 variables, and heuristic degradation at fixed evaluation budget is repaired by scaling the budget, so no classical scalability wall appears at deployment-relevant sizes, and none is claimed. On hardware, the informative signal is optimum-sampling enrichment over uniform sampling. We claim no quantum advantage; we deliver a physically grounded, data-complete, reproducible encoding of a societally critical scheduling problem for the quantum-utility era.

quant-pharXiv:2607.13374•Jul 16, 2026•0 citations

Quantum-Inspired Optimization for Large-Scale Combinatorial Scheduling Problems

Swathi Vasudevan, Uma Vasudevan, Lakshmi Vasudevan

Large-scale combinatorial scheduling problems -- job-shop scheduling, flow-shop scheduling, and vehicle routing among them -- remain NP-hard at practically relevant scale, and quantum computing has entered this space along two related tracks: genuinely quantum solvers, principally quantum annealers and gate-based devices running the quantum approximate optimization algorithm (QAOA), and quantum-inspired classical solvers, such as coherent Ising machines and digital annealers, that borrow the same Ising/QUBO problem structure without requiring quantum hardware. This article synthesizes both tracks as applied specifically to scheduling. We trace the theoretical foundations from quantum and simulated annealing through the QUBO formulation techniques that make scheduling problems solver-ready, then review direct applications to job-shop, flow-shop, and vehicle-routing problems, reporting the concrete, verified numbers the underlying studies provide. The consistent finding is that quantum hardware remains constrained by qubit connectivity, embedding overhead, and shallow achievable circuit depth to small benchmark instances, while quantum-inspired classical solvers, unconstrained by qubit count, already reach scheduling-relevant problem sizes with reported performance competitive with or exceeding classical heuristics. We close by identifying benchmarking rigor, hardware connectivity, and the near-total absence of work on dynamic, online scheduling as the field's clearest open problems.

Journal of Intelligent Systems and Future Computing•Feb 24, 2021•0 citations
Real-time control of a compact spherical-tokamak breeder poses, at several points, a combinatorial-optimization problem inside a control cycle: which actuators to schedule, how to lay out a discrete blanket, and — the control-relevant case — how to sequence poloidal- and toroidal-field coil currents under hard constraints while tracking a shape and vertical-position target. Because these problems are naturally binary and quadratic, they are the canonical near-term target for quantum optimization, and it is a fair, testable question whether a quantum processor solves them faster or better than a classical one. This paper answers that question with a formal treatment and a pre-registered result. We derive compact quadratic-unconstrained-binary-optimization (QUBO) encodings for all three problems from first principles — pulse cadence as a number-partitioning Ising model, blanket layout as a penalty-embedded assignment, and coil-current/actuator scheduling as a fixed-point-encoded quadratic tracking objective built on the free-boundary equilibrium shape-response Jacobian — and map each to two fault-tolerant primitives, a depth-three quantum approximate optimization ansatz (QAOA, p=3) and a D"urr–Hyer Grover minimum-finder. At the frozen breeder design point (I_p=9.66 MA, Q=3.076, P_fus=85.04 MW, negative triangularity δ=-0.30, B_0=8 T, κ=2.0, =1.20 m, aspect ratio A=2.5, centrepost peak field 16.84 T) the design-scale instances need 23–61 logical qubits and 5×10^3–5.5×10^7 T-gates, verified against the Fowler surface-code and D"urr–Hyer formulas across 50 resource rows with zero discrepancies. On the question of whether quantum hardware helps, we report an explicit negative: classical simulated annealing matches or beats QAOA on all three breeder QUBOs out to n=120 variables; the exact-to-heuristic crossover sits at n=12–16 (exact optima in 0.03–292 s of wall time); the QAOA approximation ratio plateaus at 0.90–0.95 and the circuits become classically unverifiable past n≈24; and a fleet-scale (n=120) Grover formulation would need 1.8×10^18 oracle calls and 1.2×10^23 T-gates — a resource boundary, not a route. We therefore place variational quantum reinforcement learning for shape and vertical-position control on a dated, benchmark-gated schedule: a quantum policy is admitted only if it meets or beats the classical controller at equal wall-clock with a control-barrier-certified safety filter held inviolate. All quantum and classical runs were carried out on the NVIDIA GPU HPC campaign. The deliverable is the honest, resource-grounded map of where quantum computing does — and does not — pay for real-time fusion control. Key results (frozen anchors): N_T = 1.2 ×10^23. Methods & codes: FreeGSNKE, FreeGS, Sauter, QAOA, VQE, ADAPT-VQE. Live verification: 4 gate validator(s) with live-recompute cards (2 reproduced, 1 revised, 1 estimated). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included.
The real-time control loop of a compact spherical-tokamak breeder must reconstruct the equilibrium, watch for disruptions, and shape the plasma edge faster than a 9.66 plasma at =1.20 can move — a loop served today by classical GPU surrogates and a demonstrated in-winding quantum sensor. This paper asks, and answers with equal weight on both sides, where a quantum computer (as distinct from a quantum sensor) could accelerate that loop. We formalise a stack of four control-loop quantum algorithms as rigorous problems: an HHL-class linear solver for live Grad–Shafranov equilibrium reconstruction; a quantum-kernel state-estimator for disruption and runaway-electron precursor detection inside the shattered-pellet mitigation window; a Hamiltonian simulation of edge and scrape-off-layer turbulence to feed a predictive detachment controller; and a quantum-machine-learning surrogate for live transport prediction. For each we derive the governing operator, its discretization, and its fault-tolerant complexity, and we place them against the classical frontier through an explicit advantage inequality. Alongside the designs we report a completed characterization: the quantum-ML classifier loses discriminating power as it scales — area under the receiver-operating-characteristic curve falls from 0.817 at four qubits to 0.691 at eight, the calibrated signature of exponential kernel concentration — and a fault-tolerant kernel evaluation is 9–11 orders of magnitude slower than the classical route for this problem. Fault-tolerant resource estimates for the solver-class algorithms (edge/scrape-off-layer kinetics: ~44 logical qubits and ~19 days of single-instance runtime; linear kinetics: 11–19 logical qubits) confirm that none clears the advantage bar today, and the equilibrium solve, costed in absolute terms, is on the order of 10^17 Toffoli-equivalent T-gates — eleven orders of magnitude beyond the sub-millisecond loop budget on any plausible magic-state throughput. The honest conclusion is stated once: there is no measured quantum advantage on these control problems today. The deliverable is a validated set of algorithm designs, a resource-honest map of where a fault-tolerant machine will and provably will not help, and a dated roadmap that keeps the classical loop authoritative until a quantum route clears an explicit latency-and-fidelity bar. All numbers trace to frozen entries in the Kronos Physics De-Risking Register by their serial identifiers. Key results (frozen anchors): iter = 1.6 2^n. Methods & codes: FreeGSNKE, FreeGS, CGYRO, Sauter, QAOA, VQE, ADAPT-VQE. Live verification: 9 gate validator(s) with live-recompute cards (5 estimated, 4 reproduced). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included.
Quantum computing and quantum sensing are routinely proposed as accelerants for fusion; a serious design program should test those proposals quantitatively rather than assume them. We deliver a resource-honest map of where the quantum toolbox helps a compact spherical-tokamak breeder and its tandem-mirror burner, and where it does not, formalised as three coupled estimation problems and computed on a single GPU-HPC campaign. On the machine-learning front we build a quantum-kernel transport surrogate and measure its classifier area-under-curve (AUC) falling with encoding width — 0.817 at four qubits to 0.691 at eight — the signature of exponential kernel concentration, for which we give the variance bound and the induced shot-cost scaling; at a realistic 37-logical-qubit problem the quantum Gram evaluation is 9–11 orders of magnitude slower than its classical counterpart. On the sensing front we derive the entanglement-advantage condition from the quantum Fisher information and specify the in-cryostat magnetometry chain for the breeder centrepost (peak field 16.84 T, kept formally distinct from the burner plug at 26.49 T): an NMR/EPR probe as the absolute monitor to ≤1 ppm, a SQUID and an NV-diamond ensemble (1 pT Hz^-1/2) for the 1 mT quench precursor, with the entanglement knee located at a normalised signal ≈0.14. Every Kronos in-bore diagnostic sits below the knee, where entanglement buys only +0.00077 AUC; above it (deep error-field mapping) a Heisenberg-limited protocol carries the standard-quantum-limit sensitivity from 5.7×10^-7 to 5.7×10^-8 T at 100 probes. On the fault-tolerant front we recompute the resource ledger from first formulas — the Grover iteration count 1.62^n and the surface-code footprint 2d^2 physical qubits per logical qubit — across 50 rows with zero discrepancy, and date the single fusion-relevant near-term niche: linear Vlasov kinetics at 11–19 logical qubits around 2029±2, with nonlinear five-dimensional gyrokinetics beyond 2035 and fleet-scale Grover search never practical (1.8×10^18 iterations). Three further workloads keep the verdict resource-honest: full six-dimensional kinetic Hamiltonian simulation at ~44 logical qubits and ~19 days, fault-tolerant phase estimation of the exact REBCO/alloy ground state at ~238 logical qubits and ~10^9 Toffoli gates, and a Harrow–Hassidim–Lloyd equilibrium linear solve at ~10^17 T-gates — all calibration-only. Two of the six quantum-track items are already twin-testable classically: a materials variational eigensolver reproduces a model ground state to 3.9×10^-6 Ha and reaches chemical accuracy on 3d alloy fragments with 4–14× shallower circuits than unitary coupled cluster (no advantage claimed), and a tensor-network kinetic solver compresses the distribution function with exponential rank convergence (2.2×10^-10 at bond rank 16, 0.19× storage). The honest bottom line is that nothing on the design critical path waits on quantum hardware — and establishing that, with the numbers behind it, is the result. Key results (frozen anchors): iter = 1.8 ×10^18; iter = 1.6 2^n. Methods & codes: CGYRO, GENE, QAOA, VQE, ADAPT-VQE. Live verification: 11 gate validator(s) with live-recompute cards (5 reproduced, 5 estimated, 1 revised). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included.
Quantum computing and quantum sensing are routinely proposed as accelerants for fusion; a serious design program should test those proposals quantitatively rather than assume them. We deliver a resource-honest map of where the quantum toolbox helps a compact spherical-tokamak breeder and its tandem-mirror burner, and where it does not, formalised as three coupled estimation problems and computed on a single GPU-HPC campaign. On the machine-learning front we build a quantum-kernel transport surrogate and measure its classifier area-under-curve (AUC) falling with encoding width — 0.817 at four qubits to 0.691 at eight — the signature of exponential kernel concentration, for which we give the variance bound and the induced shot-cost scaling; at a realistic 37-logical-qubit problem the quantum Gram evaluation is 9–11 orders of magnitude slower than its classical counterpart. On the sensing front we derive the entanglement-advantage condition from the quantum Fisher information and specify the in-cryostat magnetometry chain for the breeder centrepost (peak field 16.84 T, kept formally distinct from the burner plug at 26.49 T): an NMR/EPR probe as the absolute monitor to ≤1 ppm, a SQUID and an NV-diamond ensemble (1 pT Hz^-1/2) for the 1 mT quench precursor, with the entanglement knee located at a normalised signal ≈0.14. Every Kronos in-bore diagnostic sits below the knee, where entanglement buys only +0.00077 AUC; above it (deep error-field mapping) a Heisenberg-limited protocol carries the standard-quantum-limit sensitivity from 5.7×10^-7 to 5.7×10^-8 T at 100 probes. On the fault-tolerant front we recompute the resource ledger from first formulas — the Grover iteration count 1.62^n and the surface-code footprint 2d^2 physical qubits per logical qubit — across 50 rows with zero discrepancy, and date the single fusion-relevant near-term niche: linear Vlasov kinetics at 11–19 logical qubits around 2029±2, with nonlinear five-dimensional gyrokinetics beyond 2035 and fleet-scale Grover search never practical (1.8×10^18 iterations). Three further workloads keep the verdict resource-honest: full six-dimensional kinetic Hamiltonian simulation at ~44 logical qubits and ~19 days, fault-tolerant phase estimation of the exact REBCO/alloy ground state at ~238 logical qubits and ~10^9 Toffoli gates, and a Harrow–Hassidim–Lloyd equilibrium linear solve at ~10^17 T-gates — all calibration-only. Two of the six quantum-track items are already twin-testable classically: a materials variational eigensolver reproduces a model ground state to 3.9×10^-6 Ha and reaches chemical accuracy on 3d alloy fragments with 4–14× shallower circuits than unitary coupled cluster (no advantage claimed), and a tensor-network kinetic solver compresses the distribution function with exponential rank convergence (2.2×10^-10 at bond rank 16, 0.19× storage). The honest bottom line is that nothing on the design critical path waits on quantum hardware — and establishing that, with the numbers behind it, is the result.Key results (frozen anchors): y_i = 0 eq; hbar = 2 ×28.03; iter = 1.8 ×10^18; iter = 1.6 2^n.Methods & codes: CGYRO, GENE, QAOA, VQE, ADAPT-VQE.Live verification: 11 gate validator(s) with live-recompute cards (5 reproduced, 5 estimated, 1 revised). See the Verification section and data/verification.csv.Related: Paper page · De-risking register · 3D model · Learn more about KronosPart of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689).All numerical values are frozen design-point anchors; see the register.Public research artifact. No proprietary, financial, or supply-chain information is included.
Abstract Industry 5.0 shifts the focus of manufacturing automation toward human well-being, not just efficiency or output. This means task-allocation systems now have to juggle production targets, ergonomic safety, and what the workforce can realistically handle. Here, we introduce what we call the Ergonomics-Aware Human–Robot Task Allocation (EA-HRTA) problem. Picture it as a complex assignment challenge: for every task, we have to consider execution cost, whether the person or robot has the right skills, the workload each can take on, and the total ergonomic strain humans can safely handle. We turn this challenge into a Quadratic Unconstrained Binary Optimization (QUBO) model, so it runs on both quantum-annealing machines and gate-model quantum computers. We lay out three key contributions: first, we develop a penalty-based QUBO model and show exactly how to set penalty weights so it actually works. Second, we roll out a complete system where the very same QUBO gets sent both to a D-Wave-style simulated-annealing sampler and to our own lightweight, dependency-free QAOA statevector simulator. Finally, we’ve built and open-sourced a benchmarking suite that lets you see how quantum solutions perform next to a quick, greedy heuristic and a full-scale CBC integer programming baseline.. Across 60 runs spanning problem sizes from 9 to 240 binary variables, quantum annealing maintains a 100% constraint-feasibility rate at every scale tested, matching classical baselines closely on small instances (within 2% of the exact optimum at N = 9) but exhibiting a solution-quality gap that widens to roughly 140% at N = 240 under fixed penalty weights and a fixed annealing schedule. QAOA achieves competitive cost values only at the smallest instance tested (N = 9) and loses feasibility entirely by N = 16, consistent with known near-term gate-model scalability limits. We report a warm-start ablation seeding the annealer with the greedy solution, which does not yield a consistent improvement, and use this negative result to motivate an adaptive-penalty and problem-decomposition research direction. Rather than claiming a present-day quantum advantage, this paper contributes a reusable ergonomics-aware QUBO formulation, a transparent and reproducible benchmark methodology for the human-centric manufacturing community, and an honest empirical map of where current quantum optimization methods stand relative to classical practice at realistic shop-floor problem sizes.
Rotational irrigation scheduling in water-scarce Central Asia is a densely coupled combinatorial problem: soil-moisture memory links each irrigation decision to all later days within a zone, field adjacency couples zones on overlapping window days, and rigid canal rotations quantize water delivery in time. We formulate it as a Quadratic Unconstrained Binary Optimization (QUBO) by linearizing the root-zone water balance, so the quadratic crop-stress objective generates the physical couplings as 2-local Ising interactions with no higher-order terms; only the water-budget constraint requires an artificial all-to-all penalty, which we certify with an instance-adaptive weight bound an order of magnitude tighter than generic prescriptions. Every instance is built from observed data for a cotton district in Khorezm, Uzbekistan: NASA POWER meteorology, FAO-56 Penman--Monteith evapotranspiration, SoilGrids~2.0 hydraulics, measured capillary fluxes, and documented canal-rotation windows that enter as qubit-count reductions. We benchmark four tiers -- exact solvers, matched-budget heuristics, ideal-statevector quantum approximate optimization algorithm (QAOA), and noise-model plus IBM Heron execution -- and add a scaling study on soil instances up to 584 variables. Exact branch-and-bound proves optimality in seconds through 150 variables, and heuristic degradation at fixed evaluation budget is repaired by scaling the budget, so no classical scalability wall appears at deployment-relevant sizes, and none is claimed. On hardware, the informative signal is optimum-sampling enrichment over uniform sampling. We claim no quantum advantage; we deliver a physically grounded, data-complete, reproducible encoding of a societally critical scheduling problem for the quantum-utility era.
Large-scale combinatorial scheduling problems -- job-shop scheduling, flow-shop scheduling, and vehicle routing among them -- remain NP-hard at practically relevant scale, and quantum computing has entered this space along two related tracks: genuinely quantum solvers, principally quantum annealers and gate-based devices running the quantum approximate optimization algorithm (QAOA), and quantum-inspired classical solvers, such as coherent Ising machines and digital annealers, that borrow the same Ising/QUBO problem structure without requiring quantum hardware. This article synthesizes both tracks as applied specifically to scheduling. We trace the theoretical foundations from quantum and simulated annealing through the QUBO formulation techniques that make scheduling problems solver-ready, then review direct applications to job-shop, flow-shop, and vehicle-routing problems, reporting the concrete, verified numbers the underlying studies provide. The consistent finding is that quantum hardware remains constrained by qubit connectivity, embedding overhead, and shallow achievable circuit depth to small benchmark instances, while quantum-inspired classical solvers, unconstrained by qubit count, already reach scheduling-relevant problem sizes with reported performance competitive with or exceeding classical heuristics. We close by identifying benchmarking rigor, hardware connectivity, and the near-total absence of work on dynamic, online scheduling as the field's clearest open problems.