Strongest type-2 constant conjecture for operator-space tensor products

About 5 years old · traced to

Let nn, kk, and k~′\tilde k' be the parameters in the construction, let S1k~′ ⁣,n\mathcal{S}_1^{\tilde k'\!, n} denote the corresponding trace-class space, let ⊗(ε,π)1/2\otimes_{(\varepsilon,\pi)_{1/2}} and ⊗ε\otimes_\varepsilon be the tensor norms used in the paper, and let ℓ2kk~′\ell_2^{k\tilde k'} be Euclidean space. For a Banach space XX, write T2(m)(X)\mathrm{T}_2^{(m)}(X) for its type-2 constant restricted to mm vectors, and write ≲log⁡\lesssim_{\log} for the paper's logarithmic comparison. Strongest-form conjecture.

T2(n2)((S1k~′ ⁣,n⊗(ε,π)1/2S1k~′ ⁣,n)⊗εℓ2kk~′)≲log⁡T2(n2)(S1k~′ ⁣,n⊗(ε,π)1/2S1k~′ ⁣,n)≲log⁡n3/4.\mathrm{T}_2^{(n^2)}\left(\left(\mathcal{S}_1^{\tilde k'\!, n}\otimes_{(\varepsilon,\pi)_{1/2}}\mathcal{S}_1^{\tilde k'\!, n}\right)\otimes_\varepsilon\ell_2^{k\tilde k'}\right)\lesssim_{\log}\mathrm{T}_2^{(n^2)}\left(\mathcal{S}_1^{\tilde k'\!, n}\otimes_{(\varepsilon,\pi)_{1/2}}\mathcal{S}_1^{\tilde k'\!, n}\right)\lesssim_{\log}n^{3/4}.

This estimate would provide the type-2 bound needed for the paper's unconditional exponential lower bounds on resources in position-based cryptography attacks. The source presents it as a conjectural strengthening; no resolution is supplied.

References

Primary source

Marius Junge, Aleksander M. Kubicki, Carlos Palazuelos and David Pérez-García, “Geometry of Banach spaces: a new route towards Position Based Cryptography”, arXiv:2103.16357 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.