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:2310.00612 · Physical Review Letters

Uncertainty Relations from State Polynomial Optimization

Moisés Bermejo Morán, Felix Huber

Published May 16, 2024• 13 citations
arXivHTMLPDF

Abstract

Uncertainty relations are a fundamental feature of quantum mechanics. How can these relations be found systematically? Here, we develop a semidefinite programming hierarchy for additive uncertainty relations in the variances of noncommuting observables. Our hierarchy is built on the state polynomial optimization framework, also known as scalar extension. The hierarchy is complete in the sense that it converges to tight uncertainty relations. We improve upon upper bounds for all 1292 additive uncertainty relations on up to nine operators for which a tight bound is not known. The bounds are dimension-free and depend entirely on the algebraic relations among the operators. The techniques apply to a range of scenarios, including Pauli, Heisenberg-Weyl, and fermionic operators, and generalize to higher order moments and multiplicative uncertainty relations.

DOI
10.1103/physrevlett.132.200202

Related papers

Geometric and algebraic origins of additive uncertainty relations

Konrad Szymański, Karol Życzkowski

Abstract Constructive techniques to establish state-independent uncertainty relations for the sum of variances of arbitrary two observables are presented. We investigate the range of simultaneously attainable pairs of variances, which can be applied to a wide variety of problems including finding exact bound for the sum of variances of two components of angular momentum operator for any total angular momentum quantum number j and detection of quantum entanglement. Resulting uncertainty relations are state-independent, semianalytical, bounded-error and can be made arbitrarily tight. The advocated approach, based on the notion of joint numerical range of a number of observables and uncertainty range, allows us to improve earlier numerical works and to derive semianalytical tight bounds for the uncertainty relation for the sum of variances expressed as roots of a polynomial of a single real variable.

arXiv:1804.06191•Journal of Physics A Mathematical and Theoretical•Sep 18, 2019•31 citations

Characterizing finite-dimensional quantum behavior

Miguel Navascués, Adrien Feix, Mateus Araújo +1 more

We study and extend the semidefinite programming (SDP) hierarchies introduced in Navascu\'es and V\'ertesi [Phys. Rev. Lett. 115, 020501 (2015)] for the characterization of the statistical correlations arising from finite-dimensional quantum systems. First, we introduce the dimension-constrained noncommutative polynomial optimization (NPO) paradigm, where a number of polynomial inequalities are defined and optimization is conducted over all feasible operator representations of bounded dimensionality. Important problems in device-independent and semi-device-independent quantum information science can be formulated (or almost formulated) in this framework. We present effective SDP hierarchies to attack the general dimension-constrained NPO problem (and related ones) and prove their asymptotic convergence. To illustrate the power of these relaxations, we use them to derive a number of dimension witnesses for temporal and Bell-type correlation scenarios, and also to bound the probability of success of quantum random access codes.

arXiv:1507.07521•Physical Review A•Oct 21, 2015•55 citations

Near-Optimal Variance-Based Uncertainty Relations

Yunlong Xiao, Naihuan Jing, Bing Yu +2 more

Learning physical properties of a quantum system is essential for the developments of quantum technologies. However, Heisenberg’s uncertainty principle constrains the potential knowledge one can simultaneously have about a system in quantum theory. Aside from its fundamental significance, the mathematical characterization of this restriction, known as ‘uncertainty relation’, plays important roles in a wide range of applications, stimulating the formation of tighter uncertainty relations. In this work, we investigate the fundamental limitations of variance-based uncertainty relations, and introduce several ‘near optimal’ bounds for incompatible observables. Our results consist of two morphologically distinct phases: lower bounds that illustrate the uncertainties about measurement outcomes, and the upper bound that indicates the potential knowledge we can gain. Combining them together leads to an uncertainty interval, which captures the essence of uncertainties in quantum theory. Finally, we have detailed how to formulate lower bounds for product-form variance-based uncertainty relations by employing entropic uncertainty relations, and hence built a link between different forms of uncertainty relations.

arXiv:1610.01692•Frontiers in Physics•Apr 1, 2022•12 citations

