Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1412.3860

Completely Reducible maps in Quantum Information Theory

Daniel Cariello
View original source ↗Read source document ↗Export metadata ↓

Abstract

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) or invariant under realignment then its associated self-adjoint map is completely reducible. We give applications of this fact in Quantum Information Theory. We recover some theorems recently proved for PPT and SPC matrices and we prove these theorems for matrices invariant under realignment using theorems of Perron-Frobenius theory. We also provide a new proof of the fact that if $\mathbb{C}^{k}$ contains $k$ mutually unbiased bases then $\mathbb{C}^{k}$ contains $k+1$. We search for other types of matrices that could have the same property. We consider a group of linear transformations acting on $M_k\otimes M_k$, which contains the partial transpositions and the realignment map. For each element of this group, we consider the set of matrices in $M_k\otimes M_k\simeq M_{k^2}$ that are positive and remain positive, or invariant, under the action of this element. Within this family of sets, we have the set of PPT matrices, the set of SPC matrices and the set of matrices invariant under realignment. We show that these three sets are the only sets of this family such that the associated self-adjoint map of each matrix is completely reducible. We also show that every matrix invariant under realignment is PPT in $M_2\otimes M_2$ and we present a counterexample in $M_k\otimes M_k$, $k\geq 3$.

Explore related subjects

math-phmath.MP

Keep this discovery

BibTeXRIS

Daniel Cariello. 2015-02-18. Completely Reducible maps in Quantum Information Theory. https://doi.org/10.1109/tit.2016.2535176

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