pub struct HardwareGraph {
pub num_qubits: usize,
pub adjacency: HashMap<usize, Vec<usize>>,
pub topology: HardwareTopology,
pub coordinates: Option<HashMap<usize, Vec<usize>>>,
}Expand description
Represents a hardware graph for quantum annealing
Fields§
§num_qubits: usizeNumber of physical qubits
adjacency: HashMap<usize, Vec<usize>>Adjacency matrix (stored as adjacency list for efficiency)
topology: HardwareTopologyHardware topology type
coordinates: Option<HashMap<usize, Vec<usize>>>Coordinates for each qubit (if applicable)
Implementations§
Source§impl HardwareGraph
impl HardwareGraph
Sourcepub fn new_custom(num_qubits: usize, edges: Vec<(usize, usize)>) -> Self
pub fn new_custom(num_qubits: usize, edges: Vec<(usize, usize)>) -> Self
Create a new hardware graph with custom adjacency
Sourcepub fn new_chimera(m: usize, n: usize, t: usize) -> IsingResult<Self>
pub fn new_chimera(m: usize, n: usize, t: usize) -> IsingResult<Self>
Create a Chimera graph with given dimensions
Sourcepub fn are_connected(&self, q1: usize, q2: usize) -> bool
pub fn are_connected(&self, q1: usize, q2: usize) -> bool
Check if two qubits are connected
Trait Implementations§
Source§impl Clone for HardwareGraph
impl Clone for HardwareGraph
Source§fn clone(&self) -> HardwareGraph
fn clone(&self) -> HardwareGraph
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 HardwareGraph
impl RefUnwindSafe for HardwareGraph
impl Send for HardwareGraph
impl Sync for HardwareGraph
impl Unpin for HardwareGraph
impl UnwindSafe for HardwareGraph
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.