Enum TrotterOrder 

pub enum TrotterOrder {
    First,
    Second,
}

Trotter decomposition orders.

Variants

First

First-order Trotter decomposition.

For H = Σⱼ Hⱼ, approximates exp(-iHt) ≈ Πⱼ exp(-iHⱼt). This is the simplest and fastest method but has O(t²) error per step.

Second

Second-order Trotter decomposition.

Uses the symmetric Suzuki formula for improved accuracy with O(t³) error per step. Requires twice as many exponential operations as first-order.

Trait Implementations

impl Clone for TrotterOrder

fn clone(&self) -> TrotterOrder

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TrotterOrder

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for TrotterOrder

fn eq(&self, other: &TrotterOrder) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for TrotterOrder

impl Eq for TrotterOrder

impl StructuralPartialEq for TrotterOrder