Skip to main content

QuantumOperator

Struct QuantumOperator 

Source
pub struct QuantumOperator { /* private fields */ }
Expand description

Named linear combination of operator components.

Implementations§

Source§

impl QuantumOperator

Source

pub fn new( components: impl IntoIterator<Item = QuantumComponent>, ) -> Result<Self>

Construct a named linear family after validating names and shapes.

Source

pub const fn shape(&self) -> (usize, usize)

Return the common rectangular shape of every component.

Source

pub fn component_names(&self) -> impl Iterator<Item = &str>

Iterate component names in stable coefficient order.

Source

pub fn components(&self) -> &[QuantumComponent]

Return every named component in stable coefficient order.

Source

pub fn component(&self, name: &str) -> Result<&Operator>

Look up one named component or return an invalid-options error.

Source

pub fn resolve_coefficients( &self, parameters: &HashMap<String, Complex64>, ) -> Result<Vec<Complex64>>

Resolve named parameters into the stable component order returned by Self::component_names.

This is the allocation-light coefficient boundary used by dynamic frontends: names are validated once at the edge, while repeated operator applications consume a compact coefficient slice.

Source

pub fn apply_coefficients( &self, coefficients: &[Complex64], input: &[Complex64], output: &mut [Complex64], ) -> Result<()>

Apply a compact ordered coefficient vector without materializing the linear combination.

Source

pub fn apply( &self, parameters: &HashMap<String, Complex64>, input: &[Complex64], output: &mut [Complex64], ) -> Result<()>

Apply one named member of the family without assembling a temporary sparse matrix.

Source

pub fn evaluate( &self, parameters: &HashMap<String, Complex64>, format: MatrixFormat, ) -> Result<Operator>

Materialize one parameter value in the requested format.

For repeated evaluations prefer QuantumOperator::plan, which retains a common sparse pattern and updates only numeric values.

Source

pub fn plan(&self, format: MatrixFormat) -> Result<QuantumOperatorPlan>

Prepare a fixed sparse pattern for repeated evaluations of this family.

The plan aligns every component on one union pattern, reuses all index arrays, and mutates only a preallocated value buffer. It supports dense, CSC, CSR, DIA, and matrix-free output without a model-specific fast path.

Source

pub fn scaled(&self, coefficient: impl Into<Complex64>) -> Result<Self>

Source

pub fn conjugated(&self) -> Result<Self>

Source

pub fn add(&self, right: &Self) -> Result<Self>

Source

pub fn adjoint(&self) -> Result<Self>

Source

pub fn transpose(&self) -> Result<Self>

Trait Implementations§

Source§

impl Clone for QuantumOperator

Source§

fn clone(&self) -> QuantumOperator

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for QuantumOperator

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,