pub struct AdaptVQE {
pub hamiltonian: MolecularHamiltonian,
pub operator_pool: FermionicOperatorPool,
pub config: AdaptVQEConfig,
pub ansatz: AdaptAnsatz,
pub num_qubits: usize,
}Expand description
Main ADAPT-VQE algorithm implementation
Fields§
§hamiltonian: MolecularHamiltonianMolecular Hamiltonian
operator_pool: FermionicOperatorPoolOperator pool
config: AdaptVQEConfigConfiguration
ansatz: AdaptAnsatzCurrent ansatz
num_qubits: usizeNumber of qubits required
Implementations§
Source§impl AdaptVQE
impl AdaptVQE
Sourcepub fn new(
hamiltonian: MolecularHamiltonian,
num_qubits: usize,
config: AdaptVQEConfig,
) -> Self
pub fn new( hamiltonian: MolecularHamiltonian, num_qubits: usize, config: AdaptVQEConfig, ) -> Self
Create a new ADAPT-VQE instance
Sourcepub fn run(
&mut self,
initial_state: &Array1<Complex64>,
) -> Result<AdaptVQEResult, QuantRS2Error>
pub fn run( &mut self, initial_state: &Array1<Complex64>, ) -> Result<AdaptVQEResult, QuantRS2Error>
Run the ADAPT-VQE algorithm
Sourcepub fn get_circuit_depth(&self) -> usize
pub fn get_circuit_depth(&self) -> usize
Get current circuit depth
Sourcepub fn get_pool_size(&self) -> usize
pub fn get_pool_size(&self) -> usize
Get operator pool size
Trait Implementations§
Auto Trait Implementations§
impl Freeze for AdaptVQE
impl RefUnwindSafe for AdaptVQE
impl Send for AdaptVQE
impl Sync for AdaptVQE
impl Unpin for AdaptVQE
impl UnsafeUnpin for AdaptVQE
impl UnwindSafe for AdaptVQE
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.