pub struct QuantumNetwork {
pub nodes: HashMap<Uuid, QuantumNode>,
pub topology: NetworkTopology,
pub routing_table: Arc<RwLock<HashMap<(Uuid, Uuid), Vec<Uuid>>>>,
pub entanglement_manager: EntanglementManager,
pub scheduler: NetworkScheduler,
}Expand description
Quantum network topology and management
Fields§
§nodes: HashMap<Uuid, QuantumNode>§topology: NetworkTopology§routing_table: Arc<RwLock<HashMap<(Uuid, Uuid), Vec<Uuid>>>>§entanglement_manager: EntanglementManager§scheduler: NetworkSchedulerImplementations§
Source§impl QuantumNetwork
impl QuantumNetwork
Sourcepub fn new(topology: NetworkTopology) -> Self
pub fn new(topology: NetworkTopology) -> Self
Create a new quantum network
Sourcepub fn add_node(&mut self, node: QuantumNode)
pub fn add_node(&mut self, node: QuantumNode)
Add a node to the network
Sourcepub fn get_node(&self, node_id: Uuid) -> Option<&QuantumNode>
pub fn get_node(&self, node_id: Uuid) -> Option<&QuantumNode>
Get a node by ID
Sourcepub async fn execute_distributed_gate(
&self,
gate: &DistributedQuantumGate,
) -> Result<DistributedExecutionResult, QuantRS2Error>
pub async fn execute_distributed_gate( &self, gate: &DistributedQuantumGate, ) -> Result<DistributedExecutionResult, QuantRS2Error>
Execute a distributed quantum gate
Trait Implementations§
Auto Trait Implementations§
impl Freeze for QuantumNetwork
impl !RefUnwindSafe for QuantumNetwork
impl Send for QuantumNetwork
impl Sync for QuantumNetwork
impl Unpin for QuantumNetwork
impl !UnwindSafe for QuantumNetwork
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> 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.