Q-NEST: Admissibility Before Propagation in AI and Quantum-Hybrid Systems

Modern engineered systems increasingly act before the full consequence of their actions is bounded. AI agents execute tool calls, digital infrastructure propagates requests, telecom systems absorb recurrence and burst behaviour, and quantum-hybrid systems operate inside narrow timing, coherence, measurement, and control constraints. In each case, the same structural problem appears: action can propagate before admissibility has been determined. This research note presents Q-NEST as a higher-order admissibility research extension of NEST, grounded in the published pre-reactive constraint law for engineered systems operating under uncertainty. NEST is framed as an engineered admissibility-boundary layer with bounded public evidence; Q-NEST is framed as a structured research extension; and any universal NEST or universal phi-law interpretation remains conjectural unless separately proven. The note is intentionally non-implementational. It does not disclose protected engineering methods, enforcement architecture, implementation mechanics, or private proof packages. It defines the admissibility-before-propagation problem, distinguishes NEST from access control, policy engines, gateways, and monitoring, and sets out a controlled path for technical discussion, pilot scoping, and licensing evaluation.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-28
DOI
https://doi.org/10.5281/zenodo.19211558
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Q-NEST: Admissibility Before Propagation in AI and Quantum-Hybrid Systems

Iannis P.R. Charalambous
Zenodo (CERN European Organization for Nuclear Research)
Formal Methods in Verification
article

Q-NEST: Admissibility Before Propagation in AI and Quantum-Hybrid Systems

Iannis P.R. Charalambous
article en

Abstract

Modern engineered systems increasingly act before the full consequence of their actions is bounded. AI agents execute tool calls, digital infrastructure propagates requests, telecom systems absorb recurrence and burst behaviour, and quantum-hybrid systems operate inside narrow timing, coherence, measurement, and control constraints. In each case, the same structural problem appears: action can propagate before admissibility has been determined. This research note presents Q-NEST as a higher-order admissibility research extension of NEST, grounded in the published pre-reactive constraint law for engineered systems operating under uncertainty. NEST is framed as an engineered admissibility-boundary layer with bounded public evidence; Q-NEST is framed as a structured research extension; and any universal NEST or universal phi-law interpretation remains conjectural unless separately proven. The note is intentionally non-implementational. It does not disclose protected engineering methods, enforcement architecture, implementation mechanics, or private proof packages. It defines the admissibility-before-propagation problem, distinguishes NEST from access control, policy engines, gateways, and monitoring, and sets out a controlled path for technical discussion, pilot scoping, and licensing evaluation.

Zenodo (CERN European Organization for Nuclear Research)
Cyprus University of Technology (CY)
Industry, innovation and infrastructure
Openalex Percentile: Top 4%
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.