A complete picture of the four-party linear inequalities in terms of the 0-entropy

• URL: http://arxiv.org/abs/2105.07679v1
• Date: Mon, 17 May 2021 08:55:37 GMT
• Title: A complete picture of the four-party linear inequalities in terms of the 0-entropy
• Abstract summary: Multipartite quantum system is complex. One of such relations has been reduced by [Cadney et al, LAA. 452, 153, 2014] to a conjectured inequality in terms of matrix rank. We prove the inequality, and thus establish a complete picture of the four-party linear inequalities in terms of the $0$-entropy.
• Score: 5.451781932190116
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multipartite quantum system is complex. Characterizing the relations among the three bipartite reduced density operators $\rho_{AB}$, $\rho_{AC}$ and $\rho_{BC}$ of a tripartite state $\rho_{ABC}$ has been an open problem in quantum information. One of such relations has been reduced by [Cadney et al, LAA. 452, 153, 2014] to a conjectured inequality in terms of matrix rank, namely $r(\rho_{AB}) \cdot r(\rho_{AC})\ge r(\rho_{BC})$ for any $\rho_{ABC}$. It is denoted as open problem $41$ in the website "Open quantum problems-IQOQI Vienna". We prove the inequality, and thus establish a complete picture of the four-party linear inequalities in terms of the $0$-entropy. Our proof is based on the construction of a novel canonical form of bipartite matrices under local equivalence. We apply our result to the marginal problem and the extension of inequalities in the multipartite systems, as well as the condition when the inequality is saturated.

Related papers

• The Condition-Number Barrier in Sparse Least Squares [77.64108812086542]
  In [AS21], Axiotis and Sviridenko conjectured that the linear dependence on the restricted condition number in convex optimization cannot be improved by a sparse-time algorithm.<n>We establish their conjectured lower bound for least-squares objectives, conditional on the randomized exact-volume Small-Set Expansion Hypothesis.
  arXiv  Detail & Related papers  (2026-08-03T17:57:01Z)
• Resolving the Edge of a Quantum Pyramid [0.0]
  We prove the entropy inequalities of Holevo and Utkin, which certify optimality for obtuse and flat pyramids.<n>For obtuse pyramids, our key contribution is a rigorous proof that local minimizers of the corresponding entropy inequality cannot have three distinct coordinate values.<n>For flat pyramids, we prove a tight $ellp$ inequality for zero-sum vectors that was recently conjectured.
  arXiv  Detail & Related papers  (2026-06-12T17:59:33Z)
• A conjecture on a tight norm inequality in the finite-dimensional l_p [0.0]
  We suggest a tight inequality for norms in $d$-dimensional space $l_p $ which has simple formulation but appears hard to prove.<n>We give a proof for $d=3$ and provide a detailed numerical check for $dleq 200$ confirming the conjecture.
  arXiv  Detail & Related papers  (2026-03-25T07:24:55Z)
• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
  We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input. We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
  arXiv  Detail & Related papers  (2024-02-23T12:22:03Z)
• Towards Optimal Convergence Rates for the Quantum Central Limit Theorem [3.6985338895569204]
  Quantum central limit theorem for bosonic systems states that the sequence of states $rhoboxplus n$ obtained from the $n$-fold convolution of a centered quantum state converges to a quantum Gaussian state. In this paper, we contribute to the problem of finding optimal rate of convergence for this theorem.
  arXiv  Detail & Related papers  (2023-10-15T12:02:43Z)
• A polynomial quantum computing algorithm for solving the dualization problem [75.38606213726906]
  Given two monotone prime functions $f:0,1n to 0,1$ and $g:0,1n to 0,1$ the dualization problem consists in determining if $g$ is the dual of $f$. We present a quantum computing algorithm that solves the decision version of the dualization problem in time.
  arXiv  Detail & Related papers  (2023-08-28T18:12:54Z)
• Rigorous derivation of the Efimov effect in a simple model [68.8204255655161]
  We consider a system of three identical bosons in $mathbbR3$ with two-body zero-range interactions and a three-body hard-core repulsion of a given radius $a>0$.
  arXiv  Detail & Related papers  (2023-06-21T10:11:28Z)
• Constructions of $k$-uniform states in heterogeneous systems [65.63939256159891]
  We present two general methods to construct $k$-uniform states in the heterogeneous systems for general $k$. We can produce many new $k$-uniform states such that the local dimension of each subsystem can be a prime power.
  arXiv  Detail & Related papers  (2023-05-22T06:58:16Z)
• Equality cases in monotonicity of quasi-entropies, Lieb's concavity and Ando's convexity [0.0]
  We revisit and improve joint concavity/rhoity and monotonicity properties quasi-entropies due to Petz in a new fashion. We characterize equality cases in the monotonicity inequalities (the data-processing inequalities) of quasi-entropies in several ways.
  arXiv  Detail & Related papers  (2023-04-10T02:59:53Z)
• A generic quantum Wielandt's inequality [0.9975341265604578]
  It is conjectured that $k$ should be of order $mathcalO(n2)$ in general. We provide a generic version of quantum Wielandt's inequality, which gives the optimal length with probability one. We shed new light on a long-standing open problem for Projected Entangled Pair State.
  arXiv  Detail & Related papers  (2023-01-19T18:57:32Z)
• A new operator extension of strong subadditivity of quantum entropy [12.547444644243544]
  Weak monotonicity asserts that $S(rho_AB) - S(rho_A) + S(rho_BC) - S(rho_C)geq 0$ for any tripartite density matrix $rho_ABC$. We prove an operator inequality, which, upon taking an expectation value with respect to the state $rho_ABC$, reduces to the weak monotonicity inequality.
  arXiv  Detail & Related papers  (2022-11-24T01:45:44Z)
• A trace inequality of Ando, Hiai and Okubo and a monotonicity property of the Golden-Thompson inequality [1.5229257192293197]
  The Golden-Thompson trace inequality $Tr, eH+K leq Tr, eH eK$ has proved to be very useful in quantum statistical mechanics. Here we make this G-T inequality more explicit by proving that for some operators, $H=Delta$ or $H= -sqrt-Delta +m$ and $K=$ potential, $Tr, eH+ (1-u)KeuK$ is a monotone increasing function of the parameter $u$ for $0leq
  arXiv  Detail & Related papers  (2022-03-11T18:09:13Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Improved Quantum Hypercontractivity Inequality for the Qubit Depolarizing Channel [2.9443230571766845]
  The hypercontractivity inequality for the qubit depolarizing channel $Psi_t$ states that $|Psi_totimes n(X)|_pleq |X|_q$ provided that $pgeq q> 1$ and $tgeq ln sqrtfracp-1q-1$. We first prove an improved quantum logarithmic-Sobolev inequality and then use the well-known equivalence of logarithmic-Sobolev hypercontractivity inequalities to obtain our main result
  arXiv  Detail & Related papers  (2021-05-02T13:04:17Z)
• Tight Quantum Lower Bound for Approximate Counting with Quantum States [49.6558487240078]
  We prove tight lower bounds for the following variant of the counting problem considered by Aaronson, Kothari, Kretschmer, and Thaler ( 2020) The task is to distinguish whether an input set $xsubseteq [n]$ has size either $k$ or $k'=(1+varepsilon)k$.
  arXiv  Detail & Related papers  (2020-02-17T10:53:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.