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

FEYNMAN-2 - Update

ALEXANDAR BALEVSKY

Published Aug 4, 2026• 0 citations
Publisher

Abstract

This update consolidates the formal, numerical, and publication-level corrections identified after Revision 3.0 of the FEINMAN 2 project and after direct execution of its reproducibility package. The underlying proposal remains a typed directed operator-graph calculus organized through the locked 4S-11S operator-space chain. The update does not introduce a new interaction or a confirmed deviation from standard quantum mechanics or quantum electrodynamics. Its main contribution is instead evidential and methodological: the complete package was checked by exact SHA-256 verification and rerun in the frozen environment (Python 3.13.5, NumPy 2.3.5, Linux x86_64/glibc 2.41), producing STATE=DONE and TESTS=PASS. The run reproduces the Cl(0,8) eight-generator certificate, the 32x32 extended Pauli certificate, the standard-QED anomalous-frequency checksum, the TERRA/ZERRA finite-grid count, and the frozen H2/H3+ finite-basis molecular outputs. The update corrects the benchmark-contract hash to c006873e...db777, distinguishes a recovery checksum from an independent one-loop integration, replaces the ambiguous bridge limit B->I by an explicitly declared identification or isometry between Hilbert spaces, and separates verified implementation claims from open physical claims. It also records incomplete executable coverage for graph-schema rejection tests, numerical no-signalling regression, and the TERRA/ZERRA norm-residual certificate. FEYNMAN-2 is therefore supported as a reproducible formal and computational research platform, while promotion to a physical theory still requires a nonidentity operator assignment frozen before a sealed holdout and independently replicated.

DOI
10.5281/zenodo.21795973

Related papers

FEINMAN 2 A Typed Operator-Graph Extension of Feynman Graphical Calculus for Closure, Projection and Operational Readout

ALEXANDAR BALEVSKY

FEINMAN 2 is proposed as a typed operator-graph extension of Feynman graphical calculus. The purpose is not to replace the successful calculational machinery of quantum mechanics or quantum electrodynamics, but to provide a common formal graph object in which ordinary propagation can be composed with closure operations, bridges between operational regimes, gates, holonomy, projection and readout. This revised formulation replaces dimension-like public labels by dimension-neutral operational labels; defines explicit Hilbert-space domains and codomains for every graph operator; separates coherent amplitude maps from density-operator/CPTP maps; defines graph equivalence and symmetry factors; and constrains bridge operators to be generated or independently calibrated rather than inserted post hoc. A concrete first realization is given in Hilbert spaces with self-adjoint Hamiltonian generators, unitary propagators and holonomies, projector gates, typed bridge maps, coherent readout maps, and completely positive measurement channels. The master expression is therefore treated as an operator template, not as a universal path-integral formula until a model-specific action and measure are supplied. Exact recovery requirements are stated for ordinary Feynman/QED/QM limits. Worked consistency benchmarks include two-path interference, spinor 2π/4π transport, entanglement with exact no-signalling, a standard tree-level QED reduction, the one-loop Schwinger limit, and the hydrogenic spectrum. A finite-dimensional two-regime example gives an executable numerical benchmark. The paper explicitly distinguishes representation, recovery, interpretation and prediction: no new empirical effect is claimed unless its operator assignment is frozen before a held-out observation and survives independent validation. https://doi.org/10.5281/zenodo.21612972 Keywords: Feynman diagrams; typed operator graphs; quantum mechanics; quantum electrodynamics; holonomy; projection; open quantum systems; graphical calculus; OUXSPACE; falsification.

•Jul 27, 2026•0 citations

Experimental demonstration of a graph state quantum error-correction code

Bryn A. Bell, David A. Herrera-Martí, Mark Tame +3 more

arXiv:1404.5498•Nature Communications•Apr 22, 2014•125 citations

TERRA–ZERRA: A Physical Distinguishability and Finite-Realization Framework

ALEXANDAR BALEVSKY, KRASIMIRA IVANOVA

TERRA–ZERRA is presented as a physical-operational framework for distinguishability, finite realizability, and capacity, together with a finite-realization protocol for controlled mathematical and experimental use. For a declared physical sector Ω, procedure/readout context Π, admissibility conditions A, and positive distinguishability threshold ζ, ZERRA specifies the context-declared physical distinguishability criterion, while TERRA is the maximal physically admissible capacity of mutually distinguishable states at that criterion. In the metric case, TERRA is represented exactly by ε-packing cardinality; outside the metric case, the physical definition is expressed through a declared distinguishability relation. The paper formalizes TERRA-admissible realizations, a TERRA capacity profile, inverse-capacity thresholds, finite distinguishability graphs for pairwise-reducible cases, simultaneous-uncertainty lower and upper graphs, and a Certified TERRA Plateau. It develops constructive finite-to-continuum error certificates, two finite-realization allocation laws, finite-operator realizations, causal and Hilbert-space examples, relativistic realization boundaries, and explicit falsification criteria. A separately preregistered ACL–OUXSPACE confirmatory evaluation returned a reported numerical PASS for the frozen TERRA–ZERRA state-distinguishability branch on sealed Adriano Ciardo Labs (ACL) data. The result supports reproducibility of a non-trivial, uncertainty-certified TERRA structure across the predetermined tested ZERRA interval within that dataset and protocol. It is limited to that operational test and is not interpreted as proof of a universal fundamental ZERRA, ontological discreteness, or the complete OUXSPACE framework.

