PauliSum

Struct PauliSum 

Source
pub struct PauliSum<const W: usize> { /* private fields */ }
Expand description

Weighted sum of Pauli operators, stored SoA, sorted and deduplicated.

Implementations§

Source§

impl<const W: usize> PauliSum<W>

Source

pub fn empty(num_qubits: usize) -> Self

Empty sum on num_qubits qubits.

§Panics

Panics in debug builds if num_qubits > 64 · W. Caller is responsible for ensuring num_qubits <= 64 · W.

Source

pub fn num_qubits(&self) -> usize

Number of qubits this sum is defined over.

Source

pub fn len(&self) -> usize

Number of non-identity terms after deduplication.

Source

pub fn is_empty(&self) -> bool

true iff the sum has no terms.

Source

pub fn x(&self) -> &[[u64; W]]

Read-only view of the X-part column.

Source

pub fn z(&self) -> &[[u64; W]]

Read-only view of the Z-part column.

Source

pub fn coeff(&self) -> &[Complex64]

Read-only view of the coefficient column.

Source

pub fn add(&self, other: &Self) -> Self

Sum of two PauliSums. Linear-time merge; preserves the sorted invariant. Terms whose coefficients sum to exactly 0+0i are dropped.

§Examples

Disjoint keys interleave in sort order; equal keys sum, and an exact-zero combined coefficient drops the term.

use paulistrings::{BuildAccumulator, PauliString, Phase};
use num_complex::Complex64;

let mut a = BuildAccumulator::<1>::new(2);
a.add_term(PauliString::<1>::z(0), Phase::ONE, Complex64::new(1.0, 0.0));
a.add_term(PauliString::<1>::x(1), Phase::ONE, Complex64::new(0.5, 0.0));
let a = a.finalize();

let mut b = BuildAccumulator::<1>::new(2);
b.add_term(PauliString::<1>::z(0), Phase::ONE, Complex64::new(-1.0, 0.0));
let b = b.finalize();

// Z₀ cancels exactly; only X₁ survives.
let r = a.add(&b);
assert_eq!(r.len(), 1);
assert_eq!(r.coeff()[0], Complex64::new(0.5, 0.0));
Source

pub fn scale(&mut self, c: Complex64)

Multiply every coefficient by c in place.

Source

pub fn find(&self, x: &[u64; W], z: &[u64; W]) -> Result<usize, usize>

Locate a Pauli key by binary search; returns Ok(idx) if present, Err(idx) for the insertion point otherwise.

Source

pub fn truncate_by_magnitude(&mut self, eps: f64)

Drop terms whose coefficient magnitude is <= eps. Preserves sort.

Source

pub fn assert_invariants(&self)

Debug-only invariant check. No-op in release builds.

Trait Implementations§

Source§

impl<const W: usize> Clone for PauliSum<W>

Source§

fn clone(&self) -> PauliSum<W>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<const W: usize> Debug for PauliSum<W>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<const W: usize> Default for PauliSum<W>

Source§

fn default() -> PauliSum<W>

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl<const W: usize> Freeze for PauliSum<W>

§

impl<const W: usize> RefUnwindSafe for PauliSum<W>

§

impl<const W: usize> Send for PauliSum<W>

§

impl<const W: usize> Sync for PauliSum<W>

§

impl<const W: usize> Unpin for PauliSum<W>

§

impl<const W: usize> UnwindSafe for PauliSum<W>

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<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
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
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

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

Initializes a with the given initializer. Read more
§

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

Dereferences the given pointer. Read more
§

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

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

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

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.