Skip to main content

Module pre_solver

Module pre_solver 

Source
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§

CircuitFormulation
Constraint
Gate
Measurement
Objective
PreSolver
ProblemDescription
QuboFormulation
QuboPenaltyBounds
Bounds for enforcing the QUBO Penalty Sufficiency Theorem (P * delta > U - L) on a penalized Hamiltonian E(x) = f(x) + P * g(x).
Variable

Enums§

ConstraintType
GateType
MeasurementBasis
ObjectiveType
VariableDomain

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) with g(x) = 0 on feasible states and g(x) >= delta > 0 on infeasible states, P * delta > U - L guarantees every global ground state of E(x) is feasible.