Struct QuantumCognitiveState 

pub struct QuantumCognitiveState { /* private fields */ }

Quantum state vector over graph nodes.

|psi> = sum_i alpha_i |i> where alpha_i are complex amplitudes.

Implementations

impl QuantumCognitiveState

pub fn from_fiedler(fiedler: &[f64], node_ids: &[u64]) -> Self

Initialize from the Fiedler vector (classical -> quantum).

The Fiedler vector becomes the initial state with real amplitudes, normalized so that the Born-rule probabilities sum to 1.

pub fn uniform(n: usize, node_ids: &[u64]) -> Self

Initialize uniform superposition (maximum uncertainty).

pub fn probability(&self, i: usize) -> f64

Born rule: probability of node i being in the “answer.”

pub fn probabilities(&self) -> Vec<f64>

Born rule: probability distribution over all nodes.

pub fn entropy(&self) -> f64

Von Neumann entropy: S = -sum p_i ln(p_i).

• 0 = fully collapsed (one node dominates)
• ln(n) = maximum uncertainty (uniform superposition)

pub fn evolve( &mut self, laplacian_action: impl Fn(&[Complex]) -> Vec<Complex>, dt: f64, )

Coherent evolution: |psi(t+dt)> = exp(-i dt H)|psi(t)>.

Uses first-order approximation: |psi’> ~= (I - i dt H)|psi>. H = graph Laplacian L (sparse, computed from CausalGraph adjacency).

laplacian_action computes H|psi> given |psi>.

pub fn evidence_impact(&self, u_idx: usize, v_idx: usize, weight: f64) -> f64

Measure evidence impact via expectation value: <psi|DeltaL|psi>.

This is the quantum generalization of delta_lambda_2 = w*(phi[u]-phi[v])^2.

pub fn rank_evidence_quantum( &self, candidates: &[(usize, usize, f64)], ) -> Vec<QuantumEvidenceRanking>

Rank evidence by quantum impact (Born-rule weighted).

This generalizes rank_evidence_by_impact to use amplitudes instead of the Fiedler vector.

pub fn observe_evidence(&mut self, u_idx: usize, v_idx: usize, weight: f64)

Projective measurement: collapse onto evidence outcome.

After observing that edge (u,v) IS part of the causal chain, amplitudes at u and v are boosted, others are suppressed.

pub fn suppress(&mut self, node_idx: usize, factor: f64)

Partial collapse: suppress hypotheses inconsistent with evidence.

Nodes contradicting the evidence have amplitudes dampened by factor.

pub fn collapse(&self) -> (usize, f64)

Full collapse: return the classical deterministic answer.

Projects |psi> onto the most probable basis state. Returns (index, probability).

pub fn to_classical(&self) -> Vec<f64>

Get the classical Fiedler-like vector (real parts of amplitudes).

This is the “classical projection” – always available.

pub fn is_collapsed(&self, threshold: f64) -> bool

Is the state close to collapsed? (entropy near zero)

pub fn estimated_measurements_to_collapse(&self) -> Option<usize>

How many measurements until collapse?

Based on entropy decay rate from history.

pub fn dimension(&self) -> usize

Number of nodes in the state vector.

pub fn measurement_count(&self) -> u64

Number of measurements performed so far.

pub fn node_ids(&self) -> &[u64]

Node IDs corresponding to each amplitude index.

Trait Implementations

impl Clone for QuantumCognitiveState

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for QuantumCognitiveState

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for QuantumCognitiveState

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for QuantumCognitiveState

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.