Anu
Section 3 · where it comes together

The QNACA runtime, running

A dispatcher for CPUs, GPUs and the quantum processor you have just taken apart. Each task is compiled into several plans; the ones that cannot work are struck out with a stated reason; the survivor runs, and its answer is released only if it passes the original verifier.

ProposedA model of the blueprint's design. QNACA has not been built.
Click a numbered stage to read its contract
Quantum hardware assumed

Changes apply to the next task. Try Today with the error at 10⁻⁵ and a 5 s queue to find where the quantum branch first survives.

What is real here
  • Computed: every Max-Cut instance is solved exactly, by local search and by annealing in your browser, and QAOA is simulated on a statevector when it runs.
  • Modelled: wall-clock time, from the seven-term sum and the parameters above; scheduling and spin-dynamics tasks.

Waiting for the first task…

Ledger after 0 tasks
Accepted, verified
0
No feasible plan
0
reported, not guessed
Answered by the QPU
0
QPU spend
$0.00
0 research runs
Time to a verified answer
Fixed rule per problem type— (—)
Learned router— (—)
Hindsight oracle— (—)

Geometric mean per task, with the total in brackets. The oracle picks the best plan with hindsight and cannot be deployed; the gap between rule and oracle is all a router can ever win.

Why plans were rejected

Nothing rejected yet.

The seven subsystems
Input

Problem features, candidate estimates, current backend state and user policy.

Output

A ranked feasible plan, an uncertainty estimate and a fallback.

Rule it must keep · blueprint pages 9, 13–14

Filter impossible plans first, then predict. It must be able to abstain and choose a dependable classical strategy.

Invariants the whole runtime keeps
  • A valid specification exists before any solver is invoked.
  • Every transformation records its assumptions and a decoder.
  • Every accepted result passes the original task verifier.
  • The selection policy cannot relax a quality target to improve its reward.
  • Provider capabilities and budgets are checked before submission.
The decision rule
Ttotal=Tprepare+Tcompile+Tqueue+Ttransfer+Texecute+Tpost+Tverifya∗=arg⁡min⁡a E[Ttotal(a)]s.t.  P(valid∧q≥q∗)≥1−δ,  C(a)≤B\begin{aligned}T_{\text{total}}&=T_{\text{prepare}}+T_{\text{compile}}+T_{\text{queue}}+T_{\text{transfer}}\\&\quad+T_{\text{execute}}+T_{\text{post}}+T_{\text{verify}}\\[4pt]a^{*}&=\arg\min_a\ \mathbb{E}\big[T_{\text{total}}(a)\big]\\[2pt]\text{s.t.}\ \ &P(\text{valid}\wedge q\ge q^{*})\ge 1-\delta,\ \ C(a)\le B\end{aligned}
Back to the QPUSources and what was checked