pub struct ParametricCircuit {
pub gates: Vec<Box<dyn ParametricGate>>,
pub num_qubits: usize,
pub num_parameters: usize,
}Expand description
Parametric quantum circuit for VQE
Fields§
§gates: Vec<Box<dyn ParametricGate>>Sequence of parametric gates
num_qubits: usizeNumber of qubits
num_parameters: usizeNumber of parameters
Implementations§
Source§impl ParametricCircuit
impl ParametricCircuit
Sourcepub fn add_gate(&mut self, gate: Box<dyn ParametricGate>)
pub fn add_gate(&mut self, gate: Box<dyn ParametricGate>)
Add a parametric gate
Sourcepub fn cnot(&mut self, control: usize, target: usize)
pub fn cnot(&mut self, control: usize, target: usize)
Add a (non-parametric) CNOT gate, used to build entangling layers.
Sourcepub fn evaluate(&self, params: &[f64]) -> Result<Array1<Complex64>>
pub fn evaluate(&self, params: &[f64]) -> Result<Array1<Complex64>>
Evaluate the circuit for the given parameters and return the final state vector.
Starts from |0...0> and applies each parametric gate’s matrix to the dense state
vector in sequence. Amplitudes use the little-endian convention (qubit q maps to
bit q of the basis index), matching [compute_pauli_expectation_from_state] so
expectation values and parameter-shift gradients are computed on the genuine state
produced by the circuit rather than a fixed placeholder.
Sourcepub fn gradient_expectation(
&self,
observable: &PauliOperatorSum,
params: &[f64],
method: GradientMethod,
) -> Result<Vec<f64>>
pub fn gradient_expectation( &self, observable: &PauliOperatorSum, params: &[f64], method: GradientMethod, ) -> Result<Vec<f64>>
Compute gradient of expectation value using parameter-shift rule
Auto Trait Implementations§
impl !RefUnwindSafe for ParametricCircuit
impl !UnwindSafe for ParametricCircuit
impl Freeze for ParametricCircuit
impl Send for ParametricCircuit
impl Sync for ParametricCircuit
impl Unpin for ParametricCircuit
impl UnsafeUnpin for ParametricCircuit
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> 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.