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:1905.02014 · Analysis and Mathematical Physics

Noncommutative versions of inequalities in quantum information theory

Ali Reza Dadkhah, Mohammad Sal Moslehian, Kenjiro Yanagi

Published May 15, 2019• 5 citations
arXivHTMLPDF
DOI
10.1007/s13324-019-00309-7

Related papers

Noncommutative analogues of the Cramér-Rao inequality in the quantum measurement theory

Alexander Semenovich Holevo

Lecture notes in mathematics•Jan 1, 1976•10 citations

Quantum Analogues of Geometric Inequalities for Information Theory

Anna Vershynina

•Oct 10, 2016•0 citations

Multivariate trace inequalities, p-fidelity, and universal recovery beyond tracial settings

Marius Junge, Nicholas D. LaRacuente

Trace inequalities are general techniques with many applications in quantum information theory, often replacing the classical functional calculus in noncommutative settings. The physics of quantum field theory and holography, however, motivates entropy inequalities in type III von Neumann algebras that lack a semifinite trace. The Haagerup and Kosaki Lp spaces enable re-expressing trace inequalities in non-tracial von Neumann algebras. In particular, we show this for the generalized Araki–Lieb–Thirring and Golden–Thompson inequalities from the work of Sutter et al. [Commun. Math. Phys. 352(1), 37 (2017)]. Then, using the Haagerup approximation method, we prove a general von Neumann algebra version of universal recovery map corrections to the data processing inequality for relative entropy. We also show subharmonicity of a logarithmic p-fidelity of recovery. Furthermore, we prove that the non-decrease of relative entropy is equivalent to the existence of an L1-isometry implementing the channel on both input states.

arXiv:2009.11866•Journal of Mathematical Physics•Dec 1, 2022•9 citations

Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables

S. Pironio, Miguel Navascués, A. Acín

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.4368•SIAM Journal on Optimization•Jan 1, 2010•225 citations

Quantum information inequalities

Liang Cai, Frank Hansen

•Mar 10, 2008•0 citations

Certifying Optimality of Bell Inequality Violations: Noncommutative Polynomial Optimization through Semidefinite Programming and Local Optimization

Timotej Hrga, Igor Klep, Janez Povh

Abstract. Bell inequalities are pillars of quantum physics in that their violations imply that certain properties of quantum physics (e.g., entanglement) cannot be represented by any classical picture of physics. In this article Bell inequalities and their violations are considered through the lens of noncommutative polynomial optimization. Optimality of these violations is certified for a large majority of a set of standard Bell inequalities, denoted A2–A89 in the literature. The main techniques used in the paper include the NPA hierarchy, i.e., the noncommutative version of the Lasserre semidefinite programming (SDP) hierarchies based on the Helton–McCullough Positivstellensatz, the Gelfand–Naimark–Segal (GNS) construction with a novel use of the Artin–Wedderburn theory for rounding and projecting, and nonlinear programming (NLP). A new “Newton chip”-like technique for reducing sizes of SDPs arising in the constructed polynomial optimization problems is presented. This technique is based on conditional expectations. Finally, noncommutative Gröbner bases are exploited to certify when an optimizer (a solution yielding optimum violation) cannot be extracted from a dual SDP solution.

SIAM Journal on Optimization•Apr 9, 2024•3 citations
Trace inequalities are general techniques with many applications in quantum information theory, often replacing the classical functional calculus in noncommutative settings. The physics of quantum field theory and holography, however, motivates entropy inequalities in type III von Neumann algebras that lack a semifinite trace. The Haagerup and Kosaki Lp spaces enable re-expressing trace inequalities in non-tracial von Neumann algebras. In particular, we show this for the generalized Araki–Lieb–Thirring and Golden–Thompson inequalities from the work of Sutter et al. [Commun. Math. Phys. 352(1), 37 (2017)]. Then, using the Haagerup approximation method, we prove a general von Neumann algebra version of universal recovery map corrections to the data processing inequality for relative entropy. We also show subharmonicity of a logarithmic p-fidelity of recovery. Furthermore, we prove that the non-decrease of relative entropy is equivalent to the existence of an L1-isometry implementing the channel on both input states.
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.
Abstract. Bell inequalities are pillars of quantum physics in that their violations imply that certain properties of quantum physics (e.g., entanglement) cannot be represented by any classical picture of physics. In this article Bell inequalities and their violations are considered through the lens of noncommutative polynomial optimization. Optimality of these violations is certified for a large majority of a set of standard Bell inequalities, denoted A2–A89 in the literature. The main techniques used in the paper include the NPA hierarchy, i.e., the noncommutative version of the Lasserre semidefinite programming (SDP) hierarchies based on the Helton–McCullough Positivstellensatz, the Gelfand–Naimark–Segal (GNS) construction with a novel use of the Artin–Wedderburn theory for rounding and projecting, and nonlinear programming (NLP). A new “Newton chip”-like technique for reducing sizes of SDPs arising in the constructed polynomial optimization problems is presented. This technique is based on conditional expectations. Finally, noncommutative Gröbner bases are exploited to certify when an optimizer (a solution yielding optimum violation) cannot be extracted from a dual SDP solution.