REVIEW 6 cited by
Optimality of spherical codes via exact semidefinite programming bounds
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We show that the spectral embeddings of all known triangle-free strongly regular graphs are optimal spherical codes (the new cases are $56$ points in $20$ dimensions, $50$ points in $21$ dimensions, and $77$ points in $21$ dimensions), as are certain mutually unbiased basis arrangements constructed using Kerdock codes in up to $1024$ dimensions (namely, $2^{4k} + 2^{2k+1}$ points in $2^{2k}$ dimensions for $2 \le k \le 5$). As a consequence of the latter, we obtain optimality of the Kerdock binary codes of block length $64$, $256$, and $1024$, as well as uniqueness for block length $64$. We also prove universal optimality for $288$ points on a sphere in $16$ dimensions. To prove these results, we use three-point semidefinite programming bounds, for which only a few sharp cases were known previously. To obtain rigorous results, we develop improved techniques for rounding approximate solutions of semidefinite programs to produce exact optimal solutions.
Forward citations
Cited by 6 Pith papers
-
Robust self-testing with CHSH mod 3
CHSH mod 3 reaches its exact maximal quantum value only with maximally entangled qutrit pairs (unique up to symmetry) and any strategy within ε of the optimum is O(√ε)-close to a direct sum of those optimal strategies.
-
Bounding the density of spherical polygon packings
Putative optimal densities for regular spherical polygon packings are computed via manifold optimization, with maximality established for several instances through an SDP formulation of an extended Lovász theta number...
-
Universal optimality of $T$-avoiding spherical codes and designs
Certain lattice-derived spherical codes are shown to be universally optimal among all T-avoiding codes for suitable forbidden sets T.
-
Pauli Encodings & Unclonable Encryption
Every Pauli Encoding with K keys has MoE winning probability at least 1/2 + 1/(2√K), BB84-style X/Z encodings are insecure, pairwise arguments cannot beat 3/4, and several Pauli families have partial unclonable security.
-
Pauli Encodings & Unclonable Encryption
Introduces Pauli Encodings, proves a universal cloning lower bound 1/2+1/(2*sqrt(K)), a 3/4 obstruction against pairwise-marginal arguments, and a level-3 NPA upper bound approximately 0.5556 for anticommuting keys.
-
Reachability and optimal-time certificates for quantum control
Moment relaxations with time-dependent differential constraints yield upper bounds on fidelities and lower bounds on optimal times for quantum control tasks including qubit gates and excitation transfer.
Discussion (0). Sign in to comment.