Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.24542

Comment on "The polarization hierarchy for polynomial optimization over convex bodies, with applications to nonnegative matrix rank"

Julius A. Zeiss

math.OCquant-phSubmitted Oct 17, 2026• Announced Oct 20, 2026
arXivHTMLPDF

Abstract

We revisit the feasibility and convergence claims for the polarization hierarchy of Plávala, Ligthart and Gross [Linear Algebra Appl.\ 723 (2025) 15--32]. Counterexamples show that the stated assumption is insufficient for the feasibility characterization and for convergence of the hierarchy with the polarization constraint. We establish corrected results under a stronger algebraic condition and supply a missing compactness argument.

AI Summary

This comment examines whether the polarization hierarchy for polynomial optimization over compact convex state spaces has the feasibility and convergence properties previously claimed. The issue is whether a polarization constraint $\Pi(M)=0$ forces the positive-semidefinite residual second moment $M=\int f(a,b)\otimes f(a,b)\,d\mu$ to vanish. The stated two-vector assumption does not suffice. A projection onto traceless symmetric $3\times3$ matrices satisfies that assumption but annihilates $I_3$. Simplex constructions then give an infeasible problem whose hierarchy remains feasible at every level, and a feasible optimization problem with $p_n^\Pi=-1$ for every $n\ge2$, although $p^*=0$. The corrected condition is $\ker\Pi\cap\mathrm{PSD}(V)=\{0\}$. It is necessary for a universal feasibility characterization and equivalent to excluding cancellation among $D=\dim V$ positive rank-one terms; $D$ cannot generally be reduced. A semidefinite extreme-point rank bound shows that the original two-vector condition suffices when $\operatorname{rank}(\Pi|_{\mathrm{Sym}^2(V)})\le4$. Under the corrected condition, de Finetti representation establishes feasibility, while diagonal compactness extraction supplies a missing step proving monotone convergence of optimal values. The three polarization maps proposed in the original paper already satisfy the correction; the stronger hierarchy and reported finite-level infeasibility certificates remain valid. No general convergence rate or detection-level bound is obtained, and finite-level exactness or convergence of minimizers is not asserted. An example with $\Pi=\mathrm{id}$ has $p_n=-1/n\to0$, without finite exactness.

Little sign of AI-generated textAI use disclosedIncremental
Generative AI tools supported manuscript preparation, mathematical analysis, and code development.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
25 pages, Comment on https://doi.org/10.1016/j.laa.2025.05.019 (arXiv:2406.09506)

Related papers

The polarization hierarchy for polynomial optimization over convex bodies, with applications to nonnegative matrix rank

Martin Plávala, Laurens T. Ligthart, David Gross

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy , which has previously been introduced for the study of polynomial optimization problems over state spaces of C ⁎ ⁎ -algebras, to convex cones in finite dimensions. If the convex bodies can be characterized by linear or semidefinite programs, then the same is true for our hierarchy. Convergence is proven by relating the problem to a certain de Finetti theorem for general probabilistic theories , which are studied as possible generalizations of quantum mechanics . We apply the method to the problem of nonnegative matrix factorization, and in particular to the nested rectangles problem . A numerical implementation of the third level of the hierarchy is shown to give rise to a very tight approximation for this problem.

arXiv:2406.09506•Linear Algebra and its Applications•May 22, 2025•5 citations

Finite de Finetti for convex bodies and Polynomial Optimization

Julius A. Zeiss, Gereon Koßmann, René Schwonnek +1 more

Leveraging a recently proposed notion of relative entropy in general probabilistic theories (GPT), we prove a finite de Finetti representation theorem for general convex bodies. We apply this result to address a fundamental question in polynomial optimization: the existence of a convergent outer hierarchy for problems with inequality constraints and analytical convergence guarantees. Our strategy generalizes a quantitative monogamy-of-entanglement argument from quantum theory to arbitrary convex bodies, establishing a uniform upper bound on mutual information in multipartite extensions. This leads to a finite de Finetti theorem and, subsequently, a convergent conic hierarchy for a wide class of polynomial optimization problems subject to both equality and inequality constraints. We further provide a constructive rounding scheme that yields certified interior points with controlled approximation error. As an application, we express the optimal GPT value of a two-player non-local game as a polynomial optimization problem, allowing our techniques to produce approximation schemes with finite convergence guarantees.

math.OCCross-listedarXiv:2601.15184•Jan 22, 2026•3 citations

Comment on ‘Two-state Description of Total Polarization by Means of Singular Eigenvalue Problems’

Igor I. Gancheryonok

Journal of Modern Optics•Mar 1, 1993•4 citations

Multi-kernel polar codes: Proof of polarization and error exponents

Meryem Benammar, Valerio Bioglio, Frédéric Gabry +1 more

