Quantum Information Refinement Theory (QIRT): Solving 3-Exact Cover with Entropic Shaping and Adaptive QEC on NISQ Processors
Bibliographic record
Abstract
We present the latest experimental validation of Quantum Information Refinement Theory (QIRT), demonstrating a coherence-preserving architecture for solving symbolic clause problems on near-term quantum processors. This work introduces a QIRT v6 circuit that solves the 3-Exact Cover problem using a novel Adaptive Quantum Error Correction (QEC) floor-shaping mechanism. Executed on the 127-qubit IBM Sherbrooke quantum processor, our benchmarks achieved a mean Clause Satisfaction Rate (CSR) of 6.13% across 26,240 total shots, with a peak of 6.81%. These results were achieved without reliance on Grover's search, QUBO penalty functions, or cost Hamiltonians, establishing that entropic shaping guided by clause-targeted reset logic can significantly improve symbolic fidelity. The hardware benchmarks, archived on Zenodo, confirm QIRT as a viable method for directing quantum state collapse toward structured solutions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".