Verified Evidence Index & Claim Boundaries
Every public claim made by Q-Psi is bound to explicit scientific statuses, IBM Quantum runtime job IDs, physical QPU backends, and cryptographic evidence hashes.
Q-Psi compiler states were successfully mapped to QUBO/Ising and executed on a physical IBM Quantum processor, recovering the exact classical optimum on all four tested instances with 10 or fewer variables.
Q-Psi state compiler demonstrates general end-to-end computational advantage or wall-clock runtime speedup over classical software-repair solvers.
Q-Psi demonstrated quantum query-complexity advantage in a Dynamic Bernstein-Vazirani oracle experiment on physical IBM quantum hardware using the audited Pokharel-Lidar-style single-shot methodology.
Q-Psi executed constant-depth hardware-aware restricted Simon circuits on physical IBM quantum hardware and recovered the hidden period on a subset of instances up to 56 physical qubits. Universal asymptotic speedup on the raw hardware results remained inconclusive.
Q-Psi demonstrated proven universal algorithmic quantum advantage for Simon's problem on raw unmitigated hardware.
Deterministic cryptographic hash mapping of text strings onto 16-qubit entangled states generates distinct measured output distributions with TVD ~0.98-0.99; no metaphysical, causal, or consciousness claims.
Q-Psi demonstrated compiler-enabled quantum query advantage for candidate-state search on physical quantum hardware under a black-box verifier model.
Q-Psi compiler demonstrated wall-clock speedup, general computational supremacy, or end-to-end software-repair advantage over all structure-aware classical algorithms.
- Compiler Query Advantage: Q-Psi demonstrated compiler-enabled quantum query advantage for candidate-state search on physical quantum hardware (ibm_marrakesh) under an opaque black-box verifier model (9/9 cases, 3/3 problem sizes, N=16 95% CI preserves advantage).
- Dynamic BV Query Advantage: Q-Psi demonstrated quantum query-complexity advantage in a dynamic Bernstein-Vazirani oracle experiment on physical IBM quantum hardware using the audited Pokharel-Lidar-style single-shot methodology.
- Compiler Interoperability: Q-Psi compiler states were successfully mapped to QUBO/Ising and executed on a physical IBM Quantum processor, recovering the exact classical optimum on all tested instances with 10 or fewer variables.
- Restricted Simon Circuits: Q-Psi executed constant-depth hardware-aware restricted Simon circuits on physical IBM quantum hardware up to 56 physical qubits. Asymptotic speedup on raw hardware remains inconclusive.
- Q-Psi compiler demonstrates wall-clock speedup or general end-to-end software-repair quantum advantage over all classical search heuristics. (EXCLUDED)
- General computational quantum advantage, commercial quantum advantage, or computational supremacy over classical computing. (EXCLUDED)
- Proven universal algorithmic quantum advantage for Simon's problem on raw unmitigated hardware. (EXCLUDED)
- Metaphysical, spiritual, or consciousness claims from quantum state encoding. (EXCLUDED)