cometadata/datacite-titles-descriptions-related-identifiers huggingface dataset:
DOI: 10.5281/zenodo.15879691
title: QIRT Meta-Floor v2: Symbolic Collapse Benchmark on Sycamore-Modeled Noisy Simulator

description: This benchmark evaluates the Quantum Information Refinement Theory (QIRT) Meta-Floor v2 architecture on a Sycamore-modeled noisy simulator (qsimcirq).The circuit solves the NP-complete 3-Exact Cover problem using symbolic collapse shaping — no Grover, cost Hamiltonians, or classical post-filtering.

QIRT Meta-Floor v2 introduces a spiral-threaded collapse funnel, layered rz slope shaping, and clause-specific symbolic symmetry enforcement.Results show a 17.48% clause satisfaction rate in a full decoherence environment with 4.21 bits entropy, exceeding all prior symbolic logic collapse attempts.

 


🔹 License & IP Protection Notice (Include in Zenodo “License” or Notes Section):



© 2025 Kris KnudsenProtected under U.S. Provisional Patent Application No. 63/826,473

All methods, circuits, symbolic shaping sequences, architectural techniques (Meta-Floor, spiral-threaded collapse, clause-specific rz shaping), and entropy shaping strategies are intellectual property of Kris Knudsen / Axion Metrics.

This benchmark is public for scientific transparency and reproducibility only.No replication or integration into institutional or commercial systems is authorized without a signed license agreement.

Licensing inquiries: knudsenkris@axiosmetrics.com
DOI: 10.5281/zenodo.15873440
title: QIRT Meta-Floor Google sim

description: This dataset and report document the execution and results of QIRT8v2, a symbolic clause alignment quantum circuit designed under the Quantum Information Refinement Theory (QIRT) framework. The benchmark was conducted on a Google Sycamore-style noisy simulator via Colab, emulating gate and readout noise similar to Google's quantum hardware.

The test implements a 3-Exact Cover problem with 9 target qubits, 3 clause structures, and symbolic clause collapse logic without any cost Hamiltonian or penalty encoding. The simulation was executed over 1024 shots, with post-processing validating clause satisfaction and computing entropy of the output state distribution.

Key findings include:





Clause Satisfaction Rate (CSR): 5.08%




Entropy: 4.21 bits




Top valid symbolic solutions demonstrating coherent clause collapse despite injected noise



This result confirms that QIRT’s symbolic scaffold is resilient even under Sycamore-type error models, demonstrating backend-agnostic collapse behavior and outperforming baseline expectations without Grover search or QEC overhead.

Contents:



qirt8v2_sycamore.qasm – Quantum circuit source notebook


Author:Kristopher K. Knudsen (Axion Metrics LLC)Protected under U.S. Provisional Patent Application No. 63/826,473DOI (root benchmark): https://doi.org/10.5281/zenodo.15867661
DOI: 10.5281/zenodo.15873441
title: QIRT Meta-Floor Google sim

description: This dataset and report document the execution and results of QIRT8v2, a symbolic clause alignment quantum circuit designed under the Quantum Information Refinement Theory (QIRT) framework. The benchmark was conducted on a Google Sycamore-style noisy simulator via Colab, emulating gate and readout noise similar to Google's quantum hardware.

The test implements a 3-Exact Cover problem with 9 target qubits, 3 clause structures, and symbolic clause collapse logic without any cost Hamiltonian or penalty encoding. The simulation was executed over 1024 shots, with post-processing validating clause satisfaction and computing entropy of the output state distribution.

Key findings include:





Clause Satisfaction Rate (CSR): 5.08%




Entropy: 4.21 bits




Top valid symbolic solutions demonstrating coherent clause collapse despite injected noise



This result confirms that QIRT’s symbolic scaffold is resilient even under Sycamore-type error models, demonstrating backend-agnostic collapse behavior and outperforming baseline expectations without Grover search or QEC overhead.

Contents:



qirt8v2_sycamore.qasm – Quantum circuit source notebook


Author:Kristopher K. Knudsen (Axion Metrics LLC)Protected under U.S. Provisional Patent Application No. 63/826,473DOI (root benchmark): https://doi.org/10.5281/zenodo.15867661
DOI: 10.5281/zenodo.15865472
title: QIRT Meta-Floor Benchmark (v6) – 3-Exact Cover Collapse Outcomes & Circuit Design

