pub struct TQHardwareEfficient2Layer { /* private fields */ }Expand description
Hardware Efficient 2 Layer - Alternative hardware efficient ansatz
This is an alternative to the standard hardware efficient ansatz with different rotation and entanglement patterns. It uses:
- Initial layer of RY rotations
- Alternating CZ and CNOT entanglement
- RX and RZ rotations between entanglement layers
Pattern: RY -> (CZ -> RX -> CNOT -> RZ) * n_blocks
Implementations§
Source§impl TQHardwareEfficient2Layer
impl TQHardwareEfficient2Layer
pub fn new(config: TQLayerConfig) -> Self
Trait Implementations§
Source§impl TQModule for TQHardwareEfficient2Layer
impl TQModule for TQHardwareEfficient2Layer
Source§fn forward(&mut self, qdev: &mut TQDevice) -> Result<()>
fn forward(&mut self, qdev: &mut TQDevice) -> Result<()>
Execute the forward pass on the quantum device
Source§fn parameters(&self) -> Vec<TQParameter>
fn parameters(&self) -> Vec<TQParameter>
Get all trainable parameters
Source§fn set_n_wires(&mut self, n_wires: usize)
fn set_n_wires(&mut self, n_wires: usize)
Set number of wires
Source§fn is_static_mode(&self) -> bool
fn is_static_mode(&self) -> bool
Check if module is in static mode
Source§fn static_off(&mut self)
fn static_off(&mut self)
Disable static mode
Source§fn forward_with_input(
&mut self,
qdev: &mut TQDevice,
_x: Option<&Array2<f64>>,
) -> Result<()>
fn forward_with_input( &mut self, qdev: &mut TQDevice, _x: Option<&Array2<f64>>, ) -> Result<()>
Execute forward pass with optional input data (for encoders)
Auto Trait Implementations§
impl Freeze for TQHardwareEfficient2Layer
impl !RefUnwindSafe for TQHardwareEfficient2Layer
impl Send for TQHardwareEfficient2Layer
impl Sync for TQHardwareEfficient2Layer
impl Unpin for TQHardwareEfficient2Layer
impl !UnwindSafe for TQHardwareEfficient2Layer
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.