English
Related papers

Related papers: New multiplicativity results for qubit maps

200 papers

We introduce a class of linear maps irreducibly covariant with respect to the finite group generated by the Weyl operators. This group provides a direct generalization of the quaternion group. In particular, we analyze the irreducibly…

Mathematical Physics · Physics 2018-04-20 Katarzyna Siudzińska , Dariusz Chruściński

Let $f\colon X\to Y$ be a $\sigma$-perfect $k$-dimensional surjective map of metrizable spaces such that $\dim Y\leq m$. It is shown that, for every positive integer $p\geq 1$ there exists a dense $G_{\delta}$-subset ${\mathcal H}(k,m,p)$…

General Topology · Mathematics 2007-05-23 H. Murat Tuncali , Vesko Valov

Assuming a unitarily invariant norm $|||\cdot|||$ is given on a two-sided ideal of bounded linear operators acting on a separable Hilbert space, it induces some unitarily invariant norms $|||\cdot|||$ on matrix algebras $\mathcal{M}_n$ for…

Functional Analysis · Mathematics 2015-11-09 Jagjit Singh Matharu , Mohammad Sal Moslehian

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…

Computational Complexity · Computer Science 2017-04-07 Joel Ouaknine , James Worrell

Let $r\geq 3$ be any positive integer which is relatively prime to $p$ and $q^2\equiv 1 \pmod r$. Let $\tau_1, \tau_2$ be any permutation polynomials over $\mathbb{F}_{q^2},$ $\sigma_M$ is an invertible linear map over $\mathbb{F}_{q^2}$…

Information Theory · Computer Science 2022-12-29 Wei Lu , Xia Wu , Yufei Wang , Xiwang Cao

Suppose that $\pi \: Y \to X$ is a finite map of normal varieties over a perfect field of characteristic $p > 0$. Previous work of the authors gave a criterion for when Frobenius splittings on $X$ (or more generally any $p^{-e}$-linear map)…

Algebraic Geometry · Mathematics 2012-01-31 Karl Schwede , Kevin Tucker

It is known that random quantum channels exhibit significant violations of multiplicativity of maximum output p-norms for any p>1. In this work, we show that a weaker variant of multiplicativity nevertheless holds for these channels. For…

Quantum Physics · Physics 2015-06-03 Ashley Montanaro

We show that the set of not-completely-positive (NCP) maps is unbounded, unless further assumptions are made. This is done by first proposing a reasonable definition of a valid NCP map, which is nontrivial because NCP maps may lack a full…

Quantum Physics · Physics 2019-07-25 Vinayak Jagadish , R. Srikanth , Francesco Petruccione

Let $A$ and $B$ be Banach algebras with bounded approximate identities and let $\Phi:A\to B$ be a surjective continuous linear map which preserves two-sided zero products (i.e., $\Phi(a)\Phi(b)=\Phi(b)\Phi(a)=0$ whenever $ab=ba=0$). We show…

Functional Analysis · Mathematics 2021-12-17 M. Brešar , M. L. C. Godoy , A. R. Villena

Continuous-variable systems in quantum theory can be fully described through any one of the ${\rm s}$-ordered family of quasiprobabilities $\Lambda_{\rm s}(\alpha)$, ${\rm s} \in [-1,1]$. We ask for what values of $({\rm s}, a)$ is the…

Quantum Physics · Physics 2017-08-16 J. Solomon Ivan , Krishna Kumar Sabapathy , R. Simon

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

Optimization and Control · Mathematics 2018-02-05 Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

A new bound on quantum version of Wielandt inequality for positive (not necessarily completely positive) maps has been established. Also bounds for entanglement breaking and PPT channels are put forward which are better bound than the…

Quantum Physics · Physics 2019-10-03 Mizanur Rahaman

Computing $p \rightarrow q$ norm for matrices is a classical problem in computational mathematics and power iteration is a well-known method for computing $p \rightarrow q $ norm for a matrix with nonnegative entries. Here we define an…

Numerical Analysis · Mathematics 2022-09-16 Mohammad ShahverdiKondori , Sio On Chan

It is known that the minimal output entropy is additive for any product of entanglement breaking (EB) channels. The same is true for the Renyi entropy, where additivity is equivalent to multiplicativity of the $1 \rightarrow q$ norm for all…

Quantum Physics · Physics 2013-10-23 Christopher King

It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…

Functional Analysis · Mathematics 2015-09-29 Jianlian Cui , Chi-Kwong Li , Nung-Sing Sze

Let $\mathcal{A}$ and $\mathcal{B}$ be unital finite-dimensional complex algebras, each equipped with the unique Hausdorff vector topology. Denote by $\mathrm{Max}(\mathcal{A})=\{\mathcal{M}_1, \ldots, \mathcal{M}_p\}$ and…

Spectral Theory · Mathematics 2025-07-23 Ilja Gogić , Mateo Tomašević

Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…

Rings and Algebras · Mathematics 2016-03-15 Huajun Huang , Chih-Neng Liu , Patricia Szokol , Ming-Cheng Tsai , Jun Zhang

Let A be a BP*-algebra with identity e, P_{1}(A) be the set of all positive linear functionals f on A such that f(e) = 1, and let M_{s}(A) be the set of all nonzero hermitian multiplicative linear functionals on A. We prove that M_{s}(A) is…

Functional Analysis · Mathematics 2015-04-14 M. El Azhari

The dual of a matrix ordered space has a natural matrix ordering that makes the dual space matrix ordered as well. The purpose of these notes is to give a condition that describes when the linear map taking a basis of the n by n matrices to…

Quantum Physics · Physics 2015-06-12 Vern I. Paulsen , Fred Shultz

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Veronika Pillwein