Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

NuviraQ: Per-Machine Pre-Compensation for Systematic Hardware Bias on a Superconducting Qubit — Verification Kit and Results (ibm_kingston, 25 September 2026)

Richard Vigslist

Published Sep 25, 2026• 0 citations
Publisher

Abstract

Access restricted by the author — October 2026. This verification kit is released privately to named researchers on request. The public claims record for this work is: Reading a Drifting Machine, DOI 10.5281/zenodo.23405654. — Richard Vigslist, Nuvira Technologies
DOI
10.5281/zenodo.22966582

Related papers

Empirical Identification of a Depth-Dependent Coherence Boundary in Superconducting Quantum Hardware

Richard Vigslist

Author's withdrawal note — October 2026. I am the author of record. This deposit was produced with AI assistance during a period of exploratory work and was not verified to the standard I now require of anything published under my name. I no longer stand behind its claims, and I have restricted access to its files. It should not be cited as evidence for its conclusions. — Richard Vigslist, Nuvira Technologies

•Dec 21, 2025•0 citations

Calibration-Agnostic Probabilistic Gate: Single-Parameter Control of Single-Qubit Measurement Bias on NISQ Hardware

Richard Vigslist

Author's withdrawal note — October 2026. I am the author of record. This deposit was produced with AI assistance during a period of exploratory work and was not verified to the standard I now require of anything published under my name. I no longer stand behind its claims, and I have restricted access to its files. It should not be cited as evidence for its conclusions. — Richard Vigslist, Nuvira Technologies

•Dec 18, 2025•0 citations

Noise-Free Quantum Compilation: Structured Output Distributions on NISQ Hardware Without Mitigation

Richard Vigslist

Author's withdrawal note — October 2026. I am the author of record. This deposit was produced with AI assistance during a period of exploratory work and was not verified to the standard I now require of anything published under my name. I no longer stand behind its claims, and I have restricted access to its files. It should not be cited as evidence for its conclusions. — Richard Vigslist, Nuvira Technologies

•Apr 24, 2026•0 citations

Compiler-Directed Phase-Coherent Probability Control on NISQ Hardware

Richard Vigslist

Author's withdrawal note — October 2026. I am the author of record. This deposit was produced with AI assistance during a period of exploratory work and was not verified to the standard I now require of anything published under my name. I no longer stand behind its claims, and I have restricted access to its files. It should not be cited as evidence for its conclusions. — Richard Vigslist, Nuvira Technologies

•Dec 18, 2025•0 citations

Currently Realizable Quantum Error Detection/Correction Algorithms for Superconducting Qubits

Kyle Keane, Alexander N. Korotkov

Bulletin of the American Physical Society•Mar 21, 2011•1 citation

Reading a Drifting Machine: Fresh Characterization, a Corpus-Prior Receiver, and Symbol-Level Message Exchange on Three 156-Qubit IBM Heron Processors

Richard Vigslist

We report a set of pre-registered experiments on the three 156-qubit IBM Heron r2 processors reachable on a single open-plan account (ibm_kingston, ibm_marrakesh, ibm_fez), carried out on 14–15 October 2026. The object of study is not computational speedup but channel reliability: whether fixed symbolic messages can be delivered intact through a present-day noisy processor when the processor's per-wire readout response is measured fresh in the same sitting, and whether two such processors can exchange messages with per-position verification. Messages are 17-symbol sequences drawn from a 13-symbol test alphabet whose preparations collapse to nine distinguishable readout classes. A receiver combining per-wire selection from a fresh characterization, grammar-constrained decoding, and a corpus-frequency tie-break delivered 36/36 messages on ibm_kingston in two independent campaigns, 36/36 on ibm_marrakesh, and 35/36 on ibm_fez, against stale-plan and uncharacterized controls ranging from 2/36 to 30/36 depending on backend and control type. The grammar-constrained receiver without the corpus prior scored 30/36, 30/36, and 29/36 on the three backends; its losses are a single systematic mechanism — a deterministic tie on one battery message — identified from saved counts and closed by the prior. In a separate experiment, ibm_kingston and ibm_marrakesh exchanged self-introduction streams authored by each backend from its own fresh characterization, through a six-stage symmetric relay, with 204/204 position-flights received exactly and zero substitutions. In a counts-only blind test, an independent decoder with no shared codebook recovered the discreteness and grouping structure of two authored streams (pooled pairwise grouping agreement 0.971 against a pre-registered 0.90 strong-pass bar) while overestimating the alphabet size (reported 8, true value 6). A census of repeated characterizations shows that the ranking of a device's clearest wires turns over within hours (same-day top-17 wire overlap of 1–2 of 17 on ibm_marrakesh), while per-wire response quality moves by only ~0.01, so characterizations are within-sitting instruments. No speedup, no machine networking, and no machine understanding is claimed. The full receiver implementation is withheld as a trade secret; verification is offered through the published job IDs, retained raw counts, and tiered third-party reproduction.

•Oct 15, 2026•0 citations
We report a set of pre-registered experiments on the three 156-qubit IBM Heron r2 processors reachable on a single open-plan account (ibm_kingston, ibm_marrakesh, ibm_fez), carried out on 14–15 October 2026. The object of study is not computational speedup but channel reliability: whether fixed symbolic messages can be delivered intact through a present-day noisy processor when the processor's per-wire readout response is measured fresh in the same sitting, and whether two such processors can exchange messages with per-position verification. Messages are 17-symbol sequences drawn from a 13-symbol test alphabet whose preparations collapse to nine distinguishable readout classes. A receiver combining per-wire selection from a fresh characterization, grammar-constrained decoding, and a corpus-frequency tie-break delivered 36/36 messages on ibm_kingston in two independent campaigns, 36/36 on ibm_marrakesh, and 35/36 on ibm_fez, against stale-plan and uncharacterized controls ranging from 2/36 to 30/36 depending on backend and control type. The grammar-constrained receiver without the corpus prior scored 30/36, 30/36, and 29/36 on the three backends; its losses are a single systematic mechanism — a deterministic tie on one battery message — identified from saved counts and closed by the prior. In a separate experiment, ibm_kingston and ibm_marrakesh exchanged self-introduction streams authored by each backend from its own fresh characterization, through a six-stage symmetric relay, with 204/204 position-flights received exactly and zero substitutions. In a counts-only blind test, an independent decoder with no shared codebook recovered the discreteness and grouping structure of two authored streams (pooled pairwise grouping agreement 0.971 against a pre-registered 0.90 strong-pass bar) while overestimating the alphabet size (reported 8, true value 6). A census of repeated characterizations shows that the ranking of a device's clearest wires turns over within hours (same-day top-17 wire overlap of 1–2 of 17 on ibm_marrakesh), while per-wire response quality moves by only ~0.01, so characterizations are within-sitting instruments. No speedup, no machine networking, and no machine understanding is claimed. The full receiver implementation is withheld as a trade secret; verification is offered through the published job IDs, retained raw counts, and tiered third-party reproduction.