QIRT Meta-Floor Benchmark (v6) – 3-Exact Cover Collapse Outcomes & Circuit Design

This dataset captures the full execution log, circuit architecture, and symbolic collapse outcomes of a 5-run benchmark of the Quantum Information Refinement Theory (QIRT) applied to the 3-Exact Cover problem. The benchmark was performed on IBM's Sherbrooke superconducting quantum processor in July 2025 using a custom 24-qubit QIRT v6 circuit featuring adaptive QEC floor-shaping. Each run includes raw hardware output, clause validation metrics, and entropy calculations. The circuit enforces clause logic without Grover’s algorithm or penalty functions, relying instead on bidirectional symmetry layers, ancilla-driven decoherence probes, and timed entropic resets. The results demonstrate consistent clause satisfaction rates above 3% in 4 of 5 runs, with entropy suppression reaching as low as 8.12 bits. Variability in one run is attributed to backend-level shot noise and QPU thermal fluctuation, typical for public NISQ hardware. Included Files: Full QASM 2.0 circuit All 5 job result JSONs Clause validation script (Python) Collapse statistics report (PDF) Live log summary This benchmark supports QIRT’s premise of symbolic-guided collapse outperforming traditional cost-based encoding under noisy conditions. Legal & IP NoticeAll circuits, methods, and results included in this dataset are protected under US Provisional Patent Application No. 63/826,473. No replication, reuse, or integration into commercial or institutional systems is authorized without explicit written permission. This dataset is shared for scientific transparency and academic validation only. Unauthorized commercial exploitation is strictly prohibited.