Skip to main content

JordanWignerTransform

Struct JordanWignerTransform 

Source
pub struct JordanWignerTransform { /* private fields */ }
Expand description

Jordan-Wigner transformation for mapping fermions to qubits

Implementations§

Source§

impl JordanWignerTransform

Source

pub fn new(num_modes: usize) -> Self

Create new Jordan-Wigner transformer

Source

pub fn transform_operator_to_sum( &mut self, op: &FermionicOperator, ) -> Result<PauliOperatorSum>

Transform a single fermionic operator to its complete Pauli operator sum via JW.

Returns the full Jordan-Wigner representation as a PauliOperatorSum (possibly containing multiple terms for operators like creation/annihilation).

JW mappings (n = num_modes, Z_k below denotes Z on mode k):

  • n_i = (I − Z_i)/2 → two Pauli strings (constant + Z_i)
  • c†_i = (Z_0⋯Z_{i-1})(X_i − iY_i)/2 → two Pauli strings
  • c_i = (Z_0⋯Z_{i-1})(X_i + iY_i)/2 → two Pauli strings
  • Hopping c†_from c_to via full product → four raw terms reduced to two
  • Interaction c†⋯c_l via full product
Source

pub fn transform_operator( &mut self, op: &FermionicOperator, ) -> Result<PauliString>

Transform fermionic operator to a single representative Pauli string.

This returns only the X-part of the JW decomposition (for creation/annihilation) or the Z-only part of the number operator, and is used internally for Pauli-composition chains. For complete expectation values use transform_operator_to_sum.

Source

pub fn transform_string( &mut self, fermionic_string: &FermionicString, ) -> Result<PauliOperatorSum>

Transform fermionic string to Pauli operator sum.

Each fermionic operator is expanded to its complete JW Pauli representation; successive operator sums are then multiplied together (outer product). The overall fermionic coefficient is applied last.

Source

pub fn transform_hamiltonian( &mut self, hamiltonian: &FermionicHamiltonian, ) -> Result<PauliOperatorSum>

Transform fermionic Hamiltonian to Pauli Hamiltonian

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V