Uncertainty relation and the constrained quadratic programming

Lin Zhang, Dade Wu, Ming‐Jing Zhao +1 more

Abstract The uncertainty relation is a fundamental concept in quantum theory, plays a pivotal role in various quantum information processing tasks. In this study, we explore the additive uncertainty relation pertaining to two or more observables, in terms of their variance, by utilizing the generalized Gell-Mann representation in qudit systems. We find that the tight state-independent lower bound of the variance sum can be characterized as a quadratic programming problem with nonlinear constraints in optimization theory. As illustrative examples, we derive analytical solutions for these quadratic programming problems in lower-dimensional systems, which align with the state-independent lower bounds. Additionally, we introduce a numerical algorithm tailored for solving these quadratic programming instances, highlighting its efficiency and accuracy. The advantage of our approach lies in its potential ability to simultaneously achieve the optimal value of the quadratic programming problem with nonlinear constraints but also precisely identify the extremal state where this optimal value is attained. This enables us to establish a tight state-independent lower bound for the sum of variances, and further identify the extremal state at which this lower bound is realized.

arXiv:2404.18671•Physica Scripta•Apr 16, 2024•3 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.

quant-pharXiv:2605.26331•May 27, 2026•2 citations

SDP bounds on quantum codes

Gerard Anglès Munné, Andrew Nemec, Felix Huber

This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, δ)\!)_2$ code exists if and only if every level of the hierarchy is feasible. It is not limited to stabilizer codes and thus is applicable generally. While the machinery is formally dimension-free, we restrict it to qubit codes through quasi-Clifford algebras. We derive the quantum analog of a range of classical results: first, from an intermediate level a Lovász bound for self-dual quantum codes is recovered. Second, a symmetrization of a minor variation of this Lovász bound recovers the quantum Delsarte bound. Third, a symmetry reduction using the Terwilliger algebra leads to semidefinite programming bounds of size $O(n^4)$. With this we give an alternative proof that there is no $(\!(7, 1, 4)\!)_2$ quantum code, and show that $(\!(8, 9, 3)\!)_2$ and $(\!(10, 5, 4)\!)_2$ codes do not exist.