description: 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.
DOI: 10.5281/zenodo.15865473
title: QIRT Meta-Floor Benchmark (v6) – 3-Exact Cover Collapse Outcomes & Circuit Design

description: 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.
DOI: 10.15468/dl.3zn6f2
title: Occurrence Download

description: A dataset containing 3 species occurrences available in GBIF matching the query:
{
 "and" : [
 "TaxonKey is Chromonephthea braziliensis",
 "Country is Brazil",
 "HasCoordinate is true"
 ]
}

 The dataset includes 3 records from 2 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0034398-250827131500795/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.15468/dl.885jyc
title: Occurrence Download

description: A dataset containing 90 species occurrences available in GBIF matching the query:
{
 "and" : [
 "TaxonKey is Trifolium rubens",
 "Country is Netherlands",
 "HasCoordinate is true"
 ]
}

 The dataset includes 90 records from 4 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0034403-250827131500795/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.15468/dl.af8y22
title: Occurrence Download

description: A dataset containing 575 species occurrences available in GBIF matching the query:
{
 "TaxonKey" : [
 "is Crustomyces subabruptus"
 ]
}

 The dataset includes 575 records from 83 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0034399-250827131500795/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.5281/zenodo.15860241
title: QIRT Collapse Dataset: 3-Exact Cover Runs on IBM Sherbrooke and Brisbane

description: 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
DOI: 10.5281/zenodo.15860242
title: QIRT Collapse Dataset: 3-Exact Cover Runs on IBM Sherbrooke and Brisbane

description: 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
DOI: 10.15468/dl.vq994f
title: Occurrence Download

description: A dataset containing 0 species occurrences available in GBIF matching the query:
{
 "and" : [
 "TaxonKey is one of (Garra ornata, Garra regressus, Garra tana, Garra trewavasae, Garra waterloti, Gobiomorphus gobioides, Hypophthalmichthys nobilis, Labeo alluaudi, Labeo alticentralis, Labeo altivelis, Labeo annectens, Labeo ansorgii, Labeo barbatus, Labeo batesii, Labeo bottegi, Labeo boulengeri, Labeo brachypoma, Labeo brunellii, Labeo camerunensis, Labeo capensis, Labeo chariensis, Labeo congoro, Labeo coubie, Labeo curriei, Labeo cyclopinnis, Labeo cyclorhynchus, Labeo cylindricus, Labeo degeni, Labeo dhonti, Labeo falcipinnis, Labeo forskalii, Labeotropheus fuelleborni, Labeo fulakariensis, Labeo greenii, Labeo gregorii, Labeo horie, Labeo kibimbi, Labeo kirkii, Labeo lineatus, Labeo longipinnis, Labeo lualabaensis, Labeo lukulae, Labeo luluae, Labeo lunatus, Labeo macrostoma, Labeo maleboensis, Labeo mesops, Labeo molybdinus, Labeo nasus, Labeo nigricans, Labeo niloticus, Labeo nunensis, Labeo parvus, Labeo percivali, Labeo polli, Labeo quadribarbis, Labeo rectipinnis, Labeo reidi, Labeobarbus rocadasi, Labeo rosae, Labeo roseopunctatus, Labeo rouaneti, Labeo rubromaculatus, Labeo ruddi, Labeo sanagaensis, Labeo seeberi, Labeo senegalensis, Labeo simpsoni, Labeo sorex, Labeo tongaensis, Labeo trigliceps, Labeo umbratus, Labeo victorianus, Labeo weeksii, Labeo werneri, Labeo worthingtoni, Labeobarbus acuticeps, Labeobarbus acutirostris, Labeobarbus aeneus, Labeobarbus alluaudi, Labeobarbus altianalis, Labeobarbus altipinnis, Labeobarbus ansorgii, Labeobarbus aspius, Labeobarbus axelrodi, Labeobarbus batesii, Labeobarbus beso, Labeobarbus brauni, Labeobarbus brevispinis, Labeobarbus bynni, Labeobarbus bynni occidentalis, Labeobarbus bynni waldroni, Labeobarbus cardozoi, Labeobarbus caudovittatus, Labeobarbus clarkeae, Labeobarbus claudinae, Labeobarbus codringtonii, Labeobarbus compiniei, Labeobarbus crassibarbis, Labeobarbus dainellii)",
 "HasCoordinate is true",
 "HasGeospatialIssue is false",
 "BasisOfRecord is one of (Specimen, Observation, Human Observation, Machine Observation, Material sample, Literature Occurrence, Material citation, Occurrence evidence)",
 "Geometry POLYGON ((28.1382 29.0599,19.1382 29.0599,19.1382 20.0599,28.1382 20.0599,28.1382 29.0599))"
 ]
}

 The dataset includes 0 records from 0 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0034400-250827131500795/datasets/export for details.
