pub struct HHLAlgorithm { /* private fields */ }
Expand description
HHL algorithm implementation
Implementations§
Source§impl HHLAlgorithm
impl HHLAlgorithm
Sourcepub fn new(
matrix: Array2<Complex64>,
vector_b: Array1<Complex64>,
params: HHLParams,
) -> Result<Self, String>
pub fn new( matrix: Array2<Complex64>, vector_b: Array1<Complex64>, params: HHLParams, ) -> Result<Self, String>
Create a new HHL algorithm instance
Sourcepub fn total_qubits(&self) -> usize
pub fn total_qubits(&self) -> usize
Get the total number of qubits required
Sourcepub fn prepare_input_state(&self, state: &mut Vec<Complex64>)
pub fn prepare_input_state(&self, state: &mut Vec<Complex64>)
Initialize the quantum state with |b⟩
Sourcepub fn apply_phase_estimation(&self, state: &mut [Complex64])
pub fn apply_phase_estimation(&self, state: &mut [Complex64])
Apply quantum phase estimation to find eigenvalues
Sourcepub fn apply_eigenvalue_inversion(&self, state: &mut [Complex64])
pub fn apply_eigenvalue_inversion(&self, state: &mut [Complex64])
Apply controlled rotation based on eigenvalues
Sourcepub fn apply_inverse_phase_estimation(&self, state: &mut [Complex64])
pub fn apply_inverse_phase_estimation(&self, state: &mut [Complex64])
Apply inverse phase estimation to uncompute eigenvalues
Sourcepub fn postselect_ancilla(&self, state: &mut Vec<Complex64>) -> f64
pub fn postselect_ancilla(&self, state: &mut Vec<Complex64>) -> f64
Measure ancilla qubit and post-select on |1⟩
Sourcepub fn extract_solution(&self, state: &[Complex64]) -> Array1<Complex64>
pub fn extract_solution(&self, state: &[Complex64]) -> Array1<Complex64>
Extract solution from the quantum state
Auto Trait Implementations§
impl Freeze for HHLAlgorithm
impl RefUnwindSafe for HHLAlgorithm
impl Send for HHLAlgorithm
impl Sync for HHLAlgorithm
impl Unpin for HHLAlgorithm
impl UnwindSafe for HHLAlgorithm
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.