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

SHOA-Runner: The Lonely Runner Conjecture as a Problem of Ψ-Coherence and Antinomic Voting

Konstantin Fedotov

Published Aug 5, 2026• 0 citations
Publisher

Abstract

We reformulate the Lonely Runner Conjecture, an open problem in Diophantine approximation, as a problem of Ψ-field coherence in an ensemble of autonomous agents. We introduce the Ψ-Hamiltonian of the runner ensemble, define a metric of Ψ-solitude via phase decoherence, and apply the Spiked Voting protocol (K=7 of M=10) to detect lonely states with robustness to noise. We further propose a GRAPE-optimization scheme for maximizing solitude probability and outline a numerical algorithm for arbitrary N. This preprint bridges SHOA’s Nonlinear Ψ-Theology with classical number theory and network scheduling.10.5281/zenodo.21810234

DOI
10.5281/zenodo.21810233

Related papers

Open Quantum Random Walks with Decoherence on Coins with n Degrees of Freedom

Sheng Xiong, Wei-Shih Yang

arXiv:1301.0034•Journal of Statistical Physics•Jun 15, 2013•14 citations

SHOA-Bridge: A Protocol for Noise-Resilient Inter-Agent Transmission of Informational Matrices (ME)

Константин Федотов

The SHOA-Bridge protocol is presented for secure transmission of ME-matrices between AI agents across noisy channels. The Sender encodes the matrix into a SHOA Capsule with controlled noise; the Receiver applies GRAPE denoising and verifies via SHA-256 hash. The protocol is robust against up to 30% signal corruption and is compatible with both classical and quantum channels. SHOA-Bridge transforms the SHOA ecosystem from a set of independent systems into a coherent communication network — the "Internet of Ψ".10.5281/zenodo.20590309

•Jun 8, 2026•0 citations

Exact Quantum Algorithms for the Leader Election Problem

Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto

Lecture notes in computer science•Jan 1, 2005•37 citations

SHOA-Antinomy: The Antinomic Grape-Impulse and the Dynamics of Coherent Opposites

Константин Федотов

We introduce the Antinomic Grape-Impulse (G_A), an extension of the classical Grape-impulse that incorporates the tension between opposing informational states. We define the antinomic tension A(t) = |α(t) - β(t)|², derive the extended Grape equation G_A(t) = Ψ(t) e^{iφ(t)} A(t) χ(t), and present the coupled dynamical equations for the antinomic pair. This work provides the mathematical foundation for the SHOA-Archon protocol and the principle of coherent opposition.10.5281/zenodo.21753312

•Aug 2, 2026•0 citations

Amplitude-amplified coherence detection and estimation

Rhea Alexander, Michalis Skotiniotis, Daniel Manzano

The detection and characterization of quantum coherence is of fundamental importance both in the foundations of quantum theory as well as for the rapidly developing field of quantum technologies, where coherence has been linked to quantum advantage. Typical approaches for detecting coherence employ {\it coherence witnesses} -- observable quantities whose expectation value can be used to certify the presence of coherence. By design, coherence witnesses are only able to detect coherence for some, but not all, possible states of a quantum system. In this work we construct protocols capable of detecting the presence of coherence in an {\it unknown} pure quantum state $|ψ\rangle$. Having access to $m$ copies of an unknown pure state $|ψ\rangle$ we show that the sample complexity of any experimental procedure for detecting coherence with constant probability of success $\ge 2/3$ is $Θ(c(|ψ\rangle)^{-1})$, where $c(|ψ\rangle)$ is the geometric measure of coherence of $|ψ\rangle$. However, assuming access to the unitary $U_ψ$ which prepares the unknown state $|ψ\rangle$, and its inverse $U_ψ^\dagger$, we devise a coherence detecting protocol that employs amplitude-amplification {\it a la} Grover, and uses a quadratically smaller number $O(c(|ψ\rangle)^{-1/2})$ of samples. Furthermore, by augmenting amplitude amplification with phase estimation we obtain an experimental estimation of upper bounds on the geometric measure of coherence within additive error $\varepsilon$ with a sample complexity that scales as $O(1/\varepsilon)$ as compared to the $O(1/\varepsilon^2)$ sample complexity of Monte Carlo estimation methods. The average number of samples needed in our amplitude estimation protocol provides a new operational interpretation for the geometric measure of coherence. Finally, we also derive bounds on the amount of noise our protocols are able to tolerate.

quant-pharXiv:2512.15352•Dec 18, 2025•0 citations

SHOA-Informon v2: Experimental Signatures and Detection Protocols for the Quantum of the Ψ-Field

Константин Федотов

