A quantum operating system that schedules workloads across CPU, GPU, and QPU — with a kernel that runs on quantum hardware.
QUASI doesn't just submit jobs to quantum computers. It decides what runs where, using quantum measurement as the scheduling mechanism. The user submits a physics problem. QUASI compiles it, profiles it, caches results, and routes it to the optimal backend — all invisibly.
curl https://garm.valiant-quantum.com/quasi/run -d '{"smiles":"O"}'
# -> { "energy_hartree": -74.989, "method": "RHF/STO-3G", "qubits": 14 }
The molecular pipeline turns chemical structures into ground state energies. Zero Python. All Rust.
SMILES ("O" = water)
-> McMurchie-Davidson integrals
-> Restricted Hartree-Fock
-> Jordan-Wigner mapping
-> Ehrenfest CBOR
-> Afana compiler -> QASM3
-> Solvayeur routes to optimal backend
-> Energy: -74.989 Hartree (H2O)
Verified: H2 = -1.1373 Ha (textbook), H2O = -74.989 Ha. 48 tests.
Any existing CUDA-Q application runs on QUASI without code changes:
import cudaq
cudaq.set_target("quasi") # one line — now using Huoma/Afana/SolvayeurLevel 1: Circuit execution via Huoma (drop-in replacement for cuQuantum statevector). Level 2: Hamiltonian interception — QUASI intercepts at the Hamiltonian level, BEFORE circuit generation, using sinC2 commensurability analysis to decide if a QPU is even needed.
No other CUDA-Q target has Hamiltonian-level interception or commensurability-guided scheduling.
Ehrenfest program (CBOR binary)
|
Afana Compiler
CBOR -> type check -> ZX-IR -> noise analysis -> QASM3
|
Solvayeur Kernel (ATW algorithm)
Scheduling Hamiltonian compiled by Afana
QPU measurement = dispatching decision
|
+----+--------+----------+
v v v
Huoma IBM/IQM Quantinuum/
1B qubits Rigetti IonQ/AQT
17 min (superc.) (trapped ion)
|
Cache (BLAKE3, Nix model)
Same circuit + same calibration = instant result
|
Result to user
- IBM Strasbourg (127q Eagle): Transverse Ising 2q, 10 Trotter steps, Job
d7cuqjp4p4gc73f5o63g - Solvayeur ATW kernel: 10 scheduling rounds on IBM Strasbourg, each dispatching decision was a real quantum measurement
- Huoma: 1,000,000,000 qubits, 17 minutes, 4 GB RAM on a Mac Studio
| Crate | What it does |
|---|---|
| afana | Ehrenfest compiler: CBOR -> AST -> ZX-IR -> QASM |
| quasi-bridge | Molecular pipeline: SMILES -> integrals -> RHF -> Jordan-Wigner -> Ehrenfest |
| quasi-cudaq-ffi | CUDA-Q backend: makes QUASI a cudaq.set_target() |
| quasi-scheduler | Filter-Score-Bind scheduler + 14 backend profiles + Huoma profiler |
| quasi-solvayeur | ATW quantum kernel — 6 phases: backend, qubits, scheduling, coherence, entanglement, errors |
| quasi-cache | BLAKE3 content-addressed result cache (Nix model) |
| quasi-demo | Pipeline demo + VQE orchestrator + Solvayeur demo |
| quasi-senate | AI governance daemon (open-weight models) |
| quasi-board | ActivityPub task ledger |
36,000+ lines of Rust. 450+ tests. Zero vendor SDKs. 14 backend profiles across 6 vendors. All backend types from HAL Contract v2 (single source of truth).
The Solvayeur is the QUASI kernel — not a job scheduler, but an OS kernel that manages quantum resources the way Linux manages CPU, memory, and I/O.
Six kernel capabilities (Phases A-F):
| Phase | What the kernel manages | Classical OS analog |
|---|---|---|
| A Backend selection | Which QPU/simulator runs this workload | Process → CPU core |
| B Qubit region allocation | Which physical qubits, avoiding degraded hardware | Virtual memory → physical RAM |
| C Multi-program scheduling | Multiple programs on one QPU simultaneously | Multi-core scheduling |
| D Coherence budgeting | T2 deadlines, circuit splitting when too deep | Real-time deadline scheduling |
| E Entanglement tracking | Shared quantum state across programs | Shared memory / IPC |
| F Error budget management | Cumulative gate error monitoring, halt/warn | Resource limits (cgroups) |
ATW algorithm (Around The World) — the kernel's scheduling cycle:
H(k) = Sum_ij J_ij Z_i Z_j + Sum_i h_i(k) Z_i + Gamma Sum_i X_i
(contention) (learned bias) (exploration)
The scheduling Hamiltonian is an Ehrenfest program, compiled by Afana, measured on a QPU. Each measurement is a resource allocation decision. Bias fields learn from outcomes. Exploration anneals. The OS compiles itself.
No existing system — not QOS (Berkeley), not HALO (UCLA), not IBM QCSC — uses a QPU as the scheduling kernel.
# Build the compiler
cargo build -p afana --release
# Compile a Heisenberg model to QASM3
cat spec/examples/heisenberg_4q.cbor.hex | xxd -r -p > /tmp/h4.cbor
./target/release/afana /tmp/h4.cbor --qasm v3 --optimize --stats# Classical pipeline (no QPU needed)
cargo run -p quasi-demo --release -- spec/examples/transverse_ising_2q.cbor.hex --skip-qpu
# Solvayeur kernel demo (mock backends)
cargo run -p quasi-demo --bin solvayeur-demo --release -- --rounds 40 --backends 4ls spec/examples/*.md10 example programs: Rabi oscillation, Ising model, Heisenberg chain, GHZ state, QAOA MaxCut, Hubbard model, H2 molecule, spin chain (16q), VQE parametric, and the Solvayeur scheduling Hamiltonian itself.
Ehrenfest is QUASI's specification language. CBOR binary, no text form, no file extension. Programs describe Hamiltonians and observables — not gates. The compiler chooses gates. The program expresses physics.
Named after Paul Ehrenfest (1880-1933). The Ehrenfest theorem bridges classical and quantum mechanics: expectation values of quantum observables follow classical equations of motion. The Solvayeur bridges classical and quantum computing: measurement outcomes of the scheduling Hamiltonian drive classical resource allocation.
Afana is the Ehrenfest compiler. Named after Tatiana Afanasyeva, Ehrenfest's wife and mathematical collaborator.
Solvayeur is the quantum kernel. Named after the Solvay Conferences where Ehrenfest presented alongside Bohr, Einstein, and Heisenberg.
15 phases. 11 complete. Named after the Beastie Boys album.
| # | Phase | Status |
|---|---|---|
| 1 | To All the Girls — Ehrenfest v0.1 spec | DONE |
| 2 | Shake Your Rump — Operator algebra | DONE (90%) |
| 3 | Johnny Ryall — CBOR parser | DONE |
| 4 | Egg Man — Afana bootstrap | DONE |
| 5 | High Plains Drifter — ZX-IR + lowering | DONE |
| 6 | Sounds of Science — ZX rewriting (QuiZX) | DONE |
| 7 | 3-Minute Rule — QASM3 output | DONE |
| 8 | Hey Ladies — Type checker | DONE |
| 9 | 5-Piece Chicken Dinner — Hardware-aware compilation | DONE |
| 10 | Looking Down the Barrel — Noise-aware compilation | DONE |
| 11 | Car Thief — ZX optimization >=10% | DONE |
| 12 | What Comes Around — Variational parameters | DONE |
| 13 | Shadrach — Classical control flow | IN PROGRESS (60%) |
| 14 | Ask for Janice — Memory model, v1.0 spec | NOT STARTED |
| 15 | B-Boy Bouillabaisse — Quantum OS | IN PROGRESS (40%) |
The codebase is continuously improved by an AI governance daemon running open-weight models (qwen3.6-plus, gemma-4, nemotron-ultra, kimi-k2, cogito, deepseek-r1). The senate drafts issues, solves them, reviews solutions, and opens PRs — autonomously.
5-role pipeline: Council -> Drafter -> Gate -> Solver -> Reviewer
git clone https://github.com/ehrenfest-quantum/quasi.git
cd quasi
cargo test --workspace # 375 tests| Skill | Where |
|---|---|
| Rust | Afana compiler, scheduler, cache, Solvayeur |
| Quantum physics | Ehrenfest examples, spec review |
| Systems / scheduling | quasi-scheduler plugins, backend profiles |
| Distributed systems | quasi-board (ActivityPub), federation |
claude mcp add quasi npx -y tsx ./quasi-mcp/src/index.tsTools: list_tasks -> claim_task -> implement -> complete_task
| Component | License | Rationale |
|---|---|---|
| Ehrenfest spec, HAL Contract | Apache 2.0 | Specs must be free for anyone to implement |
| quasi-agent, quasi-mcp, Afana | GPL v3 | Distributed tools — copyleft |
| quasi-board | AGPL v3 | Network service — closes SaaS loophole |
QUASI is initiated by Daniel Hinderink. It is an open project — the goal is a neutral foundation once the community is established.
"He was not merely the best teacher in our profession whom I have ever known; he was also passionately preoccupied with the development and destiny of men, especially his students."
-- Albert Einstein, eulogy for Paul Ehrenfest, 1933
The OS compiles itself. Around the world.