Optimal coefficient for approximate full-parity hiding

Determine the optimal coefficient relating the decoding score of a three-bit random-access code to the trace distance between its two full-parity averages under approximate full-parity hiding.

Background

The paper constructs a dimension-independent correction that converts an approximately full-parity-private three-bit code into an exactly private code while retaining the original decoding measurements. This yields an upper bound on the decoding score in terms of the trace distance between the even- and odd-parity average states.

Although the bound is linear in that trace distance, the authors do not establish whether its coefficient is optimal. They also explicitly leave the classification of nearly optimal encodings unresolved, but the concrete open problem requested here is the optimal coefficient.

References

This bound requires no commutation assumption on the parity averages and no lower bound on their nonzero eigenvalues. The argument leaves the optimal coefficient of $e$ and the classification of nearly optimal encodings undetermined.

— Exact value and rigidity of the $2\times3$ magic rectangle  (2610.12001 - Essayag et al., 8 Oct 2026) in Section 7, Proposition 7.3 and the paragraph following its proof; also stated in Section 9, Conclusion