Manuscripts & Research Notes
Q-Psi prepares formal scientific manuscripts documenting quantum compilation architectures, physical QPU benchmark results, and oracle query-complexity advantages.
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.