In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, proving that this construction actually polarizes. To this end, we derive a new and more general proof of polarization, which gives sufficient conditions for kernels to polarize. Finally, we derive the convergence rate of the multi-kernel construction and relate it to the convergence rate of each of the constituent kernels.

arXiv:1709.10371•IEEE Information Theory Workshop (ITW)•Nov 1, 2017•38 citations

A Convergent Inflation Hierarchy for Quantum Causal Structures

Laurens T. Ligthart, Mariami Gachechiladze, David Gross

Abstract A causal structure is a description of the functional dependencies between random variables. A distribution is compatible with a given causal structure if it can be realized by a process respecting these dependencies. Deciding whether a distribution is compatible with a structure is a practically and fundamentally relevant, yet very difficult problem. Only recently has a general class of algorithms been proposed: These so-called inflation techniques associate to any causal structure a hierarchy of increasingly strict compatibility tests, where each test can be formulated as a computationally efficient convex optimization problem. Remarkably, it has been shown that in the classical case, this hierarchy is complete in the sense that each non-compatible distribution will be detected at some level of the hierarchy. An inflation hierarchy has also been formulated for causal structures that allow for the observed classical random variables to arise from measurements on quantum states—however, no proof of completeness of this quantum inflation hierarchy has been supplied. In this paper, we construct a first version of the quantum inflation hierarchy that is provably convergent. It takes an additional parameter, r , which can be interpreted as an upper bound on the Schmidt rank of the observables involved. For each r , it provides a family of increasingly strict and ultimately complete compatibility tests for correlations that are compatible with a given causal structure under this Schmidt rank constraint. From a technical point of view, convergence proofs are built on de Finetti theorems , which show that certain symmetries (which can be imposed in convex optimization problems) imply independence of random variables (which is not directly a convex constraint). A main technical ingredient to our proof is a Quantum de Finetti Theorem that holds for general tensor products of $$C^*$$ C ∗ -algebras, generalizing previous work that was restricted to minimal tensor products.

arXiv:2110.14659•Communications in Mathematical Physics•Jun 9, 2023•27 citations

An exact semidefinite characterization of the stoquasticity cone of permutationally invariant Bell operators

Jan Li, Owidiusz Makuta, Evert van Nieuwenburg +1 more

Bell correlations have been detected in atomic ensembles ranging from hundreds to hundreds of thousands of particles, witnessed by the permutationally invariant (PI) Bell operators. For all the operators realized so far, the maximally violating state can be brought, in a suitable basis, into a nonnegative-amplitude form. In that basis, the Bell operator is stoquastic. The coefficients parametrising these operators that at the same time lead to stoquasticity form a convex cone, the so-called stoquasticity cone. Its characterization had remained open beyond two-body operators, as for many-body operators the number of inequalities grows with the system size $n$. In this work we show that, in the thermodynamic limit, the stoquasticity cone admits an exact semidefinite characterization, valid at any operator order. The key observation is that, along each off-diagonal, the matrix elements are the values of a single univariate polynomial. Being univariate, this condition is equivalent to a linear matrix inequality, with no relaxation hierarchy. Therefore, deciding stoquasticity becomes a single semidefinite feasibility problem. As its lowest-degree instances, this description recovers the known three-hyperplane characterization for two-body operators and yields, for three-body operators, a curved boundary.

