pub struct QUBOProblem {
pub num_vars: usize,
pub q_matrix: Array2<f64>,
pub linear_terms: Option<Array1<f64>>,
pub offset: f64,
}Expand description
QUBO (Quadratic Unconstrained Binary Optimization) problem representation
Fields§
§num_vars: usizeNumber of variables
q_matrix: Array2<f64>Q matrix: objective is x^T Q x
linear_terms: Option<Array1<f64>>Linear terms (optional)
offset: f64Constant offset
Implementations§
Source§impl QUBOProblem
impl QUBOProblem
Sourcepub fn new(q_matrix: Array2<f64>) -> QuantRS2Result<Self>
pub fn new(q_matrix: Array2<f64>) -> QuantRS2Result<Self>
Create a new QUBO problem
Sourcepub fn with_linear_terms(self, linear: Array1<f64>) -> QuantRS2Result<Self>
pub fn with_linear_terms(self, linear: Array1<f64>) -> QuantRS2Result<Self>
Add linear terms to the QUBO problem
Sourcepub fn with_offset(self, offset: f64) -> Self
pub fn with_offset(self, offset: f64) -> Self
Add constant offset
Sourcepub fn evaluate(&self, solution: &[u8]) -> QuantRS2Result<f64>
pub fn evaluate(&self, solution: &[u8]) -> QuantRS2Result<f64>
Evaluate the QUBO objective for a binary solution
Sourcepub fn to_ising(&self) -> IsingProblem
pub fn to_ising(&self) -> IsingProblem
Convert to Ising model (spins ∈ {-1, +1})
Trait Implementations§
Source§impl Clone for QUBOProblem
impl Clone for QUBOProblem
Source§fn clone(&self) -> QUBOProblem
fn clone(&self) -> QUBOProblem
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for QUBOProblem
impl RefUnwindSafe for QUBOProblem
impl Send for QUBOProblem
impl Sync for QUBOProblem
impl Unpin for QUBOProblem
impl UnwindSafe for QUBOProblem
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.