Optical Switch Protocol Verifies Entangled Quantum States in Real-Time without Destroying Them

William J. Richardson

Published Mar 13, 2026• 0 citations

Abstract

Critical — This article, Optical Switch Protocol Verifies Entangled Quantum States in Real-Time without Destroying Them, turns a real-time sampled-certification source into a much stronger operation-first program by fixing the exact blocking failure the source leaves open: sample economy alone does not establish measurement-compatible use. The paper raises the bar by separating gentle contact from terminal readout, adding containment at R≈1, requiring declared placement, enforcing recognition-versus-enforcement separation through SEB/MAP/SEBMAP, preserving indexed zeros through STLF, and making final acceptance answer to typed-zero and no-backflow discipline rather than to a favorable statistical story. That is why this lands as Critical rather than merely Significant: it does not just add another structure around the source result, it fixes the missing operating layer that stands between “some copies survive because they were untouched” and “a branch can be weakly contacted, held, released, and certified without narrative repair.”

DOI: 10.5281/zenodo.19010563

Related papers

Experimental quantum state certification by actively sampling photonic entangled states

Michael Antesberger, Mariana M. E. Schmid, Huan Cao +3 more

Entangled quantum states are essential ingredients for many quantum technologies, but they must be validated before they are used. As a full characterization is prohibitively resource intensive, recent work has focused on developing methods to efficiently extract a few parameters of interest, in a so-called verification framework. Most existing approaches are based on preparing an ensemble of nominally identical and independently distributed (IID) quantum states and then measuring each copy of the ensemble. However, this leaves no states left for the intended quantum tasks and the IID assumptions do not always hold experimentally. To overcome these challenges, we experimentally implement quantum state certification (QSC), which measures only a subset of the ensemble, certifying the fidelity of multiple copies of the remaining states. We use active optical switches to randomly sample from sources of two-photon Bell states and three-photon GHZ (Greenberger-Horn-Zeilinger) states, reporting statistically sound fidelities in real time without destroying the entire ensemble. In addition, our QSC protocol removes the assumption that the states are identically distributed (but still assumes independent copies); can achieve close N −1 scaling, in the number of states measured N ; and can be implemented in a device-independent manner. Together, these benefits make our QSC protocol suitable for benchmarking large-scale quantum computing devices and deployed quantum communication setups relying on entanglement in both standard and adversarial situations.

arXiv:2407.13913Science AdvancesFeb 11, 20260 citations

Entanglement-Preserving Photonic Switching: Demonstration of Full Cross-Bar Operation with 25-GHz Capability

Neal N. Oza, Yu‐Ping Huang, Prem Kumar

We present an all-optical, fiber-based quantum switch that operates at high speeds with low loss and—most importantly—retains the incident photons’ quantum state, thereby making it useful for applications in quantum communications.

Optical Fiber Communication ConferenceJan 1, 20130 citations

Prethermal Plateau Unification: Pad Geometry Plus MAP Translation

William J. Richardson

