QIRT Collapse Dataset: 3-Exact Cover Runs on IBM Sherbrooke and Brisbane

This dataset documents the first known reproducible quantum hardware benchmark for symbolic clause solving using the QIRT (Quantum Information Refinement Theory) Meta-Floor circuit architecture. The benchmark targets the 3-Exact Cover (X3C) problem and was executed on real superconducting QPUs, including IBM Sherbrooke and IBM Brisbane. The QIRT Meta-Floor design combines: Symmetry-preserving gate layers (rx, ry, sx, rz) Clause logic via cz-boosters Dual ancilla-triggered reset floors for entropic compression Meta-floor feedback logic to stabilize collapse structure Unlike variational or Grover-style circuits, no oracles, penalty functions, or cost-based Hamiltonians are used. Each run targets a 24-qubit symbolic encoding of a 3-Exact Cover instance using 6 subset qubits across a 9-element universe. Output bitstrings are analyzed for valid clause coverage, Shannon entropy, and symbolic attractor basin formation. Included in this dataset: Full OpenQASM 2.0 source for Meta-Floor circuit QPU job result JSONs (Sherbrooke ×5, Brisbane ×1) Entropy analysis and valid collapse stats per run Live benchmark logs and collapse summaries All runs achieved ≥3% valid clause collapse with ≤10 bits output entropy, demonstrating structured symbolic resolution on current NISQ-era quantum hardware. Note: All circuits, methods, and results on this page are protected under US Provisional Patent 63/826,473. No replication for commercial or institutional integration is authorized without express permission. Copyright: © 2025 Kristopher Knudsen