pub struct BosonTerm {
pub operators: Vec<BosonOperator>,
pub coefficient: Complex<f64>,
}
Expand description
A product of bosonic operators
Fields§
§operators: Vec<BosonOperator>
Ordered list of operators in the term
coefficient: Complex<f64>
Overall coefficient
Implementations§
Source§impl BosonTerm
impl BosonTerm
Sourcepub fn new(operators: Vec<BosonOperator>, coefficient: Complex<f64>) -> Self
pub fn new(operators: Vec<BosonOperator>, coefficient: Complex<f64>) -> Self
Create a new bosonic term
Sourcepub fn to_matrix(&self, n_modes: usize) -> QuantRS2Result<Array2<Complex<f64>>>
pub fn to_matrix(&self, n_modes: usize) -> QuantRS2Result<Array2<Complex<f64>>>
Get the matrix representation
Sourcepub fn normal_order(&mut self) -> QuantRS2Result<()>
pub fn normal_order(&mut self) -> QuantRS2Result<()>
Normal order the operators (creation operators to the left)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for BosonTerm
impl RefUnwindSafe for BosonTerm
impl Send for BosonTerm
impl Sync for BosonTerm
impl Unpin for BosonTerm
impl UnwindSafe for BosonTerm
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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<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.