相关论文: A class of generalized positive linear maps on mat…

A partial description of the structure of positive unital maps $\phi: M_2(\bC) \to M_{n+1}(\bC)$ ($n\geq 2$) is given.

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Quantum entanglement is an important phenomenon in quantum information theory. To detect entanglement theoretically, positive but not completely positive maps are used. The Kadison-Schwarz (KS) inequality interpolates between positivity and…

We derive two types of linearity conditions for mapping class groups of orientable surfaces: one for once-punctured surface, and the other for closed surface, respectively. For the once-punctured case, the condition is described in terms of…

In this semi-expository paper, we first explain key notions from current quantum information theory and criteria for them in a coherent way. These include separability/entanglement, Schmidt numbers of bi-partite states and block-positivity,…

We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…

Natural linear and coalgebra transformations of tensor algebras are studied. The representations of certain combinatorial groups are given. These representations are connected to natural transformations of tensor algebras and to the groups…

We explore the set of unitary matrices characterized by a given structure in the context of their applications in the field of Quantum Information. In the first part of the Thesis we focus on classification of special classes of unitary…

We answer the question which conjunctive queries are uniquely characterized by polynomially many positive and negative examples, and how to construct such examples efficiently. As a consequence, we obtain a new efficient exact learning…

We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

We introduce the concept of completely positive roots of completely positive maps on operator algebras. We do this in different forms: as asymptotic roots, proper discrete roots and as continuous one-parameter semigroups of roots. We…

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

Transformers can learn to perform numerical computations from examples only. I study nine problems of linear algebra, from basic matrix operations to eigenvalue decomposition and inversion, and introduce and discuss four encoding schemes to…

We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…

For a positive linear map F and a normal matrix N, we show that |F(N)| is bounded by some simple linear combinations in the unitary orbit of F(|N|). Several elegant sharp inequalities are derived, especially for the Schur product.

Let $K$ be a convex subset of the state space of a finite dimensional $C^*$-algebra. We study the properties of channels on $K$, which are defined as affine maps from $K$ into the state space of another algebra, extending to completely…

This is an introduction to linear algebra and group theory. We first review the linear algebra basics, namely the determinant, the diagonalization procedure and more, and with the determinant being constructed as it should, as a signed…

The problem of entanglement detection is a long standing problem in quantum information theory. One of the primary procedures of detecting entanglement is to find the suitable positive but non-completely positive maps. Here we try to give a…

This paper outlines our ideas on how to teach linear algebra in a mechanized mathematical environment, and discusses some of our reasons for thinking that this is a better way to teach linear algebra than the ``old fashioned way''. We…