Sidon Sets, Additive Energy, and the Optimal Cloning of Finite Phase-State Codebooks
M. Weldon
Phase states |ψ_x⟩ = d^(−1/2) Σ_j ω^(x k_j) |j⟩, indexed by x ∈ Z_q and a key set K = {k_1,…,k_d} ⊂ Z_q, are the state family behind quantum fingerprinting and quantum hashing. We ask how well an adversary holding T copies of |ψ_x⟩ can produce T+k copies, and when a finite codebook is exactly as hard to clone as the continuous family of all phase states (the torus), whose optimal cloning fidelity was recently determined. The answer is governed by additive combinatorics of K. (i) The optimal 1→2 global cloning fidelity equals (2d−1)/d² if and only if K is a Sidon set. (ii) A B_{T+k} key set attains the torus optimum: analytically for d = 2 (all T) and for T = 1 (all d, k), and for T = 2, 3 (all d, k) by a proof whose finitely many computational steps are verified by standalone exact and interval-arithmetic checkers; we conjecture it for all T. (iii) For T = 1 we characterise exactly, for every k, the key sets that attain the torus optimum; the B_{1+k} condition is sufficient but not necessary. (iv) The optimal fidelity of fusing m phase states into the state of their sum equals E_m(K)/d^(m+1), where E_m is the higher additive energy; Sidon sets minimise it for every m. Small Fourier bias, the standard design criterion for quantum hashing, does not control cloning. For finite orbits of non-abelian groups we prove a window theorem giving a dual-feasibility criterion, an obstruction, and a representation-theoretic selection rule for when matching the (T+k)-th moment suffices, and we give certified counterexamples for SU(3) and SU(2) showing that moment matching alone does not. Changes in v2: new exact characterisation at T = 1 for every k (Section 5.4), including key sets that attain the torus value without being B_{T+k}; new m-fold fusion theorem with higher additive energy (Theorem 28); abstract and introduction updated accordingly. All v1 results are unchanged. Files: the paper (PDF) and its LaTeX source; ca_appendix.zip, the computer-assisted certificates with standalone exact/interval/ball-arithmetic checkers (unchanged from v1); coverage_check.py, the region-coverage audit (unchanged); qh-lab-v1.1.0.zip, an independent re-implementation with 49 tests (MIT licence). SHA256SUMS.txt lists the SHA-256 hashes of all files.
•Oct 16, 2026•2 citations