Trade Execution Optimization
How should a larger order be distributed across multiple time slices to reduce expected execution cost while balancing liquidity, spread, market impact and execution timing?
Set the problem
How QPRIMORA transforms the problem
A · REAL-WORLD EXECUTION PROBLEM
A larger order is generally not represented here as one instantaneous execution. Different time slices have different liquidity, spreads and volatility, so the order is divided across multiple execution periods.
B · DECISION VARIABLES
The system decides how much quantity to allocate to each time slice while total allocated quantity must equal the complete order.
C · EXECUTION COST
The simplified model combines spread cost, nonlinear market impact, timing cost from waiting and a volatility-risk term.
D · CONSTRAINED QUBO
Discrete execution quantities and the total-quantity constraint are encoded into a combinatorial optimization problem whose objective is lower execution cost.
E · Execution Scheduling Primitive
At this layer the market-specific label is removed. The lower computation layer sees limited capacity, multiple time slots, nonlinear costs and a total-work constraint.
F · QAOA + Virtual QPU
Discrete execution schedules are mapped toward a QAOA-style optimization path. The Virtual QPU produces a measurement distribution over candidate allocations, which is interpreted back into an execution schedule.
Run both computation paths
QAOA-style Virtual QPU execution-state sampling
From trade order to a reusable execution-scheduling primitive
The user describes how an order should be executed while QPRIMORA identifies a reusable scheduling primitive built from time slots, capacities, nonlinear costs and total-work constraints.