One-run polycontextural quantum computation on a 156-qubit processor Ilan Kreitmann (Quantum Polycontextural Computing, Ra'anana, Israel) Quantum Polycontextural Computing (QPC) keeps several application logics as contextures of a single quantum job, relates them by transjunctions, and reads the application metric from the joint measurement. This preprint reports that architecture on IBM Heron r2 processors: a 24-contexture photomask desk in one 156-qubit job on ibm_kingston (R1_none 0.622 vs W0.00 0.460, job daas1burrl7c73860bd0); a 17-logic ADMET desk occupying the full 156-qubit register on ibm_marrakesh with raw junction gap 0.185; and a pre-registered first-line melanoma ranking on ibm_kingston (0.569 over 0.394, job da1gvd6g52gs73clkp20). The measured quantum state is the decision. Correspondence: readytogo@quantumpolycontextural.ai https://quantumpolycontextural.ai
One-run polycontextural quantum computation on a 156-qubit processor Ilan Kreitmann (Quantum Polycontextural Computing, Ra'anana, Israel) Quantum Polycontextural Computing (QPC) keeps several application logics as contextures of a single quantum job, relates them by transjunctions, and reads the application metric from the joint measurement. This preprint reports that architecture on IBM Heron r2 processors: a 24-contexture photomask desk in one 156-qubit job on ibm_kingston (R1_none 0.622 vs W0.00 0.460, job daas1burrl7c73860bd0); a 17-logic ADMET desk occupying the full 156-qubit register on ibm_marrakesh with raw junction gap 0.185; and a pre-registered first-line melanoma ranking on ibm_kingston (0.569 over 0.394, job da1gvd6g52gs73clkp20). The measured quantum state is the decision. Correspondence: readytogo@quantumpolycontextural.aihttps://quantumpolycontextural.ai
Quantum Polycontextural Computing (QPC) is a hardware-agnostic orchestration layer that maps multiple labelled problem contexts onto one gate-model execution on commercial superconducting QPUs. We report three auditable hardware studies on IBM Heron (ibm_fez, ibm_marrakesh) under the IBM Open plan, each with published job identifiers and JSON artifacts: (i) a 46-qubit mastoparan-I folding pilot compared to a published trapped-ion BF-DCQO energy reference (−8.70); QPC Tier-D repair reaches −9.74 in one pass with eight recoverable job IDs; (ii) a controlled K-ablation on 16 qubits where polycontextural K=4 fits held-out Wang–Busemeyer joint statistics better than a matched K=1 control (bootstrap one-sided p<0.0005 on total-variation and KL); (iii) thirteen Runtime jobs demonstrating co-resident multi-context layouts from 4×39Q through 24 contexts in six cluster submissions. A supplementary transjunction ON vs OFF ablation at 3×26Q shows bridge-local inter-context correlators increase by |Δ|>0.05 when ring coupling is enabled, after QPC readout mitigation on bridge qubits only; full-width correlators do not separate conditions. We state limitations explicitly: QPC is not a new QPU; protein and cognition results are selective comparisons, not universal advantage claims; open-instance entropy alone does not signature the architecture.
We report the first hardware-executed quantum-classical coordination pipeline on NISQ hardware for a societal coordination problem task-to-member matching in a 500-agent community economy. The three-stage architecture (AI decomposition → 19 qubit quantum semantic scoring on IBM Heron R2 classical QUBO assignment) executes end-to-end on three Heron R2 processors (ibm_fez,ibm_marrakesh, ibm_kingston). We observe a three-tier regret stratification: (i) a noiseless ceiling at 1.48% (five independent simulator controls + ibm_marrakesh), (ii) a classical-kernel tier at 0.86% via the Shin–Teo–Jeong (2024) dequantization kernel K_c, and (iii) a hardware tier at 0.61% reproduced independently on ibm_fez and ibm_kingston with identical θ. Since K_c's RKHS provably contains the quantum kernel's RKHS at logical depth, the hardware tier is a reproducible operating regime outside the dequantized function class. A companion multi-cycle society-model experiment shows pipeline weight choice is a time-horizon-dependent policy decision; the QUBO matcher also acts as a performative Granovetter machine (80% more weak ties than greedy, p = 9.1 × 10⁻⁵, d ≈ 27 at n = 10 runs).
On 1 June 2026, a decentralized per-qubit lambda field was implemented on the IBM Heron R2 processor (ibm_kingston, 156 qubits) and probed with a multi-shock excitation protocol. Unlike the predecessor work (Westrick, QITE Hardware Results 156Q, 8-12 April 2026), which tested a globally controlled QITE quantum collective, each qubit here carries its own lambda state and receives, in the feedback loop, only its own measurement statistic p1_i. The only inter-qubit coupling propagates physically through the CZ gates of the Heavy-Hex topology. Six shocks were applied at six different positions on the chip: central (q*=78), nearest neighbor (d=1), intermediate (d=3, d=5), deep (d=8), and edge (d=12). Each individual shock triggered a chip-wide burst within 1-8 cycles (peak |delta p1| between 0.308 and 0.366; 10 to 22 simultaneously active qubits). Four additional spontaneous bursts were detected between shocks, for a total of 10 bursts in 150 cycles. The 6/6 reproducibility was verified by four independent non-parametric statistical tests, all positive: (1) permutation test p = 0.008 against chance alignment; (2) pairwise burst-vector Pearson correlation r_mean = +0.65 with all 15 pairs above noise; (3) cross-session reproducibility 9/10 qubit overlap between two independent IBM Quantum sessions, hypergeometric p = 0.008; (4) Mann-Whitney U test of burst amplitude versus Phase-A baseline, ratio 2.7, p < 0.0001. This bundle contains the complete primary data (raw JSON logs, NumPy matrices), all 27 visualizations, IBM job IDs of every submitted job, console logs of all runs, the pre-registration documents with locked detection thresholds, and SHA-256 checksums of every file (MANIFEST.json) for independent verification. Backend: IBM Heron R2 (ibm_kingston), 156 qubits, 4096 shots/cycle. Patent filings: DPMA Az. 10 2025 003 906.9 (QITE), 10 2025 004 891.2 (QISE). Predecessor: Westrick, QITE Hardware Results 156Q (8-12 April 2026).
Experimental measurement data of the QITE formalism (Quantum-Inspired Thermal Equilibrium) on IBM quantum processors of the Heron R2 generation with 156 physical qubits. Altogether 75+ jobs on two different backends (ibm_kingston and ibm_fez), over 830,000 shots, carried out on 8, 10, and 11 April 2026. Seven experiment series: (1) Static phases (R=0.5 / 1.0 / 2.0): three clearly separated Hamming-weight distributions (16.3σ significance), positive ZZ correlations under QITE (+0.318 at R=2.0) versus negative ones in the null experiment (−0.061). Controlled comparison experiment with null hypothesis (identical circuit structure with random parameters). (2) Real-time feedback loop (8 cycles): two targeted perturbations (R=3.0 and R=0.3); the system returns autonomously to equilibrium within 2 cycles. First demonstration of dynamic controllability of a QITE quantum collective on a real quantum computer. (3) Cross-backend reproducibility: identical results on ibm_kingston and ibm_fez — deviations within a few percent. (4) Zero-noise extrapolation (ZNE): circuit folding (1×, 3×, 5×) with Richardson extrapolation. Result: coherence 0.474 → 0.474 extrapolated (improvement: −0.0005). The optimized circuit (depth 13, 120 CZ gates) already operates at the hardware noise floor — ZNE cannot improve it further because the circuit is already near-optimal. (5) Scaling comparison 27 vs. 156 qubits: the 27-qubit version on the same backend (ibm_kingston) shows ZZ correlation of 0.788 against 0.318 at 156 qubits (Δ = +0.470). Circuit depth drops from 13 to 6, CZ gates from 120 to 13. Confirms: the QITE signal scales with gate quality. (6) Extended feedback loop (20 cycles): four extreme perturbations — R=3.0 (excess), R=0.3 (deficit), R=5.0 (5-fold excess), R=0.1 (10-fold deficit). Maximum coherence C=0.785 (highest value ever measured). The system reorganizes itself after each perturbation within 2–4 cycles. Long-term stability demonstrated across 20 cycles and 436 seconds of total runtime. (7) 3-minute stability demonstration (20 cycles, 262.7 seconds): dedicated long-term test with two targeted shocks (R=4.0 and R=0.2). Result: ones_fraction remains between 0.491 and 0.499 over 4.4 minutes (maximum deviation from equilibrium: 0.009). Drift across the entire runtime: +0.003. Complete recovery after both shocks. 18/18 non-shock cycles stable. First demonstration of a self-correcting quantum field on a real quantum computer over several minutes. Circuit optimization relative to 8 April: reduction of circuit depth from 295 to 13 (factor 22×), two-qubit gates from 1,946 to 120, by exclusive use of native Heron R2 gates (CZ, SX, RZ, X) and direct lambda encoding via RY(θ) with θ = 2·arctan(λ₂/λ₁). The system demonstrably produces controllable, correlated, self-organizing quantum states on real hardware — no simulation, no theory, but physical measurement data of a concrete technical system. All 59 IBM job IDs are contained in the raw data and verifiable on quantum.ibm.com. German patent applications Az. 10 2025 003 906.9 (QITE) and Az. 10 2025 004 891.2 (QISE). Final document (12 April 2026) — 21 sections, 9 experiment series, 372 individual quantum measurements. Extensions compared to the previous version: Section 19: 9-minute experiment (209 cycles, 156 qubits, 4096 shots) Phase A: null test (23 cycles, R=1.0) — baseline control measurement Phase B: 8 shocks (R=0.1 to R=8.0) incl. double shock — complete recovery after each shock Section 20: overall summary of all 9 experiment series (8–12 April 2026) Section 21: raw-data appendix with SHA-256 checksums of all 9 JSON files Core results: 372 quantum measurements on IBM Heron R2 (ibm_kingston, ibm_fez) Dynamic range R=0.1 to R=8.0 (factor 80) with complete self-correction The null test proves: recovery is an active process, not a hardware artefact No drift, no collapse across 209 consecutive measurements Optimized circuit: depth 13, 120 CZ gates, at the hardware noise floor (ZNE-confirmed)
Quantum processors have crossed the one-hundred-qubit mark, but noise continues to limit circuit performance, while full quantum error correction remains too costly for routine use. Error suppression and mitigation therefore play an important role in extracting value from current hardware, yet independent comparisons of commercial solutions on identical workloads and devices remain scarce. We benchmark IBM Qiskit Runtime, Q-CTRL Performance Management, and Qedma QESEM on IBM Pittsburgh, a 156-qubit IBM Quantum Heron r3 processor. For Sampler workloads, we run Bernstein-Vazirani, quantum phase estimation, GHZ-state preparation, and randomized mirror circuits with up to 100 measured qubits, comparing raw execution, IBM measurement twirling, and Q-CTRL. For Estimator workloads, we measure chain-averaged magnetization and correlation observables of an eight-layer transverse-field Ising circuit at 25, 50, and 75 qubits against an exact matrix-product-state reference, comparing IBM raw execution, IBM TREX plus twirling, Q-CTRL, and QESEM. Q-CTRL produced the best results on the three structured Sampler workloads while keeping reported QPU times within the same order as the IBM configurations. Across six Ising observable and system-size cases, aggregate mean absolute error was 0.0883 for IBM raw execution, 0.0807 for IBM TREX plus twirling, 0.0285 for Q-CTRL, and 0.0188 for QESEM. Relative to raw execution, Q-CTRL and QESEM reduced aggregate error by factors of 3.10 and 4.70, respectively, while QESEM used 7.5 to 11.1 times the reported QPU time of Q-CTRL. These results show that managed error suppression and mitigation can substantially improve current hardware performance, but with distinct accuracy and execution-time tradeoffs.
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.