We consider optimization problems with polynomial inequality constraints in noncommuting variables. These noncommuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial inequalities as semidefinite positivity constraints. Such problems arise naturally in quantum theory and quantum information science. To solve them, we introduce a hierarchy of semidefinite programming relaxations which generates a monotone sequence of lower bounds that converges to the optimal solution. We also introduce a criterion to detect whether the global optimum is reached at a given relaxation step and show how to extract a global optimizer from the solution of the corresponding semidefinite programming problem.We consider optimization problems with polynomial inequality constraints in noncommuting variables. These noncommuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial inequalities as semidefinite positivity constraints. Such problems arise naturally in quantum theory and quantum information science. To solve them, we introduce a hierarchy of semidefinite programming relaxations which generates a monotone sequence of lower bounds that converges to the optimal solution. We also introduce a criterion to detect whether the global optimum is reached at a given relaxation step and show how to extract a global optimizer from the solution of the corresponding semidefinite programming problem.

arXiv:0903.4368SIAM Journal on OptimizationJan 1, 2010194 citations

Optimal Uncertainty Relations for a Single Observable

Haruki Yamashita, Aina Mayumi, Gen Kimura

Uncertainty relations are usually formulated as trade-offs between two or more observables. Yet the uncertainty of a single observable can already contain an intrinsically quantum contribution arising from its noncommutativity with the state. In the sense of Luo, such a contribution can be quantified by a quantum uncertainty $Q_ρ(A)$ , with prominent examples including the Wigner--Yanase and Wigner--Yanase--Dyson skew informations and the quantum Fisher information. Here we ask how strong such single-observable uncertainty relations can be when the quantum state is fixed. We solve this fixed-state optimization problem by determining the largest coefficient $c_{\rm opt}(ρ)$ for which $V_ρ(A)\ge c_{\rm opt}(ρ)Q_ρ(A)$ holds for every observable $A$ , and show that it depends only on the smallest and largest eigenvalues of $ρ$ . The same optimization principle extends to a new power-commutator family $\frac{1}{2}|[ρ^s,A]|^2$ $(s\ge 1/2)$ , providing a direct measure of state--observable noncommutativity beyond the standard quantum-uncertainty framework. More importantly, the optimal noncommutative contribution can be combined with the maximal classical contribution compatible with the state, yielding a sharpened variance decomposition without weakening the optimal bound. For states with exactly two distinct eigenvalues, this relation becomes an identity for every observable; in particular, qubit variances decompose exactly into classical and noncommutative parts. Finally, the corresponding variance-product bounds are no weaker than the Robertson relation for qubit spin observables and can be strictly stronger, showing that a substantial part of the uncertainty usually expressed as a trade-off between distinct observables is already encoded in their individual noncommutativity with the state.Uncertainty relations are usually formulated as trade-offs between two or more observables. Yet the uncertainty of a single observable can already contain an intrinsically quantum contribution arising from its noncommutativity with the state. In the sense of Luo, such a contribution can be quantified by a quantum uncertainty $Q_ρ(A)$, with prominent examples including the Wigner--Yanase and Wigner--Yanase--Dyson skew informations and the quantum Fisher information. Here we ask how strong such single-observable uncertainty relations can be when the quantum state is fixed. We solve this fixed-state optimization problem by determining the largest coefficient $c_{\rm opt}(ρ)$ for which $V_ρ(A)\ge c_{\rm opt}(ρ)Q_ρ(A)$ holds for every observable $A$, and show that it depends only on the smallest and largest eigenvalues of $ρ$. The same optimization principle extends to a new power-commutator family $\frac{1}{2}|[ρ^s,A]|^2$ $(s\ge 1/2)$, providing a direct measure of state--observable noncommutativity beyond the standard quantum-uncertainty framework. More importantly, the optimal noncommutative contribution can be combined with the maximal classical contribution compatible with the state, yielding a sharpened variance decomposition without weakening the optimal bound. For states with exactly two distinct eigenvalues, this relation becomes an identity for every observable; in particular, qubit variances decompose exactly into classical and noncommutative parts. Finally, the corresponding variance-product bounds are no weaker than the Robertson relation for qubit spin observables and can be strictly stronger, showing that a substantial part of the uncertainty usually expressed as a trade-off between distinct observables is already encoded in their individual noncommutativity with the state.

quant-pharXiv:2605.26331May 27, 20260 citations

Quantum Optimization Problems

Tomoyuki Yamakami

arXiv:quant-ph/0204010Lecture notes in computer scienceJan 1, 20022 citations

Semidefinite optimization for quantum information

Xin Wang

Jan 1, 20184 citations

SymDPoly: symmetry-adapted moment relaxations for noncommutative polynomial optimization

Denis Rosset

Semidefinite relaxations are widely used to compute upper bounds on the objective of optimization problems involving noncommutative polynomials. Such optimization problems are prevalent in quantum information. We present an algorithm able to discover automatically and exploit the symmetries present in the problem formulation. We also provide an open source software library written in Scala ( https://denisrosset.github.io/symdpoly ) that computes symmetry-adapted semidefinite relaxations with interfaces to a variety of open-source and commercial semidefinite solvers. We discuss the advantages of symmetrization, namely reductions in memory use, computation time, and increase in the solution precision.Semidefinite relaxations are widely used to compute upper bounds on the objective of optimization problems involving noncommutative polynomials. Such optimization problems are prevalent in quantum information. We present an algorithm able to discover automatically and exploit the symmetries present in the problem formulation. We also provide an open source software library written in Scala ( https://denisrosset.github.io/symdpoly ) that computes symmetry-adapted semidefinite relaxations with interfaces to a variety of open-source and commercial semidefinite solvers. We discuss the advantages of symmetrization, namely reductions in memory use, computation time, and increase in the solution precision.

arXiv:1808.09598Aug 29, 20188 citations

Q_ρ(A)

, with prominent examples including the Wigner--Yanase and Wigner--Yanase--Dyson skew informations and the quantum Fisher information. Here we ask how strong such single-observable uncertainty relations can be when the quantum state is fixed. We solve this fixed-state optimization problem by determining the largest coefficient

c_{\rm opt}(ρ)

for which

V_ρ(A)\ge c_{\rm opt}(ρ)Q_ρ(A)

holds for every observable

A

, and show that it depends only on the smallest and largest eigenvalues of

ρ

. The same optimization principle extends to a new power-commutator family

\frac{1}{2}|[ρ^s,A]|^2

(s\ge 1/2)

, providing a direct measure of state--observable noncommutativity beyond the standard quantum-uncertainty framework. More importantly, the optimal noncommutative contribution can be combined with the maximal classical contribution compatible with the state, yielding a sharpened variance decomposition without weakening the optimal bound. For states with exactly two distinct eigenvalues, this relation becomes an identity for every observable; in particular, qubit variances decompose exactly into classical and noncommutative parts. Finally, the corresponding variance-product bounds are no weaker than the Robertson relation for qubit spin observables and can be strictly stronger, showing that a substantial part of the uncertainty usually expressed as a trade-off between distinct observables is already encoded in their individual noncommutativity with the state.