Fixed-point constraints on de Finetti hierarchies yield O(√(log n)/n) double-sided rates, block-structured dimension dependence, and poly-time certifiable separable inner approximations for fixed local dimensions.
Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension
1 Pith paper cite this work, alongside 4 external citations. Polarity classification is still indexing.
1
Pith paper citing it
4
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Fixed points in de Finetti hierarchies
Fixed-point constraints on de Finetti hierarchies yield O(√(log n)/n) double-sided rates, block-structured dimension dependence, and poly-time certifiable separable inner approximations for fixed local dimensions.