pub struct Problem {Show 27 fields
pub n_qubits: usize,
pub dim: usize,
pub n_pulse: usize,
pub dt: f64,
pub duration: f64,
pub times: Vec<f64>,
pub qubits: Vec<QubitBasis>,
pub modulation: CMat<f64>,
pub control_ops: Vec<CMat<f64>>,
pub channels: Vec<ControlChannel>,
pub batch: Vec<BatchElement>,
pub evolution: Evolution,
pub space: Space,
pub x0: Vec<f64>,
pub seed: u64,
pub target_fidelity: f64,
pub max_iter: usize,
pub algorithm: String,
pub initial_states: Vec<CMat<f64>>,
pub observables: Vec<[CMat<f64>; 3]>,
pub model: Box<dyn HamiltonianModel>,
pub rabi_max: Vec<f64>,
pub delta: Vec<f64>,
pub sw: Vec<f64>,
pub coupling: Option<RMat<f64>>,
pub n_snapshots: usize,
pub n_rabi: usize,
}Expand description
Everything an evaluation of the objective needs, derived from a Config.
Fields§
§n_qubits: usizeNumber of qubits.
dim: usizeHilbert-space dimension of the model.
n_pulse: usizeNumber of time steps.
dt: f64Time step in seconds: duration / steps.
duration: f64Pulse duration in seconds.
times: Vec<f64>Waveform sample times in seconds: the middle of each step, (t + ½)·dt.
qubits: Vec<QubitBasis>Each qubit’s basis matrices.
modulation: CMat<f64>exp(i·offset_q·(t − T/2)), n_pulse × n_qubits.
control_ops: Vec<CMat<f64>>Control operators H_k.
channels: Vec<ControlChannel>How each control amplitude is made.
batch: Vec<BatchElement>The batch, ordered by initial state (or Pauli operator), then drift snapshot, then Rabi snapshot.
evolution: EvolutionState evolution per step.
space: SpaceEffective state space.
x0: Vec<f64>Initial optimiser parameters.
seed: u64The seed every random quantity was drawn from.
target_fidelity: f64Target fidelity.
max_iter: usizeIteration limit.
algorithm: StringOptimiser name.
initial_states: Vec<CMat<f64>>Initial states in the model’s space, one per configured initial state; the plots start from these.
observables: Vec<[CMat<f64>; 3]>Per qubit, the Pauli observables [σx, σy, σz] in the model’s space, zero outside the computational subspace.
model: Box<dyn HamiltonianModel>The Hamiltonian model.
rabi_max: Vec<f64>Maximum Rabi frequency per qubit in rad/s.
delta: Vec<f64>Offset per qubit in rad/s.
sw: Vec<f64>Sweep width per qubit in rad/s.
coupling: Option<RMat<f64>>Configured coupling (upper-triangular, rad/s, without noise); None for one qubit.
n_snapshots: usizeNumber of drift snapshots.
n_rabi: usizeNumber of Rabi snapshots.
Implementations§
Auto Trait Implementations§
impl !RefUnwindSafe for Problem
impl !UnwindSafe for Problem
impl Forget for Problem
impl Freeze for Problem
impl Move for Problem
impl Send for Problem
impl Sync for Problem
impl Unpin for Problem
impl UnsafeUnpin for Problem
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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> ⓘ
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> ⓘ
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> 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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.