DOI: 10.15468/dl.xkxhtc
title: Occurrence Download

description: A dataset containing 49 species occurrences available in GBIF matching the query:
{
 "and" : [
 "TaxonKey is Trifolium rubens",
 "Country is Belgium",
 "HasCoordinate is true"
 ]
}

 The dataset includes 49 records from 9 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0034402-250827131500795/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.5281/zenodo.15817583
title: QIRT 3-Coloring (C4) Hardware Log

description: Zenodo Dataset Description — QIRT 3-Coloring (C4 Ring) Hardware Benchmarks

Title:QIRT 3-Coloring (C4) Quantum Hardware Benchmark Data — Axion Metrics, July 2025

Description:This dataset contains all original data, OpenQASM circuits, analysis scripts, and experiment logs generated by Axion Metrics during the July 2025 benchmarking of the Quantum Information Refinement Theory (QIRT) method on IBM Sherbrooke hardware for the 3-coloring (C4 ring) problem.

Contents:





Raw IBM Quantum JSON output files for all QIRT and control circuits




Annotated OpenQASM 2.0 circuit files (including failed and successful variants)




Full Python analysis scripts used to score outputs and produce all reported metrics




Chronological experiment logs and summary findings



Intellectual Property & Legal Notice:The QIRT (Quantum Information Refinement Theory) method, all related circuits, analytic methods, code, and experiment documentation contained in this dataset are protected by copyright and by issued/active patents held by Kris Knudsen / Axion Metrics LLC.





This dataset is provided for review and scholarly assessment only.




No rights to reproduce, reuse, redistribute, adapt, or commercialize any part of QIRT or its applications are granted.




Any reproduction, sharing, or use (in whole or in part) is strictly prohibited without the express written permission of the copyright and patent holder.




Requests for research collaborations or licensing should be sent to Kris Knudsen at knudsenkris@axiosmetrics.com.



Contact:Kris Knudsen, Axion MetricsEmail: knudsenkris@axiosmetrics.comWebsite: https://axiosmetrics.com
DOI: 10.5281/zenodo.15817584
title: QIRT 3-Coloring (C4) Hardware Log

description: Zenodo Dataset Description — QIRT 3-Coloring (C4 Ring) Hardware Benchmarks

Title:QIRT 3-Coloring (C4) Quantum Hardware Benchmark Data — Axion Metrics, July 2025

Description:This dataset contains all original data, OpenQASM circuits, analysis scripts, and experiment logs generated by Axion Metrics during the July 2025 benchmarking of the Quantum Information Refinement Theory (QIRT) method on IBM Sherbrooke hardware for the 3-coloring (C4 ring) problem.

Contents:





Raw IBM Quantum JSON output files for all QIRT and control circuits




Annotated OpenQASM 2.0 circuit files (including failed and successful variants)




Full Python analysis scripts used to score outputs and produce all reported metrics




Chronological experiment logs and summary findings



Intellectual Property & Legal Notice:The QIRT (Quantum Information Refinement Theory) method, all related circuits, analytic methods, code, and experiment documentation contained in this dataset are protected by copyright and by issued/active patents held by Kris Knudsen / Axion Metrics LLC.





This dataset is provided for review and scholarly assessment only.




No rights to reproduce, reuse, redistribute, adapt, or commercialize any part of QIRT or its applications are granted.




Any reproduction, sharing, or use (in whole or in part) is strictly prohibited without the express written permission of the copyright and patent holder.




Requests for research collaborations or licensing should be sent to Kris Knudsen at knudsenkris@axiosmetrics.com.



Contact:Kris Knudsen, Axion MetricsEmail: knudsenkris@axiosmetrics.comWebsite: https://axiosmetrics.com
DOI: 10.15468/dl.pcvwk5
title: Occurrence Download