This critical manuscript addresses a persistent failure mode in prethermal plateau and stability claims: the gap between demonstrating a long-lived dynamical regime and certifying that the regime is usable under fixed, replayable rules. Recent platform results show that structured random driving can suppress heating and extend prethermal lifetimes on many-qubit processors. While these results establish physical existence and controllable lifetime, they do not by themselves certify operational utility or guard against boundary narrative repair. This manuscript extends the earlier pad and triad-of-triads program by applying MAP as a unifying translation layer to prethermal plateau claims. Prior work established the signed-triad ledger, Strong-to-Weak downgrades, STLF refusal discipline, and tokens-only replay as independent enforcement tools. Here, those tools are bound together by MAP and explicitly externalized from the engine, allowing plateau lifetime claims to be evaluated as contract objects rather than as narrative curves. The result is a carry-forward certification spine that preserves earlier triad logic while adding a thermodynamic interpretation of acceptance leakage and a regime-transition marker (ZFlip) suitable for plateau-style datasets. The central contribution of this work is Mapping and Amplification Protocol (MAP), a pad-centered translation layer that externalizes certification logic from the engine and forces enforcement tools to act coherently under a shared coordinate meaning. MAP is not a new physical mechanism and not an optimizer. It is a deterministic translator from tokens to enforcement actions that binds Strong-to-Weak, STLF, Knob, and Sum-of-Zeros to the same declared pad and corridor. By doing so, MAP removes silent degrees of freedom that otherwise allow filtering, tightening, or drift to masquerade as stability. Under MAP, plateau behavior is no longer evaluated by a single flat curve or preferred projection. Instead, claims are promoted, downgraded, or refused through a triad-of-triads contract that separates signed state, windowed pattern fingerprints, and meta-promotion logic. Two independent redundancy cages (view square and ladder square) are enforced via double Four-Solves-Three auditing, blocking majority narratives and forcing disagreement to remain visible. Acceptance recovery is explicitly bounded: any recovered utility must be paid for through declared downgrades rather than repaired into Strong. Within this framework, the manuscript introduces a contract-level thermodynamic separation: what platform studies describe as “heating” is treated here as acceptance leakage in time under a fixed corridor. The quantity TzTzTz is operationalized as a burn-rate proxy that tracks how quickly tension is consumed as trajectories approach refusal, while ZFlipZFlipZFlip marks the first persistent regime transition where the effective plateau description fails. Plateau lifetime is therefore treated as necessary but not sufficient; the resource question is whether the plateau survives under fixed accounting until the flip. The intended outcome is a reusable, platform-independent certification object. MAP and the surrounding contract infrastructure are designed to carry forward across qubit, magnonic, photonic, and hybrid platforms, allowing future plateau datasets to be evaluated without modifying the rule spine. The result is not a critique of platform physics, but a durable method for turning plateau observations into bounded, replayable, and falsifiable objects of record.

Jan 31, 20260 citations

Certifying 91-Qubit Floquet Chaos Under A Fixed Tensor Corridor: Mitigation As Enforcement

William J. Richardson

Significant — This manuscript certifies a 91-qubit Floquet chaos verification claim under a fixed tensor corridor by converting dual-unitary admissibility, tensor-network baseline comparison, and mitigation workflows into declared corridor objects with tokens-only replay. The contract enforces MAP0–SEB–MAP1 separation so recognition cannot be repaired by enforcement, prohibits backflow authority, and treats mitigation as an explicit tightening ladder rather than as postprocessing convenience. A signed-triad record with zeros-stay-zeros discipline carries the primary sign record across tightening steps; flip-only audits and mitigation-disable (disable-L) falsifiers test anchor drift and translator dependence; strong-to-weak grading preserves value when survival fails without inflating the claim. Two ceilings bound what is certifiable (not what is physically chaotic): SoZ constrains yield/missingness under tightening, and an R≈1 containment ratio constrains instability growth versus declared budget. The output is a replayable branch-map decision record—promote, downgrade, refuse, or hold—with reason tokens, replay-kit fields, and falsifier-first logic suitable for bench transfer without moving thresholds.

Feb 14, 20260 citations

Quantifying the strength of optical communication devices using entanglement measures

Nathan Killoran, Norbert Lütkenhaus

The quantum nature of an optical device can be verified using benchmarks based on entanglement verification. Without requiring additional resources, we show how to rigourously extend such benchmarks to quantify how well devices preserve entanglement.

International Conference on Quantum InformationJan 1, 20110 citations

Quantum Read-Through Measurement

William J. Richardson

Critical — Quantum Read-Through Measurement. This article defines a transitional read-through measurement architecture in which midpoint M samples an A-to-B route without becoming the endpoint measurement authority. M is treated as a read-only witness surface: it may export a copied witness row, but it may not own the payload, repair the payload, rewrite branch identity, or decide Bob-side truth. The central contribution is the authority separation between witness sampling and endpoint certification. Multi produces raw partial reads, STLF writes the visible sign-or-zero ledger, SEB recognizes the row, and MAP enforces the permitted grade. This prevents a weak or partial read from being promoted by narrative repair. The paper also separates M as a useful stopgap bridge from Pre-Binary Sign Net as the stronger architecture. M can reduce B-side validation burden by catching route-side or A-side failures early, while Pre-Binary moves Sign Net classification to the front end before ordinary binary handling or late qudit-cell validation becomes authoritative. The included synthetic result supports the staged grammar by showing clean separation among Strong, Strong-to-Weak, Weaker, Hold, 0S continuity, and Refuse outcomes under fixed rules.

Jun 12, 20260 citations