The Entanglement Level and the Detection of Quantum Data Transfer Correctness in Short Qutrit Spin Chains

The quantum entanglement is an important feature of many protocols in the field of quantum computing. In this paper we evaluate a level of entanglement in short qutrit chains. This evaluation is carried out with use of the CCNR criterion and the concurrence measure. We also present some explicit formulae describing the values of CCNR criterion and concurrence for exemplary short spin chains. Utilizing the obtained results, we indicate that analyzing the level of entanglement allows to detect the noise or deviation in the transfer process, in comparison to the perfect transfer where only operation realizing transfer is present.Comment: 15 pages, 9 figures, small typos fi

Euclidean distance geometry and applications

Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in Euclidean space that realizes the given distances. We survey some of the theory of Euclidean distance geometry and some of the most important applications: molecular conformation, localization of sensor networks and statics.Comment: 64 pages, 21 figure

An Axiomatic Setup for Algorithmic Homological Algebra and an Alternative Approach to Localization

In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of computability need to be turned into constructive ones. We do this explicitly for the often-studied example Abelian category of finitely presented modules over a so-called computable ring $R$, i.e., a ring with an explicit algorithm to solve one-sided (in)homogeneous linear systems over $R$. For a finitely generated maximal ideal $\mathfrak{m}$ in a commutative ring $R$ we show how solving (in)homogeneous linear systems over $R_{\mathfrak{m}}$ can be reduced to solving associated systems over $R$. Hence, the computability of $R$ implies that of $R_{\mathfrak{m}}$. As a corollary we obtain the computability of the category of finitely presented $R_{\mathfrak{m}}$-modules as an Abelian category, without the need of a Mora-like algorithm. The reduction also yields, as a by-product, a complexity estimation for the ideal membership problem over local polynomial rings. Finally, in the case of localized polynomial rings we demonstrate the computational advantage of our homologically motivated alternative approach in comparison to an existing implementation of Mora's algorithm.Comment: Fixed a typo in the proof of Lemma 4.3 spotted by Sebastian Posu