arXiv:2408.10323•Aug 19, 2024•18 citations
Uncertainty relations are a fundamental feature of quantum mechanics. How can these relations be found systematically? Here, we develop a semidefinite programming hierarchy for additive uncertainty relations in the variances of noncommuting observables. Our hierarchy is built on the state polynomial optimization framework, also known as scalar extension. The hierarchy is complete in the sense that it converges to tight uncertainty relations. We improve upon upper bounds for all 1292 additive uncertainty relations on up to nine operators for which a tight bound is not known. The bounds are dimension-free and depend entirely on the algebraic relations among the operators. The techniques apply to a range of scenarios, including Pauli, Heisenberg-Weyl, and fermionic operators, and generalize to higher order moments and multiplicative uncertainty relations.
Abstract Constructive techniques to establish state-independent uncertainty relations for the sum of variances of arbitrary two observables are presented. We investigate the range of simultaneously attainable pairs of variances, which can be applied to a wide variety of problems including finding exact bound for the sum of variances of two components of angular momentum operator for any total angular momentum quantum number j and detection of quantum entanglement. Resulting uncertainty relations are state-independent, semianalytical, bounded-error and can be made arbitrarily tight. The advocated approach, based on the notion of joint numerical range of a number of observables and uncertainty range, allows us to improve earlier numerical works and to derive semianalytical tight bounds for the uncertainty relation for the sum of variances expressed as roots of a polynomial of a single real variable.
We study and extend the semidefinite programming (SDP) hierarchies introduced in Navascu\'es and V\'ertesi [Phys. Rev. Lett. 115, 020501 (2015)] for the characterization of the statistical correlations arising from finite-dimensional quantum systems. First, we introduce the dimension-constrained noncommutative polynomial optimization (NPO) paradigm, where a number of polynomial inequalities are defined and optimization is conducted over all feasible operator representations of bounded dimensionality. Important problems in device-independent and semi-device-independent quantum information science can be formulated (or almost formulated) in this framework. We present effective SDP hierarchies to attack the general dimension-constrained NPO problem (and related ones) and prove their asymptotic convergence. To illustrate the power of these relaxations, we use them to derive a number of dimension witnesses for temporal and Bell-type correlation scenarios, and also to bound the probability of success of quantum random access codes.
Learning physical properties of a quantum system is essential for the developments of quantum technologies. However, Heisenberg’s uncertainty principle constrains the potential knowledge one can simultaneously have about a system in quantum theory. Aside from its fundamental significance, the mathematical characterization of this restriction, known as ‘uncertainty relation’, plays important roles in a wide range of applications, stimulating the formation of tighter uncertainty relations. In this work, we investigate the fundamental limitations of variance-based uncertainty relations, and introduce several ‘near optimal’ bounds for incompatible observables. Our results consist of two morphologically distinct phases: lower bounds that illustrate the uncertainties about measurement outcomes, and the upper bound that indicates the potential knowledge we can gain. Combining them together leads to an uncertainty interval, which captures the essence of uncertainties in quantum theory. Finally, we have detailed how to formulate lower bounds for product-form variance-based uncertainty relations by employing entropic uncertainty relations, and hence built a link between different forms of uncertainty relations.
Abstract The uncertainty relation is a fundamental concept in quantum theory, plays a pivotal role in various quantum information processing tasks. In this study, we explore the additive uncertainty relation pertaining to two or more observables, in terms of their variance, by utilizing the generalized Gell-Mann representation in qudit systems. We find that the tight state-independent lower bound of the variance sum can be characterized as a quadratic programming problem with nonlinear constraints in optimization theory. As illustrative examples, we derive analytical solutions for these quadratic programming problems in lower-dimensional systems, which align with the state-independent lower bounds. Additionally, we introduce a numerical algorithm tailored for solving these quadratic programming instances, highlighting its efficiency and accuracy. The advantage of our approach lies in its potential ability to simultaneously achieve the optimal value of the quadratic programming problem with nonlinear constraints but also precisely identify the extremal state where this optimal value is attained. This enables us to establish a tight state-independent lower bound for the sum of variances, and further identify the extremal state at which this lower bound is realized.
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)Q_ρ(A)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 copt(ρ)c_{\rm opt}(ρ)copt​(ρ) for which Vρ(A)≥copt(ρ)Qρ(A)V_ρ(A)\ge c_{\rm opt}(ρ)Q_ρ(A)Vρ​(A)≥copt​(ρ)Qρ​(A) holds for every observable AAA, and show that it depends only on the smallest and largest eigenvalues of ρρρ. The same optimization principle extends to a new power-commutator family 12∣[ρs,A]∣2\frac{1}{2}|[ρ^s,A]|^221​∣[ρs,A]∣2 (s≥1/2)(s\ge 1/2)(s≥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.
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a ( ⁣(n,K,δ) ⁣)2(\!(n, K, δ)\!)_2((n,K,δ))2​ code exists if and only if every level of the hierarchy is feasible. It is not limited to stabilizer codes and thus is applicable generally. While the machinery is formally dimension-free, we restrict it to qubit codes through quasi-Clifford algebras. We derive the quantum analog of a range of classical results: first, from an intermediate level a Lovász bound for self-dual quantum codes is recovered. Second, a symmetrization of a minor variation of this Lovász bound recovers the quantum Delsarte bound. Third, a symmetry reduction using the Terwilliger algebra leads to semidefinite programming bounds of size O(n4)O(n^4)O(n4). With this we give an alternative proof that there is no ( ⁣(7,1,4) ⁣)2(\!(7, 1, 4)\!)_2((7,1,4))2​ quantum code, and show that ( ⁣(8,9,3) ⁣)2(\!(8, 9, 3)\!)_2((8,9,3))2​ and ( ⁣(10,5,4) ⁣)2(\!(10, 5, 4)\!)_2((10,5,4))2​ codes do not exist.