pub struct IQPSampling {
pub iqp_circuit_generator: IQPCircuitGenerator,
pub computational_complexity: ComputationalComplexity,
pub hardness_assumptions: Vec<HardnessAssumption>,
pub classical_simulation_cost: ClassicalSimulationCost,
}Expand description
Instantaneous Quantum Polynomial (IQP) sampling
Fields§
§iqp_circuit_generator: IQPCircuitGenerator§computational_complexity: ComputationalComplexity§hardness_assumptions: Vec<HardnessAssumption>§classical_simulation_cost: ClassicalSimulationCostImplementations§
Source§impl IQPSampling
impl IQPSampling
pub fn new(qubit_count: usize) -> Self
pub fn sample_iqp_circuit( &self, _circuit: &IQPCircuit, sample_count: usize, ) -> Result<Vec<IQPSample>, QuantRS2Error>
pub fn verify_hardness_assumptions( &self, _samples: &[IQPSample], _complexity: &ComputationalComplexity, ) -> Result<HardnessVerification, QuantRS2Error>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for IQPSampling
impl RefUnwindSafe for IQPSampling
impl Send for IQPSampling
impl Sync for IQPSampling
impl Unpin for IQPSampling
impl UnwindSafe for IQPSampling
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.