Struct GreedyPauliSimp 

pub struct GreedyPauliSimp {
    pub discount_rate: f64,
    pub depth_weight: f64,
    pub max_lookahead: f64,
    pub max_tqe_candidates: f64,
    pub seed: f64,
    pub allow_zzphase: bool,
    pub thread_timeout: f64,
    pub only_reduce: bool,
    pub trials: f64,
}

Greedy Pauli simplification configuration.

Fields

discount_rate: f64

Cost discount parameter.

depth_weight: f64

Depth optimisation weight.

max_lookahead: f64

Maximum lookahead.

max_tqe_candidates: f64

Maximum number of TQE candidates.

seed: f64

Seed for randomness.

allow_zzphase: bool

Whether ZZPhase gates may be emitted.

thread_timeout: f64

Maximum runtime per thread.

only_reduce: bool

Whether only reductions are allowed.

trials: f64

Number of random trials.

Trait Implementations

impl Clone for GreedyPauliSimp

fn clone(&self) -> GreedyPauliSimp

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GreedyPauliSimp

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GreedyPauliSimp

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for GreedyPauliSimp

fn eq(&self, other: &GreedyPauliSimp) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GreedyPauliSimp

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GreedyPauliSimp