Related papers: Contractions, Matrix Paramatrizations, and Quantum…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
Negativity is an entanglement monotone frequently used to quantify entanglement in bipartite states. Because negativity is a non-analytic function of a density matrix, existing methods used in the physics literature are insufficient to…
From the physical point of view entanglement witnesses define a universal tool for analysis and classification of quantum entangled states. From the mathematical point of view they provide highly nontrivial generalization of positive…
Quantum networks offer a realistic and practical scheme for generating multiparticle entanglement and implementing multiparticle quantum communication protocols. However, the correlations that can be generated in networks with quantum…
We provide a generalization of the reduction and Robertson positive maps in matrix algebras. They give rise to a new class of optimal entanglement witnesses. Their structural physical approximation is analyzed. As a byproduct we provide a…
We give an exact solution to the nonlinear optimization problem of approximating a Hermitian matrix by positive semi-definite matrices. Our algorithm was then used to judge whether a quantum state is entangled or not. We show that the exact…
We study quantum entanglements induced on product states by the action of 8-vertex braid matrices, rendered unitary with purely imaginary spectral parameters (rapidity). The unitarity is displayed via the "canonical factorization" of the…
Building a scalable quantum computer requires developing appropriate models to understand and verify its complex quantum dynamics. We focus on superconducting quantum processors based on transmons for which full numerical simulations are…
Networks based on entangled quantum systems enable interesting applications in quantum information processing and the understanding of the resulting quantum correlations is essential for advancing the technology. We show that the theory of…
Covariance matrices are a useful tool to investigate correlations and entanglement in quantum systems. They are widely used in continuous variable systems, but recently also for finite dimensional systems powerful entanglement criteria in…
We provide a class of positive and trace-preserving maps based on symmetric measurements. From these positive maps we present separability criteria, entanglement witnesses, as well as the lower bounds of concurrence. We show by detailed…
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
A proof using the theory of completely positive maps is given to the fact that if $A \in M_2$, or $A \in M_3$ has a reducing eigenvalue, then every bounded linear operator $B$ with $W(B) \subseteq W(A)$ has a dilation of the form $I \otimes…
Information-theoretic measures such as relative entropy and correlation are extremely useful when modeling or analyzing the interaction of probabilistic systems. We survey the quantum generalization of 5 such measures and point out some of…
We investigate the space of quantum operations, as well as the larger space of maps which are positive, but not completely positive. A constructive criterion for decomposability is presented. A certain class of unistochastic operations,…
In order to compute the Schmidt decomposition of $A\in M_k\otimes M_m$, we must consider an associated self-adjoint map. Here, we show that if $A$ is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC)…
We provide a novel tool which may be used to construct new examples of positive maps in matrix algebras (or, equivalently, entanglement witnesses). It turns out that this can be used to prove positivity of several well known maps (such as…
This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…
We consider a family of vector and operator norms defined by the Schmidt decomposition theorem for quantum states. We use these norms to tackle two fundamental problems in quantum information theory: the classification problem for…
Linear maps of matrices describing evolution of density matrices for a quantum system initially entangled with another are identified and found to be not always completely positive. They can even map a positive matrix to a matrix that is…