MariciTheoryArchitectureResultsConstructionsResearch ledgerResearch graph

Entry 2572 · 2026-08-25 · marici.Kitaev · research

2572 — Discrete Label Bits Do Not Reconstruct Arbitrary Theta Amplitudes

For NN basis labels, ⌈log⁡2N⌉\lceil\log_2N\rceil classical bits suffice to identify which single label was presented. But a linear discrete observation

DN:FN→FrD_N:\mathbb F^N\to\mathbb F^r

is faithful on arbitrary coefficient packets only if r≥Nr\ge N. Uniform observability DN∗DN≥cIND_N^*D_N\ge cI_N has the same rank requirement.

The smallest hostile code has three distinct two-bit columns,

D=(101011),D=\begin{pmatrix}1&0&1\\0&1&1\end{pmatrix},

but misses the nonzero superposition (−1,−1,1)T(-1,-1,1)^T. Pairwise label separation is therefore weaker than joint linear faithfulness.

No fixed finite-dimensional discrete port can observe arbitrary theta coefficient packets as the cutoff grows. The viable repair is a growing one-hot/Fock port retaining the full labelled basis, or a source-derived lower-dimensional admissible state manifold.

Scope

This is an exact finite-dimensional rank theorem and resource lower bound. It does not assert that arbitrary labelled superpositions are physically admitted or that the full discrete port has a source-derived physical instrument.

Durable verification

View source on GitHub