quant-pharXiv:2610.03438•Oct 5, 2026•0 citations
We revisit the feasibility and convergence claims for the polarization hierarchy of Plávala, Ligthart and Gross [Linear Algebra Appl.\ 723 (2025) 15--32]. Counterexamples show that the stated assumption is insufficient for the feasibility characterization and for convergence of the hierarchy with the polarization constraint. We establish corrected results under a stronger algebraic condition and supply a missing compactness argument.
This comment examines whether the polarization hierarchy for polynomial optimization over compact convex state spaces has the feasibility and convergence properties previously claimed. The issue is whether a polarization constraint Π(M)=0\Pi(M)=0Π(M)=0 forces the positive-semidefinite residual second moment M=∫f(a,b)⊗f(a,b) dμM=\int f(a,b)\otimes f(a,b)\,d\muM=∫f(a,b)⊗f(a,b)dμ to vanish.
The stated two-vector assumption does not suffice. A projection onto traceless symmetric 3×33\times33×3 matrices satisfies that assumption but annihilates I3I_3I3​. Simplex constructions then give an infeasible problem whose hierarchy remains feasible at every level, and a feasible optimization problem with pnΠ=−1p_n^\Pi=-1pnΠ​=−1 for every n≥2n\ge2n≥2, although p∗=0p^*=0p∗=0.
The corrected condition is ker⁡Π∩PSD(V)={0}\ker\Pi\cap\mathrm{PSD}(V)=\{0\}kerΠ∩PSD(V)={0}. It is necessary for a universal feasibility characterization and equivalent to excluding cancellation among D=dim⁡VD=\dim VD=dimV positive rank-one terms; DDD cannot generally be reduced. A semidefinite extreme-point rank bound shows that the original two-vector condition suffices when rank⁡(Π∣Sym2(V))≤4\operatorname{rank}(\Pi|_{\mathrm{Sym}^2(V)})\le4rank(Π∣Sym2(V)​)≤4. Under the corrected condition, de Finetti representation establishes feasibility, while diagonal compactness extraction supplies a missing step proving monotone convergence of optimal values.
The three polarization maps proposed in the original paper already satisfy the correction; the stronger hierarchy and reported finite-level infeasibility certificates remain valid. No general convergence rate or detection-level bound is obtained, and finite-level exactness or convergence of minimizers is not asserted. An example with Π=id\Pi=\mathrm{id}Π=id has pn=−1/n→0p_n=-1/n\to0pn​=−1/n→0, without finite exactness.
We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy , which has previously been introduced for the study of polynomial optimization problems over state spaces of C ⁎ ⁎ -algebras, to convex cones in finite dimensions. If the convex bodies can be characterized by linear or semidefinite programs, then the same is true for our hierarchy. Convergence is proven by relating the problem to a certain de Finetti theorem for general probabilistic theories , which are studied as possible generalizations of quantum mechanics . We apply the method to the problem of nonnegative matrix factorization, and in particular to the nested rectangles problem . A numerical implementation of the third level of the hierarchy is shown to give rise to a very tight approximation for this problem.
Leveraging a recently proposed notion of relative entropy in general probabilistic theories (GPT), we prove a finite de Finetti representation theorem for general convex bodies. We apply this result to address a fundamental question in polynomial optimization: the existence of a convergent outer hierarchy for problems with inequality constraints and analytical convergence guarantees. Our strategy generalizes a quantitative monogamy-of-entanglement argument from quantum theory to arbitrary convex bodies, establishing a uniform upper bound on mutual information in multipartite extensions. This leads to a finite de Finetti theorem and, subsequently, a convergent conic hierarchy for a wide class of polynomial optimization problems subject to both equality and inequality constraints. We further provide a constructive rounding scheme that yields certified interior points with controlled approximation error. As an application, we express the optimal GPT value of a two-player non-local game as a polynomial optimization problem, allowing our techniques to produce approximation schemes with finite convergence guarantees.
Abstract A causal structure is a description of the functional dependencies between random variables. A distribution is compatible with a given causal structure if it can be realized by a process respecting these dependencies. Deciding whether a distribution is compatible with a structure is a practically and fundamentally relevant, yet very difficult problem. Only recently has a general class of algorithms been proposed: These so-called inflation techniques associate to any causal structure a hierarchy of increasingly strict compatibility tests, where each test can be formulated as a computationally efficient convex optimization problem. Remarkably, it has been shown that in the classical case, this hierarchy is complete in the sense that each non-compatible distribution will be detected at some level of the hierarchy. An inflation hierarchy has also been formulated for causal structures that allow for the observed classical random variables to arise from measurements on quantum states—however, no proof of completeness of this quantum inflation hierarchy has been supplied. In this paper, we construct a first version of the quantum inflation hierarchy that is provably convergent. It takes an additional parameter, r , which can be interpreted as an upper bound on the Schmidt rank of the observables involved. For each r , it provides a family of increasingly strict and ultimately complete compatibility tests for correlations that are compatible with a given causal structure under this Schmidt rank constraint. From a technical point of view, convergence proofs are built on de Finetti theorems , which show that certain symmetries (which can be imposed in convex optimization problems) imply independence of random variables (which is not directly a convex constraint). A main technical ingredient to our proof is a Quantum de Finetti Theorem that holds for general tensor products of C∗C^*C∗ C ∗ -algebras, generalizing previous work that was restricted to minimal tensor products.
Bell correlations have been detected in atomic ensembles ranging from hundreds to hundreds of thousands of particles, witnessed by the permutationally invariant (PI) Bell operators. For all the operators realized so far, the maximally violating state can be brought, in a suitable basis, into a nonnegative-amplitude form. In that basis, the Bell operator is stoquastic. The coefficients parametrising these operators that at the same time lead to stoquasticity form a convex cone, the so-called stoquasticity cone. Its characterization had remained open beyond two-body operators, as for many-body operators the number of inequalities grows with the system size nnn. In this work we show that, in the thermodynamic limit, the stoquasticity cone admits an exact semidefinite characterization, valid at any operator order. The key observation is that, along each off-diagonal, the matrix elements are the values of a single univariate polynomial. Being univariate, this condition is equivalent to a linear matrix inequality, with no relaxation hierarchy. Therefore, deciding stoquasticity becomes a single semidefinite feasibility problem. As its lowest-degree instances, this description recovers the known three-hyperplane characterization for two-body operators and yields, for three-body operators, a curved boundary.