Combinatorial Framework for Topological Quantum Computing

Mauro Carfora B, Annalisa Marzuoli

Dmitry Evdokimchik

This paper investigates the fundamental limits of computability at the intersection of classical complexity theory, physics, and distributed artificial intelligence. The Cook–Levin paradigm for deterministic Turing machines and the principles of quantum-topological data protection are considered as the baseline. The impact of the physical factors of real information media on optimization processes is explored. It is demonstrated that the topological features of combinatorial landscapes impose insurmountable constraints on deterministic algorithms. It is established that employing alternative dynamic search frameworks leads to an inversion of the classical complexity relationship between search and verification. The obtained results mathematically substantiate the computational asymmetry critical for cryptographic security.

Chuck Easttom

Roman B. Breslav, G. N. Parfionov, Romàn R. Zapatrin

An idealised experiment estimating the spacetime topology is considered in both classical and quantum frameworks. The latter is described in terms of histories approach to quantum theory. A procedure creating combinatorial models of topology is suggested. The correspondence between these models and discretised spacetime models is established.

Hugo de GARIS

G. N. Parfionov, Romàn R. Zapatrin

An idealized experiment estimating the spacetime topology is considered in both classical and quantum frameworks. The latter is described in terms of histories approach to quantum theory. A procedure creating combinatorial models of topology is suggested. The correspondence between these models and discretized spacetime models is established.