pub struct PulseTemplates;
Expand description
Pulse schedule templates for common operations
Implementations§
Source§impl PulseTemplates
impl PulseTemplates
Sourcepub fn x_gate(qubit: u32, calibration: &PulseCalibration) -> PulseSchedule
pub fn x_gate(qubit: u32, calibration: &PulseCalibration) -> PulseSchedule
Create a calibrated X gate schedule
Sourcepub fn cnot_gate(
control: u32,
target: u32,
calibration: &PulseCalibration,
) -> PulseSchedule
pub fn cnot_gate( control: u32, target: u32, calibration: &PulseCalibration, ) -> PulseSchedule
Create a calibrated CNOT gate schedule
Sourcepub fn measure(
qubits: Vec<u32>,
calibration: &PulseCalibration,
) -> PulseSchedule
pub fn measure( qubits: Vec<u32>, calibration: &PulseCalibration, ) -> PulseSchedule
Create a measurement schedule
Sourcepub fn rabi_experiment(
qubit: u32,
amplitudes: Vec<f64>,
calibration: &PulseCalibration,
) -> Vec<PulseSchedule>
pub fn rabi_experiment( qubit: u32, amplitudes: Vec<f64>, calibration: &PulseCalibration, ) -> Vec<PulseSchedule>
Create a Rabi oscillation experiment
Sourcepub fn t1_experiment(
qubit: u32,
delays: Vec<u64>,
calibration: &PulseCalibration,
) -> Vec<PulseSchedule>
pub fn t1_experiment( qubit: u32, delays: Vec<u64>, calibration: &PulseCalibration, ) -> Vec<PulseSchedule>
Create a T1 relaxation experiment
Sourcepub fn ramsey_experiment(
qubit: u32,
delays: Vec<u64>,
detuning: f64,
calibration: &PulseCalibration,
) -> Vec<PulseSchedule>
pub fn ramsey_experiment( qubit: u32, delays: Vec<u64>, detuning: f64, calibration: &PulseCalibration, ) -> Vec<PulseSchedule>
Create a Ramsey experiment (T2)
Auto Trait Implementations§
impl Freeze for PulseTemplates
impl RefUnwindSafe for PulseTemplates
impl Send for PulseTemplates
impl Sync for PulseTemplates
impl Unpin for PulseTemplates
impl UnwindSafe for PulseTemplates
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.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.