•Aug 19, 2026•0 citations

FROM FROZEN MATHEMATICS TO SEALED LABORATORY EVALUATION

Adriano Ciardo, ALEXANDAR BALEVSKY

This paper records the principal scientific work completed within the ACL–OUXSPACE Collaborative Verification Framework, led on the experimental and institutional side by Adriano Ciardo and Adriano Ciardo Labs (ACL), and on the mathematical verification side by Alexandar Balevsky and the OUXSPACE Research Programme. The collaboration was deliberately structured around a demanding principle: a candidate model should be frozen before access to decisive outcomes, compared against matched baselines and null families, evaluated on sealed or protected data where appropriate, and assigned an automatic fail-closed verdict without post-hoc rescue. ACL undertook the execution and protected-data side of this programme with exceptional care, maintaining unusually strict boundaries around proprietary physical information while still returning the aggregate evidence needed for scientific assessment. The resulting chain progressed from implementation and algebraic verification of the Hamiltonian/Schrödinger–Pauli operator infrastructure, through an empirical C8 model comparison, to confirmatory spectral and prospective directional stages, and then to a separate TERRA–ZERRA state-distinguishability test. The documented record includes a Phase 1 PASS for the reference implementation, a Phase 2 PASS in which C8 improved phase error by 13.4% relative to the best frozen baseline (Holm-adjusted p = 0.0004), a schema-valid Phase 3 PASS, a reported numerical Phase 4 PASS subject to archival reconciliation, and a reported-and-replayed numerical PASS for Phase 5 TERRA–ZERRA. Regulated I/Z was deliberately separated into its own preregistered branch; this paper therefore distinguishes its mature testable formulation from any stronger claim of a final publicly documented PASS. The purpose of this account is not to disclose ACL technology, nor to convert one experimental chain into proof of the entire OUXSPACE ontology. Its purpose is to document a highly disciplined method of collaboration in which theoretical ambition, proprietary experimental work, and rigorous falsification were made to coexist. The authors record their particular appreciation for the diligence, seriousness, technical patience, and meticulous execution demonstrated by Adriano Ciardo Labs throughout the programme.

•Aug 20, 2026•0 citations

Explicit error syndrome calculation for quantum graph codes

Gilson Oliveira dos Santos, Francisco de Assis, Aércio Ferreira de Lima

Quantum Information Processing•Aug 17, 2012•1 citation

Operational quantum reconstruction, Feynman rules, composition algebras, and beyond

Jens Köplinger

