pub struct QuantumTensorNetwork<F: Float + Debug> { /* private fields */ }Expand description
Quantum Tensor Network for Advanced Time Series Analysis
Implementations§
Source§impl<F: Float + Debug + Clone + FromPrimitive> QuantumTensorNetwork<F>
impl<F: Float + Debug + Clone + FromPrimitive> QuantumTensorNetwork<F>
Sourcepub fn new(_sequence_length: usize, bonddimension: usize) -> Self
pub fn new(_sequence_length: usize, bonddimension: usize) -> Self
Create new quantum tensor network for time series
Sourcepub fn encode_time_series(&mut self, data: &Array1<F>) -> Result<()>
pub fn encode_time_series(&mut self, data: &Array1<F>) -> Result<()>
Encode time series data into tensor network
Sourcepub fn contract_network(&self) -> Result<Array1<F>>
pub fn contract_network(&self) -> Result<Array1<F>>
Contract tensor network to extract quantum features
Sourcepub fn variational_optimization(
&mut self,
target_data: &Array1<F>,
max_iterations: usize,
) -> Result<F>
pub fn variational_optimization( &mut self, target_data: &Array1<F>, max_iterations: usize, ) -> Result<F>
Optimize tensor network using variational methods
Sourcepub fn calculate_entanglement_entropy(
&self,
region_a: &[usize],
region_b: &[usize],
) -> Result<F>
pub fn calculate_entanglement_entropy( &self, region_a: &[usize], region_b: &[usize], ) -> Result<F>
Calculate entanglement entropy between regions
Trait Implementations§
Auto Trait Implementations§
impl<F> Freeze for QuantumTensorNetwork<F>where
F: Freeze,
impl<F> RefUnwindSafe for QuantumTensorNetwork<F>where
F: RefUnwindSafe,
impl<F> Send for QuantumTensorNetwork<F>where
F: Send,
impl<F> Sync for QuantumTensorNetwork<F>where
F: Sync,
impl<F> Unpin for QuantumTensorNetwork<F>where
F: Unpin,
impl<F> UnwindSafe for QuantumTensorNetwork<F>where
F: UnwindSafe + RefUnwindSafe,
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> 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.