SCPN Quantum Control
Evidence-governed workloads on Superconducting Computers,
Start new thread

SCPN Quantum Control - Evidence-governed workloads on Superconducting Computers,

by•
Evidence-governed quantum simulation of coupled-oscillator synchronisation — Kuramoto–XY workloads on Superconducting Computers, raw counts + hash-bound result packs, preregistered protocols. - anulum/scpn-quantum-control

Add a comment

Replies

Best
Maker
📌
scpn-quantum-control turns a coupled-oscillator network into quantum circuits, simulator workflows, hardware-result ledgers, and analysis tools. SCPN here denotes the Scale-Coupled Phase Network — a generalised Kuramoto coupling model whose K_nm matrix provides a structured, reproducible test problem. The first supported physics lane is the Kuramoto-XY mapping: provide a coupling matrix K_nm and oscillator frequencies omega, then compile the matching XY Hamiltonian, run local or provider-backed circuits, measure synchronisation, and compare the result against classical and exact-simulation baselines. The repository is not only a circuit generator. It also carries the operational surfaces needed to use the software responsibly: stable public facades for notebooks and integrations; Rust acceleration for hot numerical kernels; differentiable-programming kernels and conformance rows for supported scalar, vector, matrix, broadcast, selection, shape, assembly, cumulative, and reduction primitives; no-QPU release gates and hardware-result pack verifiers; claim-boundary documentation that separates simulator, hardware, and open scientific questions. A Kuramoto-XY compiler and hardware-evidence workbench for heterogeneous coupled oscillators. The repository contains legacy ibm_fez baseline artefacts, promoted ibm_kingston DLA parity datasets, and SCPN/FIM falsification artefacts with raw counts, job IDs, integrity checks, and count-to-statistic reproduction harnesses. The package provides: A Kuramoto-to-quantum compiler — any coupling matrix K_nm and natural frequencies omega compile directly into executable Qiskit circuits for IBM hardware. Rust-accelerated dense Hamiltonian construction is faster than the Qiskit SparsePauliOp path for small systems (a parity-checked local regression guard, ~96× at L=4 on the i5-11600K baseline, shrinking with system size) — reproducible and gated; see Native Speedup Benchmark. Tracked research module families probing the synchronisation phase transition — synchronisation witnesses, OTOC scrambling, Krylov complexity, persistent homology, DLA parity theorem, and more. Novel constructions and first applications are documented in the research-gems and API pages; exact file counts use the package table below. Hardware evidence with claim classes — legacy ibm_fez baseline rows, promoted ibm_kingston DLA parity datasets, and the SCPN/FIM negative hardware result are separated from simulator-only, frontier, queued-job, and aggregate-only outputs. Stable core contracts and backend capability artefacts are included in this hardening boundary and are replayed via reproducibility tooling. Think of it as a quantum microscope for synchronisation: classical Kuramoto tells you when oscillators lock in step; this package tells you what the quantum state looks like at the transition, how entangled it is, how fast information scrambles, and whether the system thermalises.