pub struct OptimizedShorAlgorithm { /* private fields */ }Expand description
Optimized Shor’s algorithm implementation
Implementations§
Source§impl OptimizedShorAlgorithm
impl OptimizedShorAlgorithm
Sourcepub fn new(config: QuantumAlgorithmConfig) -> Result<Self>
pub fn new(config: QuantumAlgorithmConfig) -> Result<Self>
Create new Shor’s algorithm instance
Sourcepub fn with_backend(self) -> Result<Self>
pub fn with_backend(self) -> Result<Self>
Initialize with SciRS2 backend
Sourcepub fn factor(&mut self, n: u64) -> Result<ShorResult>
pub fn factor(&mut self, n: u64) -> Result<ShorResult>
Factor integer using optimized Shor’s algorithm
Auto Trait Implementations§
impl Freeze for OptimizedShorAlgorithm
impl !RefUnwindSafe for OptimizedShorAlgorithm
impl Send for OptimizedShorAlgorithm
impl Sync for OptimizedShorAlgorithm
impl Unpin for OptimizedShorAlgorithm
impl !UnwindSafe for OptimizedShorAlgorithm
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.