QPRIMORA · FRAMEWORK-NATIVE DEMO

Satellite Mission Scheduling

Satellite observation tasks have different time windows, priorities and scientific values. Which tasks should be scheduled to increase total mission value while avoiding time conflicts?

01 Problem The real-world objective supplied by the user.
→
02 Representation Convert the real-world problem into a computable mathematical representation.
→
03 Primitive Identify the reusable computational structure behind the problem.
→
04 Algorithm Map the primitive to a suitable quantum or hybrid algorithm.
→
05 Virtual QPU Simulate quantum execution and measurement on classical hardware.
→
06 Measurement Obtain a measurement distribution over candidate states.
→
07 Result Translate measured states back into a real-world answer.
01 · PROBLEM INPUT

Set the problem

Candidate satellite observation windows
02 · TRANSFORMATION EXPLORER

How QPRIMORA transforms the problem

PROBLEM Satellite Mission Scheduling
→
REPRESENTATION Constrained QUBO
→
PRIMITIVE Conflict-Constrained Scheduling
→
ALGORITHM QAOA
→
BACKEND Virtual QPU
A · SATELLITE OBSERVATIONS

Each candidate observation has an execution time interval, mission priority and scientific value. A satellite cannot execute overlapping observations simultaneously.

B · DECISION VARIABLES

Each binary variable represents whether a candidate observation is included in the final mission schedule.

xᵢ ∈ {0,1}
C · TIME-CONFLICT CONSTRAINTS

If two observation intervals overlap, they cannot both be selected.

xᵢ + xⱼ ≤ 1 if windowᵢ ∩ windowⱼ ≠ ∅
D · OBJECTIVE

Subject to all time-conflict constraints, prefer observations with high mission value and priority.

max Σ Valueᵢ·xᵢ − λ·ScheduleCost
E · Scheduling Primitive

At this layer the satellite-specific domain is removed. The lower computation layer sees candidate tasks, resource occupancy intervals, conflicts and task values.

F · QAOA + Virtual QPU

Scheduling constraints and mission values are mapped into a Constrained QUBO and then into a QAOA-style optimization path. The Virtual QPU produces a measurement distribution over candidate schedules.

Task Windows → Conflict Graph → Constrained QUBO → QAOA → Virtual QPU → Measurement
03 · COMPUTE

Run both computation paths

CLASSICAL

Exact conflict-constrained scheduling

Time windows, priorities and mission values ↓ Conflict-constrained scheduling ↓ Optimal mission schedule
VIRTUAL QPU

QAOA-style Virtual QPU schedule-state sampling

Constrained QUBO ↓ Conflict-Constrained Scheduling ↓ QAOA ↓ Virtual QPU ↓ Candidate schedule-state distribution
QPRIMORA ARCHITECTURE

From satellite observations to a reusable scheduling primitive

Satellite Mission Scheduling → Constrained QUBO → Conflict-Constrained Scheduling → QAOA → Virtual QPU → Real QPU

The user describes satellite observations while QPRIMORA identifies a reusable scheduling primitive built from time windows, conflicts and task values.