Expand description
QPU Pre-Solver — converts high-level problem descriptions into provider-ready QUBO matrices or gate-model quantum circuits.
Ported from qpu/src/pre_solver.rs.
Structs§
- Circuit
Formulation - Constraint
- Gate
- Measurement
- Objective
- PreSolver
- Problem
Description - Qubo
Formulation - Qubo
Penalty Bounds - Bounds for enforcing the QUBO Penalty Sufficiency Theorem (
P * delta > U - L) on a penalized HamiltonianE(x) = f(x) + P * g(x). - Variable
Enums§
Functions§
- minimum_
sufficient_ penalty - Compute a sufficient penalty weight
P = (U - L) / delta + safety_margin(safety_margin > 0). - verify_
qubo_ penalty_ sufficiency - Enforce the QUBO Penalty Sufficiency Theorem:
For
E(x) = f(x) + P * g(x)withg(x) = 0on feasible states andg(x) >= delta > 0on infeasible states,P * delta > U - Lguarantees every global ground state ofE(x)is feasible.