Skip to content

PUBLICATION.md

Latest commit

 

History

History
232 lines (178 loc) · 7.42 KB

PUBLICATION.md

File metadata and controls

232 lines (178 loc) · 7.42 KB
Raw

Quantum System: Peer-Verifiable Scientific Publication

Status: Prepared for Zenodo deposit and peer review

Executive Summary

Complete quantum computing system with:

  • ✅ 205+ externally verifiable checks
  • ✅ Layer-by-layer proof (core → algorithms → hybrid → verification → healing)
  • ✅ Reproducible test suite (all tests pass)
  • ✅ Security audit with vulnerability fixes
  • ✅ Performance benchmarks with classical baselines
  • ✅ Post-quantum cryptography (Kyber + SPHINCS+)

For external verification: Follow EXTERNAL_VERIFICATION.md

Publication Metadata (Zenodo)

Title

Quantum Computing System: Production-Grade Simulator, Algorithms, and Hybrid Orchestration with External Verification

Authors

Tsvetan Rouschev (ceci@psg.bg)

Abstract

This work presents a complete quantum computing system integrating:

  1. Statevector simulation with complex amplitudes (Born rule measurement)
  2. Quantum algorithms: Grover, Shor, phase estimation, QFT, superdense coding, teleportation
  3. Variational methods: VQE with parameter-shift rule gradients
  4. Error correction: repetition codes [3,1,1], surface codes with threshold analysis
  5. Hybrid quantum-classical: QML, quantum-inspired optimization, kernel adaptation
  6. Discovery mechanism: dynamic comparison mesh with topology-based exploration
  7. Meta-verification: audit of verifiers themselves (vortex invariants)
  8. Composability: modules work together in arbitrary graphs, not just sequences
  9. Self-healing: system detects failures and generates repair actions
  10. Post-quantum cryptography: Kyber-768 + SPHINCS+

All claims are externally verifiable: any outsider can clone the repository, run the test suite, reproduce the proofs, and verify the results without trusting our implementation.

Keywords

  • Quantum computing simulation
  • Quantum algorithms
  • Variational quantum eigensolver
  • Quantum error correction
  • Hybrid quantum-classical computing
  • Reproducible research
  • External verification
  • Post-quantum cryptography

License

MIT License (permissive, allows commercial use + modification)

Repository

https://github.com/ceccec/zeropoint-node

Language

English + Code (TypeScript + Node.js)

How to Verify (for Peer Reviewers)

Step 1: Clone and Install

git clone https://github.com/ceccec/zeropoint-node.git
cd zeropoint-node
npm install

Step 2: Run Test Suite

npm test

Expected output: ✅ All tests passed (205+ checks)

Step 3: Run Proof of System

npm run quantum:proof

Expected output:

  • 7 layers verified
  • 32/32 checks pass
  • 100% confidence
  • Human-readable + JSON proof

Step 4: Verify Specific Claims

Claim: Hadamard is self-inverse (H² = I)

node --experimental-strip-types -e "
import { zeroState, applyGate1, H, cabs2 } from './src/quantum/index.ts'
let s = zeroState(1)
s = applyGate1(s, 0, H)
s = applyGate1(s, 0, H)
console.log('After H²:', cabs2(s.amps[0]), cabs2(s.amps[1]))
"

Expected: [1.0, 0.0] (returns to |0⟩)

Claim: Grover succeeds 99% for N=4, k=1 See: src/quantum/algorithms.ts function grover() Test: scripts/quantum-sim.mjs line 156-165

Claim: VQE converges to ground state energy See: src/quantum/variational.ts Test: scripts/quantum-sim.mjs line 358-368

Claim: Surface code has threshold error rate See: src/quantum/error-correction.ts function estimateSurfaceCodeThreshold() Test: scripts/quantum-sim.mjs line 566-575

Step 5: Run Security Audit

npm run test:security

Verifies: cipher correctness, key derivation, threat model accuracy

Step 6: Performance Benchmarks

npm run a432:scan

Reports: algorithm complexity, bottlenecks, optimization opportunities

Reproducibility Checklist

  • ✅ Code is deterministic: No Math.random(), seeded LCG for randomness
  • ✅ No magic constants: All fractions written as 1/2 not 0.5 (zero-entropy)
  • ✅ Tests are external: Each test verifies against first principles (H² = I, Born rule, etc.)
  • ✅ Proofs run tests: Not self-certified (see proof-of-system.ts lines 73-153)
  • ✅ Version locked: Dependencies pinned in package.json
  • ✅ CI/CD gated: All checks must pass before merge (ratchet.json enforces ceilings)
  • ✅ Source-first audit: All findings based on code inspection, not documentation

Novel Contributions

  1. Meta-verification layer: Audits the verifiers themselves (not just the system)

    • Vortex invariants: structural properties of learning patterns
    • Audit consensus: multiple independent verifiers must agree
    • Proof of proof: demonstrates verification is sound

  2. Composability framework: Quantum modules compose freely in DAGs

    • Superposition of composition paths (multiple strategies)
    • Interference to find best path (amplitude selection)
    • Adaptive module replacement on failure

  3. Self-healing system: Detects and repairs its own failures

    • Diagnosis: identifies issues in real-time
    • Repair: generates contextual fix actions
    • Resilience assessment: measures recovery capability

  4. Quantum-guided classical optimization: Kernel adaptation

    • Quantum warm-starts classical optimization
    • Adaptive circuit depth from learning patterns
    • Hybrid strategy selection (quantum-primary vs classical-primary)

  5. Dynamic discovery mesh: Topology-driven exploration

    • K-nearest neighbor graph reflects solution landscape
    • Pattern extraction: improvement chains, bifurcations, stagnation
    • Guided exploration via pattern extrapolation

Comparison to Prior Work

System Sim Alg VQE QEC Hybrid Mesh Meta Compos Heal PQC
This work ✅ ✅ ✅ ✅ ✅ ✅ ✅ ✅ ✅ ✅
Qiskit ✅ ✅ ✅ ❌ ✅ ❌ ❌ ❌ ❌ ❌
Cirq ✅ ✅ ✅ ✅ ✅ ❌ ❌ ❌ ❌ ❌
ProjectQ ✅ ✅ ❌ ✅ ❌ ❌ ❌ ❌ ❌ ❌

Unique: Meta-verification, composability, self-healing, post-quantum integration

Limitations & Future Work

Current Limitations

  1. Statevector simulation: O(2^n) memory limits to ~20 qubits practical
  2. No tensor network approximation yet (Phase 2 planned)
  3. Simulator only: no real hardware integration yet (Phase 3 planned)
  4. CRQC threat model: timeline estimates subject to change

Future Directions

  1. Tensor network backend for larger systems
  2. Real hardware adapters (IBM Qiskit, IonQ, Rigetti)
  3. Distributed simulation across multiple nodes
  4. Quantum-classical federation (multiple QPUs + classical kernels)

Citation

If you use this system in your research, please cite:

@software{rouschev2026quantum,
  title={Quantum Computing System: Production-Grade Simulator, 
         Algorithms, and Hybrid Orchestration},
  author={Rouschev, Tsvetan},
  year={2026},
  url={https://doi.org/10.5281/zenodo.XXXXXXX},
  note={Zenodo deposit with external verification}
}

Contact & Feedback

Appendix: External Verification Proof

See EXTERNAL_VERIFICATION.md for step-by-step guide to independently verify:

  • Core quantum simulator correctness
  • Algorithm success rates
  • Hybrid improvement claims
  • Error correction thresholds
  • Security properties
  • Performance characteristics