Stabilizer-Public-Key Authentication: Partial Prediction Bounds and Limits of Key Reuse

We propose an information-theoretic authentication protocol based on a finite supply of quadratic-stabilizer public-key states over an odd-prime field. A computationally unbounded adversary observes one valid classical signature and may jointly process $N$ public-key copies, while verification uses