Crate metatron_qso

Crate metatron_qso 

Source
Expand description

§Metatron Quantum State Operator (QSO)

A high-performance quantum computing framework built around the sacred geometry of the Metatron Cube — a 13-dimensional quantum system with 78 edges representing all five Platonic solids.

§Overview

The Metatron QSO provides:

  • Quantum Graph Dynamics: State evolution on 13-node Metatron geometry
  • Variational Quantum Algorithms: VQE, QAOA, VQC with multiple ansätze
  • Quantum Walks: Continuous-time quantum walks with Krylov methods
  • Dynamic Tripolar Logic (DTL): 58.5% information advantage over binary
  • Topological Codes: Symmetry-protected quantum error correction

§Quick Start

use metatron_qso::prelude::*;

// Create the Metatron graph
let graph = MetatronGraph::new();

// Create the Hamiltonian
let params = QSOParameters::default();
let hamiltonian = MetatronHamiltonian::new(&graph, &params);

// Initialize quantum state on central node
let initial_state = QuantumState::basis_state(0)?;

// Run quantum walk
let qw = ContinuousTimeQuantumWalk::new(&hamiltonian);
let evolved = qw.evolve(&initial_state, 1.0);

// Check probability distribution
let probs = evolved.probabilities();
println!("Probability at node 0: {:.4}", probs[0]);

§Architecture

The library is organized into focused modules:

  • graph - Metatron Cube geometry and graph structures
  • quantum - Quantum states, operators, and dimensions
  • hamiltonian - Graph Hamiltonians and spectral decomposition
  • quantum_walk - Quantum walk algorithms (feature: walks)
  • vqa - Variational Quantum Algorithms (feature: vqa)
  • dtl - Dynamic Tripolar Logic (feature: dtl)
  • symmetry_codes - Topological error correction (feature: codes)
  • advanced_algorithms - Grover search, Boson sampling (feature: advanced)

§Features

Control which components are compiled via Cargo features:

[dependencies]
metatron-qso-rs = { version = "0.1", features = ["walks", "vqa"] }

Available features:

  • walks (default) - Quantum walk algorithms
  • vqa (default) - VQE, QAOA, VQC
  • dtl (default) - Dynamic Tripolar Logic
  • codes - Topological codes
  • advanced - Advanced algorithms (Grover, Boson sampling)

§Graph Structure

The Metatron Cube consists of:

  • 13 nodes: 1 center + 6 hexagon vertices + 6 cube vertices
  • 78 edges: Fully connected subgraphs
  • Code distance: d ≥ 6 for topological error correction
       Hexagon Layer (nodes 1-6)
             /|\
            / | \
           /  |  \
          0-------0  ← Central node (0)
           \  |  /
            \ | /
             \|/
       Cube Layer (nodes 7-12)

§Performance

Benchmarks on Intel i7-12700K:

  • Quantum Walk: 31,941 ops/sec
  • VQE Convergence: ~150 iterations to E₀ = -12.9997
  • QAOA MaxCut: 99.74% approximation ratio (depth p=3)

§Examples

See the examples/ directory:

  • quantum_walk_basic.rs - Simple quantum walk demo
  • qaoa_maxcut_basic.rs - MaxCut optimization
  • vqa_demo.rs - Complete VQA workflow

§References

Re-exports§

pub use crate::graph::metatron::MetatronGraph;
pub use crate::hamiltonian::MetatronHamiltonian;
pub use crate::hamiltonian::SpectrumInfo;
pub use crate::params::QSOParameters;
pub use crate::qso::QuantumStateOperator;
pub use crate::quantum::METATRON_DIMENSION;
pub use crate::quantum::operator::QuantumOperator;
pub use crate::quantum::state::QuantumState;
pub use crate::dtl::network::DTLResonatorNetwork;
pub use crate::dtl::operations::DTLOperations;
pub use crate::dtl::state::DTLState;

Modules§

dtl
Dynamic Tripolar Logic primitives and resonator dynamics.
graph
Graph representations related to the Metatron Cube.
hamiltonian
optimizer
Quantum-Inspired Optimizer
params
prelude
Prelude module for convenient imports.
qso
quantum
Quantum information primitives: states and operators on the 13D Metatron Hilbert space.
quantum_walk
Quantum walk solvers, diagnostics, and high-end benchmarking utilities.
quantum_walk_toolkit
Quantum Walk Toolkit
vqa
Variational Quantum Algorithms (VQA) Suite