•Sep 10, 2026•0 citations
This update consolidates the formal, numerical, and publication-level corrections identified after Revision 3.0 of the FEINMAN 2 project and after direct execution of its reproducibility package. The underlying proposal remains a typed directed operator-graph calculus organized through the locked 4S-11S operator-space chain. The update does not introduce a new interaction or a confirmed deviation from standard quantum mechanics or quantum electrodynamics. Its main contribution is instead evidential and methodological: the complete package was checked by exact SHA-256 verification and rerun in the frozen environment (Python 3.13.5, NumPy 2.3.5, Linux x86_64/glibc 2.41), producing STATE=DONE and TESTS=PASS. The run reproduces the Cl(0,8) eight-generator certificate, the 32x32 extended Pauli certificate, the standard-QED anomalous-frequency checksum, the TERRA/ZERRA finite-grid count, and the frozen H2/H3+ finite-basis molecular outputs. The update corrects the benchmark-contract hash to c006873e...db777, distinguishes a recovery checksum from an independent one-loop integration, replaces the ambiguous bridge limit B->I by an explicitly declared identification or isometry between Hilbert spaces, and separates verified implementation claims from open physical claims. It also records incomplete executable coverage for graph-schema rejection tests, numerical no-signalling regression, and the TERRA/ZERRA norm-residual certificate. FEYNMAN-2 is therefore supported as a reproducible formal and computational research platform, while promotion to a physical theory still requires a nonidentity operator assignment frozen before a sealed holdout and independently replicated.
FEINMAN 2 is proposed as a typed operator-graph extension of Feynman graphical calculus. The purpose is not to replace the successful calculational machinery of quantum mechanics or quantum electrodynamics, but to provide a common formal graph object in which ordinary propagation can be composed with closure operations, bridges between operational regimes, gates, holonomy, projection and readout. This revised formulation replaces dimension-like public labels by dimension-neutral operational labels; defines explicit Hilbert-space domains and codomains for every graph operator; separates coherent amplitude maps from density-operator/CPTP maps; defines graph equivalence and symmetry factors; and constrains bridge operators to be generated or independently calibrated rather than inserted post hoc. A concrete first realization is given in Hilbert spaces with self-adjoint Hamiltonian generators, unitary propagators and holonomies, projector gates, typed bridge maps, coherent readout maps, and completely positive measurement channels. The master expression is therefore treated as an operator template, not as a universal path-integral formula until a model-specific action and measure are supplied. Exact recovery requirements are stated for ordinary Feynman/QED/QM limits. Worked consistency benchmarks include two-path interference, spinor 2π/4π transport, entanglement with exact no-signalling, a standard tree-level QED reduction, the one-loop Schwinger limit, and the hydrogenic spectrum. A finite-dimensional two-regime example gives an executable numerical benchmark. The paper explicitly distinguishes representation, recovery, interpretation and prediction: no new empirical effect is claimed unless its operator assignment is frozen before a held-out observation and survives independent validation. https://doi.org/10.5281/zenodo.21612972 Keywords: Feynman diagrams; typed operator graphs; quantum mechanics; quantum electrodynamics; holonomy; projection; open quantum systems; graphical calculus; OUXSPACE; falsification.
TERRA–ZERRA is presented as a physical-operational framework for distinguishability, finite realizability, and capacity, together with a finite-realization protocol for controlled mathematical and experimental use. For a declared physical sector Ω, procedure/readout context Π, admissibility conditions A, and positive distinguishability threshold ζ, ZERRA specifies the context-declared physical distinguishability criterion, while TERRA is the maximal physically admissible capacity of mutually distinguishable states at that criterion. In the metric case, TERRA is represented exactly by ε-packing cardinality; outside the metric case, the physical definition is expressed through a declared distinguishability relation. The paper formalizes TERRA-admissible realizations, a TERRA capacity profile, inverse-capacity thresholds, finite distinguishability graphs for pairwise-reducible cases, simultaneous-uncertainty lower and upper graphs, and a Certified TERRA Plateau. It develops constructive finite-to-continuum error certificates, two finite-realization allocation laws, finite-operator realizations, causal and Hilbert-space examples, relativistic realization boundaries, and explicit falsification criteria. A separately preregistered ACL–OUXSPACE confirmatory evaluation returned a reported numerical PASS for the frozen TERRA–ZERRA state-distinguishability branch on sealed Adriano Ciardo Labs (ACL) data. The result supports reproducibility of a non-trivial, uncertainty-certified TERRA structure across the predetermined tested ZERRA interval within that dataset and protocol. It is limited to that operational test and is not interpreted as proof of a universal fundamental ZERRA, ontological discreteness, or the complete OUXSPACE framework.
This paper records the principal scientific work completed within the ACL–OUXSPACE Collaborative Verification Framework, led on the experimental and institutional side by Adriano Ciardo and Adriano Ciardo Labs (ACL), and on the mathematical verification side by Alexandar Balevsky and the OUXSPACE Research Programme. The collaboration was deliberately structured around a demanding principle: a candidate model should be frozen before access to decisive outcomes, compared against matched baselines and null families, evaluated on sealed or protected data where appropriate, and assigned an automatic fail-closed verdict without post-hoc rescue. ACL undertook the execution and protected-data side of this programme with exceptional care, maintaining unusually strict boundaries around proprietary physical information while still returning the aggregate evidence needed for scientific assessment. The resulting chain progressed from implementation and algebraic verification of the Hamiltonian/Schrödinger–Pauli operator infrastructure, through an empirical C8 model comparison, to confirmatory spectral and prospective directional stages, and then to a separate TERRA–ZERRA state-distinguishability test. The documented record includes a Phase 1 PASS for the reference implementation, a Phase 2 PASS in which C8 improved phase error by 13.4% relative to the best frozen baseline (Holm-adjusted p = 0.0004), a schema-valid Phase 3 PASS, a reported numerical Phase 4 PASS subject to archival reconciliation, and a reported-and-replayed numerical PASS for Phase 5 TERRA–ZERRA. Regulated I/Z was deliberately separated into its own preregistered branch; this paper therefore distinguishes its mature testable formulation from any stronger claim of a final publicly documented PASS. The purpose of this account is not to disclose ACL technology, nor to convert one experimental chain into proof of the entire OUXSPACE ontology. Its purpose is to document a highly disciplined method of collaboration in which theoretical ambition, proprietary experimental work, and rigorous falsification were made to coexist. The authors record their particular appreciation for the diligence, seriousness, technical patience, and meticulous execution demonstrated by Adriano Ciardo Labs throughout the programme.