pub struct TopologicalAnalysis {
pub topological_order: Vec<usize>,
pub reverse_order: Vec<usize>,
pub parallel_layers: Vec<Vec<usize>>,
pub critical_path: Vec<usize>,
pub gate_priorities: HashMap<usize, f64>,
pub qubit_chains: HashMap<u32, Vec<usize>>,
pub depth: usize,
pub width: usize,
}Expand description
Result of topological analysis
Fields§
§topological_order: Vec<usize>Standard topological order
reverse_order: Vec<usize>Reverse topological order
parallel_layers: Vec<Vec<usize>>Layers of gates that can be executed in parallel
critical_path: Vec<usize>Critical path through the circuit
gate_priorities: HashMap<usize, f64>Gate priorities based on criticality
qubit_chains: HashMap<u32, Vec<usize>>Dependency chains for each qubit
depth: usizeCircuit depth
width: usizeCircuit width (max parallel gates)
Trait Implementations§
Source§impl Clone for TopologicalAnalysis
impl Clone for TopologicalAnalysis
Source§fn clone(&self) -> TopologicalAnalysis
fn clone(&self) -> TopologicalAnalysis
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 TopologicalAnalysis
impl RefUnwindSafe for TopologicalAnalysis
impl Send for TopologicalAnalysis
impl Sync for TopologicalAnalysis
impl Unpin for TopologicalAnalysis
impl UnwindSafe for TopologicalAnalysis
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.