description: A dataset containing 1 species occurrences available in GBIF matching the query:
{
 "and" : [
 "TaxonKey is Trifolium rubens",
 "Country is Australia",
 "HasCoordinate is true"
 ]
}

 The dataset includes 1 records from 1 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0034401-250827131500795/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.5281/zenodo.15779015
title: QIRT Benzene Ring Hardware Benchmark Dataset (IBM Sherbrooke, July 2025)

description: This dataset provides the raw hardware outputs, circuit details, and analysis results from experimental demonstrations of Quantum Information Refinement Theory (QIRT) applied to a 6-qubit benzene ring model, executed on the IBM Sherbrooke quantum processor in July 2025.

QIRT introduces a new class of quantum algorithms designed to preserve and refine quantum delocalization, coherence, and symmetry beyond what is achievable with standard VQE or chemistry methods. The dataset includes:





The exact OpenQASM circuit (MOLE.qasm) used for the experiment.




Raw job metadata and bitstring result files from the IBM QPU.




A grouped symmetry-class CSV and supporting Python scripts for reproducibility and entropy analysis.




Device calibration files for full auditability.



Key results include a symmetry entropy of 5.51 bits (out of 5.93 maximum), confirming near-ideal quantum delocalization and ring symmetry in hardware—an unprecedented achievement in quantum chemistry simulation.

All data is released for scientific benchmarking and transparency under the Creative Commons Attribution 4.0 International License.The underlying QIRT method, algorithms, and software are protected by US Provisional Patent Application 63/826,473 and the Business Source License 1.1 (BSL 1.1).Commercial or research integration of QIRT algorithms, code, or firmware is strictly prohibited without written permission.
DOI: 10.5281/zenodo.15779016
title: QIRT Benzene Ring Hardware Benchmark Dataset (IBM Sherbrooke, July 2025)

description: This dataset provides the raw hardware outputs, circuit details, and analysis results from experimental demonstrations of Quantum Information Refinement Theory (QIRT) applied to a 6-qubit benzene ring model, executed on the IBM Sherbrooke quantum processor in July 2025.

QIRT introduces a new class of quantum algorithms designed to preserve and refine quantum delocalization, coherence, and symmetry beyond what is achievable with standard VQE or chemistry methods. The dataset includes:





The exact OpenQASM circuit (MOLE.qasm) used for the experiment.




Raw job metadata and bitstring result files from the IBM QPU.




A grouped symmetry-class CSV and supporting Python scripts for reproducibility and entropy analysis.




Device calibration files for full auditability.



Key results include a symmetry entropy of 5.51 bits (out of 5.93 maximum), confirming near-ideal quantum delocalization and ring symmetry in hardware—an unprecedented achievement in quantum chemistry simulation.

All data is released for scientific benchmarking and transparency under the Creative Commons Attribution 4.0 International License.The underlying QIRT method, algorithms, and software are protected by US Provisional Patent Application 63/826,473 and the Business Source License 1.1 (BSL 1.1).Commercial or research integration of QIRT algorithms, code, or firmware is strictly prohibited without written permission.
DOI: 10.15468/dl.8aytkt
title: Occurrence Download

description: A dataset containing 25 species occurrences available in GBIF matching the query:
{
 "and" : [
 "Country is Sri Lanka",
 "TaxonKey is Crudia zeylanica"
 ]
}

 The dataset includes 25 records from 9 constituent datasets; see https://api.gbif.org/v1/occurrence/download/0034404-250827131500795/datasets/export for details.
 
Data from some individual datasets included in this download may be licensed under less restrictive terms.
DOI: 10.5281/zenodo.15678101
title: QIRT MAXCUT 50-Node Hardware Benchmark — IBM QPU (June 2025)

description: This dataset supports the Axion Metrics experimental validation of QIRT (Quantum Information Refinement Theory) via a 50-node MAXCUT optimization task using OpenQASM 2.0 circuits. It contains all source code, hardware results, and reproducibility tools used to evaluate symbolic collapse behavior on the IBM Brisbane 127-qubit quantum processor.

Each QIRT circuit uses a gravitationally-inspired projection layer (IECHO) to shape coherence without variational tuning or error correction. Over five independent QPU runs, we observe consistent symbolic convergence toward near-optimal cut values (max cut = 65 in all cases), with CSR ≥90% stability and entropy suppression across shots.

Usage and Rights:This archive is proprietary and not licensed for reuse.© 2025 Axion Metrics LLC. All rights reserved.

https://axiosmetrics.com/