pub enum Targets {
Axis(Vec<Vec<String>>),
Gate(Vec<String>),
PhiBeta {
phi: Vec<Vec<String>>,
beta: Vec<Vec<f64>>,
},
}Expand description
What each initial state should become.
Variants§
Axis(Vec<Vec<String>>)
A product state, one axis per qubit, per initial state.
Gate(Vec<String>)
A gate name per initial state; see Targets::single_gate for what one name for every state means.
PhiBeta
A rotation about an axis per qubit (x, -x, y, -y, z, -z) by an angle in degrees, per initial state.
Implementations§
Source§impl Targets
impl Targets
Sourcepub fn single_gate(&self) -> Option<&str>
pub fn single_gate(&self) -> Option<&str>
The gate every initial state names, when they all name the same one. Such a target asks for the gate itself, scored by its average gate fidelity over the computational basis; different gates for different initial states ask for each state to reach its gate’s image.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for Targets
impl<'de> Deserialize<'de> for Targets
Source§fn deserialize<D: Deserializer<'de>>(d: D) -> Result<Self, D::Error>
fn deserialize<D: Deserializer<'de>>(d: D) -> Result<Self, D::Error>
Deserialize this value from the given Serde deserializer. Read more
impl StructuralPartialEq for Targets
Auto Trait Implementations§
impl Forget for Targets
impl Freeze for Targets
impl Move for Targets
impl RefUnwindSafe for Targets
impl Send for Targets
impl Sync for Targets
impl Unpin for Targets
impl UnsafeUnpin for Targets
impl UnwindSafe for Targets
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
impl<T> SendAlias 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.