pub struct ProbabilisticErrorCancellation {
pub noise_model: NoiseModel,
pub num_samples: usize,
pub seed: Option<u64>,
}Expand description
Probabilistic Error Cancellation (PEC) implementation
PEC provides exact error mitigation at the cost of increased sampling overhead. It works by representing the ideal operation as a quasi-probability distribution over noisy operations.
Fields§
§noise_model: NoiseModelNoise model for the device
num_samples: usizeNumber of samples for PEC
seed: Option<u64>Monte Carlo seed for reproducibility
Implementations§
Source§impl ProbabilisticErrorCancellation
impl ProbabilisticErrorCancellation
Sourcepub fn new(noise_model: NoiseModel, num_samples: usize) -> Self
pub fn new(noise_model: NoiseModel, num_samples: usize) -> Self
Create a new PEC instance
Sourcepub fn calculate_overhead(&self, circuit_depth: usize, num_gates: usize) -> f64
pub fn calculate_overhead(&self, circuit_depth: usize, num_gates: usize) -> f64
Calculate the sampling overhead γ for a circuit
Trait Implementations§
Source§impl Clone for ProbabilisticErrorCancellation
impl Clone for ProbabilisticErrorCancellation
Source§fn clone(&self) -> ProbabilisticErrorCancellation
fn clone(&self) -> ProbabilisticErrorCancellation
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 ProbabilisticErrorCancellation
impl RefUnwindSafe for ProbabilisticErrorCancellation
impl Send for ProbabilisticErrorCancellation
impl Sync for ProbabilisticErrorCancellation
impl Unpin for ProbabilisticErrorCancellation
impl UnwindSafe for ProbabilisticErrorCancellation
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.