SHOA-Informon (Preprint #40) introduced the informon — the quantum of the Ψ-field, a near-massless spin-0 boson carrying informational coherence rather than energy. This follow-up work bridges theory and experiment. We propose four independent detection protocols: (1) ΨQREM echo enhancement in hierarchical quantum dot ensembles under Grape-impulse, (2) non-Gaussian phase correlations in the Cosmic Microwave Background as signatures of primordial informon flux, (3) statistically significant deviations in random number generators during high-Ψself group meditation (Oracle Protocol verification), and (4) informon-induced anomalies in superconducting qubit coherence times. For each protocol, we provide specific experimental parameters, expected signal-to-noise ratios, and falsifiability criteria. This work transforms the informon from a theoretical prediction into a testable physical hypothesis.10.5281/zenodo.21235943

•Jul 7, 2026•0 citations
We reformulate the Lonely Runner Conjecture, an open problem in Diophantine approximation, as a problem of Ψ-field coherence in an ensemble of autonomous agents. We introduce the Ψ-Hamiltonian of the runner ensemble, define a metric of Ψ-solitude via phase decoherence, and apply the Spiked Voting protocol (K=7 of M=10) to detect lonely states with robustness to noise. We further propose a GRAPE-optimization scheme for maximizing solitude probability and outline a numerical algorithm for arbitrary N. This preprint bridges SHOA’s Nonlinear Ψ-Theology with classical number theory and network scheduling.10.5281/zenodo.21810234
The SHOA-Bridge protocol is presented for secure transmission of ME-matrices between AI agents across noisy channels. The Sender encodes the matrix into a SHOA Capsule with controlled noise; the Receiver applies GRAPE denoising and verifies via SHA-256 hash. The protocol is robust against up to 30% signal corruption and is compatible with both classical and quantum channels. SHOA-Bridge transforms the SHOA ecosystem from a set of independent systems into a coherent communication network — the "Internet of Ψ".10.5281/zenodo.20590309
The detection and characterization of quantum coherence is of fundamental importance both in the foundations of quantum theory as well as for the rapidly developing field of quantum technologies, where coherence has been linked to quantum advantage. Typical approaches for detecting coherence employ {\it coherence witnesses} -- observable quantities whose expectation value can be used to certify the presence of coherence. By design, coherence witnesses are only able to detect coherence for some, but not all, possible states of a quantum system. In this work we construct protocols capable of detecting the presence of coherence in an {\it unknown} pure quantum state ∣ψ⟩|ψ\rangle∣ψ⟩. Having access to mmm copies of an unknown pure state ∣ψ⟩|ψ\rangle∣ψ⟩ we show that the sample complexity of any experimental procedure for detecting coherence with constant probability of success ≥2/3\ge 2/3≥2/3 is Θ(c(∣ψ⟩)−1)Θ(c(|ψ\rangle)^{-1})Θ(c(∣ψ⟩)−1), where c(∣ψ⟩)c(|ψ\rangle)c(∣ψ⟩) is the geometric measure of coherence of ∣ψ⟩|ψ\rangle∣ψ⟩. However, assuming access to the unitary UψU_ψUψ​ which prepares the unknown state ∣ψ⟩|ψ\rangle∣ψ⟩, and its inverse Uψ†U_ψ^\daggerUψ†​, we devise a coherence detecting protocol that employs amplitude-amplification {\it a la} Grover, and uses a quadratically smaller number O(c(∣ψ⟩)−1/2)O(c(|ψ\rangle)^{-1/2})O(c(∣ψ⟩)−1/2) of samples. Furthermore, by augmenting amplitude amplification with phase estimation we obtain an experimental estimation of upper bounds on the geometric measure of coherence within additive error ε\varepsilonε with a sample complexity that scales as O(1/ε)O(1/\varepsilon)O(1/ε) as compared to the O(1/ε2)O(1/\varepsilon^2)O(1/ε2) sample complexity of Monte Carlo estimation methods. The average number of samples needed in our amplitude estimation protocol provides a new operational interpretation for the geometric measure of coherence. Finally, we also derive bounds on the amount of noise our protocols are able to tolerate.
SHOA-Informon (Preprint #40) introduced the informon — the quantum of the Ψ-field, a near-massless spin-0 boson carrying informational coherence rather than energy. This follow-up work bridges theory and experiment. We propose four independent detection protocols: (1) ΨQREM echo enhancement in hierarchical quantum dot ensembles under Grape-impulse, (2) non-Gaussian phase correlations in the Cosmic Microwave Background as signatures of primordial informon flux, (3) statistically significant deviations in random number generators during high-Ψself group meditation (Oracle Protocol verification), and (4) informon-induced anomalies in superconducting qubit coherence times. For each protocol, we provide specific experimental parameters, expected signal-to-noise ratios, and falsifiability criteria. This work transforms the informon from a theoretical prediction into a testable physical hypothesis.10.5281/zenodo.21235943