TensorNetwork

Struct TensorNetwork 

Source
pub struct TensorNetwork {
    pub tensors: HashMap<usize, Tensor>,
    pub connections: Vec<(TensorIndex, TensorIndex)>,
    pub num_qubits: usize,
    pub max_bond_dimension: usize,
    pub detected_circuit_type: CircuitType,
    pub using_qft_optimization: bool,
    pub using_qaoa_optimization: bool,
    pub using_linear_optimization: bool,
    pub using_star_optimization: bool,
    /* private fields */
}
Expand description

Tensor network representation of a quantum circuit

Fields§

§tensors: HashMap<usize, Tensor>

Collection of tensors in the network

§connections: Vec<(TensorIndex, TensorIndex)>

Connections between tensor indices

§num_qubits: usize

Number of physical qubits

§max_bond_dimension: usize

Maximum bond dimension for approximations

§detected_circuit_type: CircuitType

Detected circuit type for optimization

§using_qft_optimization: bool

Whether QFT optimization is enabled

§using_qaoa_optimization: bool

Whether QAOA optimization is enabled

§using_linear_optimization: bool

Whether linear optimization is enabled

§using_star_optimization: bool

Whether star optimization is enabled

Implementations§

Source§

impl TensorNetwork

Source

pub fn new(num_qubits: usize) -> Self

Create a new empty tensor network

Source

pub fn add_tensor(&mut self, tensor: Tensor) -> usize

Add a tensor to the network

Source

pub fn connect(&mut self, idx1: TensorIndex, idx2: TensorIndex) -> Result<()>

Connect two tensor indices

Source

pub fn get_neighbors(&self, tensor_id: usize) -> Vec<usize>

Get all tensors connected to the given tensor

Source

pub fn contract_all(&self) -> Result<Complex64>

Contract all tensors to compute the final amplitude

Source

pub fn total_elements(&self) -> usize

Get the total number of elements across all tensors

Source

pub fn memory_usage(&self) -> usize

Estimate memory usage in bytes

Source

pub fn find_optimal_contraction_order(&self) -> Result<Vec<usize>>

Find optimal contraction order using dynamic programming

Source

pub fn find_lowest_cost_pair( &self, tensors: &[Tensor], ) -> Result<(usize, usize, f64)>

Find the pair of tensors with lowest contraction cost

Source

pub fn estimate_contraction_cost( &self, tensor_a: &Tensor, tensor_b: &Tensor, ) -> f64

Estimate the computational cost of contracting two tensors

Source

pub fn contract_tensor_pair( &self, tensor_a: &Tensor, tensor_b: &Tensor, ) -> Result<Tensor>

Contract two tensors optimally

Source

pub fn set_basis_state_boundary(&mut self, basis_state: usize) -> Result<()>

Set boundary conditions for a specific computational basis state

Source

pub fn apply_gate( &mut self, gate_tensor: Tensor, target_qubit: usize, ) -> Result<()>

Apply a single-qubit gate to the tensor network

Source

pub fn apply_two_qubit_gate( &mut self, gate_tensor: Tensor, control_qubit: usize, target_qubit: usize, ) -> Result<()>

Apply a two-qubit gate to the tensor network

Trait Implementations§

Source§

impl Clone for TensorNetwork

Source§

fn clone(&self) -> TensorNetwork

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 Debug for TensorNetwork

Source§

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

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

impl Display for TensorNetwork

Source§

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

Formats the value using the given formatter. Read more

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<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
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> 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> 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> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String

Converts the given value to a String. 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.
Source§

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

Source§

fn vzip(self) -> V

Source§

impl<T> Ungil for T
where T: Send,