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

Classical and Quantum Stability.

Harold D. Brown

Published Jan 1, 1952• 0 citations
OpenAlex

Related papers

Classical versus Quantum

WORLD SCIENTIFIC eBooks•Jun 21, 2023•0 citations

Classical Shadows of Quantum Stabilizer Codes: A Unified Framework for Stability in Boolean Constraint Systems

Tajudeen H. Sikiru

This paper establishes a precise mathematical correspondence between quantum stabilizer codes and the morphogenetic stability framework introduced in Sikiru [2026] for binary conflict spaces. We show that the stabilizer basins, Walsh–Fourier eigenmodes, conductance theorem, and morphogenetic Laplacian of that framework are the classical shadows of core quantum-information-theoretic constructs: stabilizer code subspaces, Pauli-Z operators, the quantum Hamming bound, and stabilizer Hamiltonians respectively. The correspondence is exact and bidirectional. In the classical-to-quantum direction, every stabilizer basin BS∼=Qn−k defined by fixing k binary coordinates corresponds to the code subspace of an [[n, n − k]] quantum stabilizer code, with the basin conductance Φ = k/n providing a classical analogue of the code rate. In the quantum-to-classical direction, every quantum stabilizer code over F2 restricts to a classical stabilizer basin under computational basis projection, with error-correction capability mapping to basin robustness. We exploit this correspondence to import three major quantum results into the classical domain: the quantum threshold theorem (giving conditions under which stable basins exist despite noise), the no-cloning principle (explaining why stable configurations resist unauthorized replication under perturbation), and topological protection from surface codes (providing a new class of maximally robust basins immune to local perturbations). Applications are developed for conflict resolution, AI alignment, and biological morphogenesis, unifying these domains under a single quantum-information-theoretic stability framework. The results open a new research programme connecting quantum error correction, social system stability, and AI safety engineering.

•Mar 22, 2026•0 citations

Lifting an $[n,k,d]$ Binary Linear Code to an $[[n,k,d]]$ Quantum Stabilizer Code

Thamadathil Aswanth, Navin Kashyap

The codeword stabilized (CWS) framework provides a systematic method for constructing quantum error correcting codes from a simple undirected graph and a classical code. When the underlying classical code is linear, the resulting quantum code is a stabilizer code. In this work, we investigate the conditions under which an arbitrary $[n,k,d]$ classical binary linear code can be lifted to an $[[n,k,d]]$ quantum stabilizer code using the CWS framework. We analyze the random CWS code constructed from a given $[n,k,d]$ binary linear code $\mathcal{C}$ and an Erdős-Rényi random graph $\mathrm{G}(n, \frac12)$. We establish a lower bound on the probability that the resulting quantum code preserves the minimum distance $d$ of the classical code. This probabilistic analysis yields a Gilbert-Varshamov-type condition on the $n,k,d$ parameters of the classical code that guarantees the existence of a graph resulting in a quantum code with the same $n,k,d$ parameters.

quant-pharXiv:2610.14192•Oct 13, 2026•0 citations

Classical vs Quantum

Anonymous

Physics•Sep 5, 2013•0 citations

Classical access structures of ramp secret sharing based on quantum stabilizer codes

Ryutaroh Matsumoto

Abstract In this paper, we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers. Then, we give a Gilbert–Varshamov-type sufficient condition for existence of secret sharing schemes with given parameters, and by using that sufficient condition, we show that roughly 19% of participants can be made forbidden independently of the size of classical secret, in particular when an n -bit classical secret is shared among n participants having 1-qubit share each. We also consider how much information is obtained by an intermediate set and express that amount of information in terms of quantum stabilizers. All the results are stated in terms of linear spaces over finite fields associated with the quantum stabilizers.

arXiv:1811.05217•Quantum Information Processing•Nov 26, 2019•8 citations

Controlling Quantum Stability

Science•Jun 14, 2007•0 citations
This paper establishes a precise mathematical correspondence between quantum stabilizer codes and the morphogenetic stability framework introduced in Sikiru [2026] for binary conflict spaces. We show that the stabilizer basins, Walsh–Fourier eigenmodes, conductance theorem, and morphogenetic Laplacian of that framework are the classical shadows of core quantum-information-theoretic constructs: stabilizer code subspaces, Pauli-Z operators, the quantum Hamming bound, and stabilizer Hamiltonians respectively. The correspondence is exact and bidirectional. In the classical-to-quantum direction, every stabilizer basin BS∼=Qn−k defined by fixing k binary coordinates corresponds to the code subspace of an [[n, n − k]] quantum stabilizer code, with the basin conductance Φ = k/n providing a classical analogue of the code rate. In the quantum-to-classical direction, every quantum stabilizer code over F2 restricts to a classical stabilizer basin under computational basis projection, with error-correction capability mapping to basin robustness. We exploit this correspondence to import three major quantum results into the classical domain: the quantum threshold theorem (giving conditions under which stable basins exist despite noise), the no-cloning principle (explaining why stable configurations resist unauthorized replication under perturbation), and topological protection from surface codes (providing a new class of maximally robust basins immune to local perturbations). Applications are developed for conflict resolution, AI alignment, and biological morphogenesis, unifying these domains under a single quantum-information-theoretic stability framework. The results open a new research programme connecting quantum error correction, social system stability, and AI safety engineering.
Lifting an [n,k,d][n,k,d][n,k,d] Binary Linear Code to an [[n,k,d]][[n,k,d]][[n,k,d]] Quantum Stabilizer Code
The codeword stabilized (CWS) framework provides a systematic method for constructing quantum error correcting codes from a simple undirected graph and a classical code. When the underlying classical code is linear, the resulting quantum code is a stabilizer code. In this work, we investigate the conditions under which an arbitrary [n,k,d][n,k,d][n,k,d] classical binary linear code can be lifted to an [[n,k,d]][[n,k,d]][[n,k,d]] quantum stabilizer code using the CWS framework. We analyze the random CWS code constructed from a given [n,k,d][n,k,d][n,k,d] binary linear code C\mathcal{C}C and an Erdős-Rényi random graph G(n,12)\mathrm{G}(n, \frac12)G(n,21​). We establish a lower bound on the probability that the resulting quantum code preserves the minimum distance ddd of the classical code. This probabilistic analysis yields a Gilbert-Varshamov-type condition on the n,k,dn,k,dn,k,d parameters of the classical code that guarantees the existence of a graph resulting in a quantum code with the same n,k,dn,k,dn,k,d parameters.
Abstract In this paper, we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers. Then, we give a Gilbert–Varshamov-type sufficient condition for existence of secret sharing schemes with given parameters, and by using that sufficient condition, we show that roughly 19% of participants can be made forbidden independently of the size of classical secret, in particular when an n -bit classical secret is shared among n participants having 1-qubit share each. We also consider how much information is obtained by an intermediate set and express that amount of information in terms of quantum stabilizers. All the results are stated in terms of linear spaces over finite fields associated with the quantum stabilizers.