Testing where quantum computation actually outperforms classical methods.
Physical-QPU experiments, compiler research and reproducible evidence. Two independently audited physical-QPU query-advantage experiments.
Discrete State Mapping to Quantum Processing Units
E(x) = sum_i Q_{ii} x_i + sum_{i<j} Q_{ij} x_i x_jQuadratic Unconstrained Binary Optimization form with penalty weight multipliers.
Q-Psi State-Space Compiler: Compiler-Enabled Quantum Query Advantage
Q-Psi compiled authentic software-repair candidate-state spaces and executed a frozen Grover-search experiment on physical IBM quantum hardware. Under the audited black-box verifier model, the quantum arm required fewer effective verifier queries than the frozen classical expected search cost at N=4, N=8 and N=16.
Across 9 frozen candidate spaces drawn from 7 programming language ecosystems, physical quantum execution on ibm_marrakesh (18,432 physical shots) demonstrated quantum query advantage in 9 out of 9 individual cases and across 3 out of 3 problem sizes. At N=16, the upper bound of the 95% Wilson confidence interval on effective quantum queries (7.360) remained strictly below the classical expected baseline of 8.5 queries.
da1c7rkdedkc73eqs5mg8f65edbe...ff2Dynamic Bernstein–Vazirani Single-Shot 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.
Across qubit registers \(n \in [4, 16]\), single-shot sampling measured a quantum scaling exponent of αQ = 0.1532 ± 0.0177 compared against the optimal classical oracle query complexity of αC = 0.6963 (\(t = -30.65, p = 3.47 \times 10^-7\)).
72e87738...ba“Q-Psi does not promote a quantum-advantage claim until its experiment, evidence and claim boundary have been independently audited.”
All physical hardware executions are preserved with raw shot bitstrings, IBM Quantum runtime job IDs, and immutable SHA256 checksums prior to publication.
Q-Psi State-Space Compiler Architecture
Translating multi-repository software-repair search spaces into discrete Hamiltonians and query-bounded quantum circuits for superconducting hardware.
Empirical Physical-QPU Measurements
Physical QPU Experiments
COMPILER + GROVER QUERY ADVANTAGE
Executed 9 frozen compiler-derived candidate-state instances on ibm_marrakesh across N=4, N=8, and N=16. Measured effective quantum queries beat classical expected black-box cost across all 3 problem sizes (N=4: 1.030 vs 2.5; N=8: 2.595 vs 4.5; N=16: 7.144 vs 8.5; 95% CI upper 7.360 < 8.5) and in 9/9 individual cases. Demonstrates compiler-enabled quantum query advantage under an opaque black-box verifier model.
DYNAMIC BERNSTEIN-VAZIRANI
Implemented single-shot dynamic BV protocol (n in [4, 16]). Measured quantum scaling exponent alpha_Q = 0.1532 vs classical exponent alpha_C = 0.6963 (t = -30.65, p = 3.47e-7). Demonstrates quantum query-complexity advantage under the audited Pokharel-Lidar single-shot sampling methodology on physical IBM quantum hardware.
STATE-SPACE COMPILER (STAGE-6F)
End-to-end QUBO/Ising mapping and physical execution across 8 programming ecosystem cohorts. Recovered exact classical global optimum on all instances with N <= 10 variables (4/4, 100%). High gate-depth noise degraded quality on N >= 18. End-to-end runtime quantum advantage: NOT CLAIMED.
RESTRICTED SIMON EXPERIMENT
Transpiled constant-depth hardware-aware circuits (15-16 layers across 16 to 56 physical qubits). Recovered hidden period on a subset of instances (2/6 for w=2, 4/6 for w=3). Raw unmitigated hardware measurement noise caused linear solver failures on remaining instances. Universal asymptotic speedup: INCONCLUSIVE.
MANTRA QUANTUM ENCODING
Deterministic SHA256 parameter mapping of 4 text inputs onto 16-qubit entangled states. Produced distinct measured output distributions with pairwise Total Variation Distance ~ 0.98-0.99. Exploratory mapping — zero metaphysical, causal, or consciousness claims.
Manuscripts & Research Notes
Compiler-Enabled Quantum Query Advantage for Candidate-State Search on Physical Quantum Hardware
Reports an empirical demonstration of compiler-enabled quantum query advantage for software-repair candidate-state search on a 156-qubit Heron processor (ibm_marrakesh). Across 9 frozen instances from 7 language ecosystems at N=4, N=8, and N=16, physical quantum execution achieved lower effective verifier query complexity than the classical black-box baseline (9/9 cases, 3/3 problem sizes; N=16 95% CI upper bound 7.360 < 8.5).
Experimental Demonstration of Algorithmic Query Advantage in Dynamic BV
Reports an empirical demonstration of quantum query-complexity advantage for dynamic single-shot Bernstein-Vazirani on a 156-qubit Heron processor. Measured scaling exponent alpha_Q = 0.1532 vs classical alpha_C = 0.6963 (p = 3.47e-7).
Compilation of Repository State Spaces to Quantum Processing Units
Presents a formal compiler pipeline mapping large software-repair search spaces into discrete QUBO and Ising Hamiltonians executed on physical IBM Quantum hardware (ibm_marrakesh). Evaluates N=5 to N=25 instances, establishing NISQ gate-depth boundaries.
Physical-QPU Restricted-Hamming-Weight Simon Experiment
Evaluates constant-depth (15-16 layers) restricted Simon circuits across 16 to 56 physical qubits on ibm_marrakesh. Documents exact period recovery on subset of instances and analyzes unmitigated readout error boundaries.
Q-Psi Compiler Reaches Its First Quantum-Advantage Milestone
Nine compiler-derived search cases, three problem sizes, one frozen physical-QPU experiment on ibm_marrakesh, and an independent audit.
Cryptographic Evidence & IBM Quantum Execution Logs
Q-Psi Research Support Fund
General research fund supporting open physical QPU execution on superconducting quantum processors, compute infrastructure, datasets, reproducibility engineering, and open science publication.
General research support is voluntary. It directly funds physical QPU runtime, open dataset generation, compute infrastructure, and scientific publication. It does not constitute an investment, purchase of securities, commercial license entitlement, or guarantee of commercial quantum advantage.
Support Independent Research
Contributions fund physical-QPU compute hours, evidence archiving, and open-access publication.
Independent Quantum Research
Q-Psi operates as an independent quantum research initiative under The Oneness Project. Sibling initiative SattvaOS focuses on governed artificial intelligence and is separate from Q-Psi quantum research.
- •Zero Fabricated Claims: We never claim quantum advantage where data is inconclusive or unsupported.
- •Public Evidence: IBM job IDs, cryptographic evidence hashes, audited metrics and claim boundaries are published for independent verification.
- •Publication of Negative Results: Failed or noisy hardware runs are published with full transparency.