Related papers: Using Disentangled States and Algorithmic Informat…
Ensembles containing orthogonal product states are found to be indistinguishable under local operations and classical communication (LOCC), thereby showing irreversibility in the preparation and distinguishing processes, which is commonly…
It is found that the problem of existence of bound entangled states with non-positive partial transpose (NPPT) has the intriguing relation to the Hilbert's 17th problem. More precisely, we compute the expectation value of the partially…
Prior to the recent development of symplectic integrators, the time-stepping operator $\e^{h(A+B)}$ was routinely decomposed into a sum of products of $\e^{h A}$ and $\e^{hB}$ in the study of hyperbolic partial differential equations. In…
Quantum states can be written in infinitely many ways depending on the choices of basis. Schmidt decomposition of a quantum state has a lot of properties useful in the study of entanglement. All bipartite states admit Schmidt decomposition,…
In quantum information theory, it is a fundamental problem to construct multipartite unextendible product bases (UPBs). We show that there exist two families UPBs in Hilbert space…
The question whether all entangled states can be used as a nonclassical resource has remained open so far. Here we provide a conclusive answer to this problem for the case of systems shared by two parties. We show that any entangled state…
We use ``iterated square sequences'' to show: There is an L-definable partition n: L-singulars --> omega such that if M is an inner model without 0#: (a) For some n, M satisfies that {alpha | n(alpha)=n} is stationary. (b) For each n there…
It is shown in this paper that non-conforming finite elements on the triangle using $P^{1}$-nonconforming polynomials and $P^{2}$ -conforming polynomials can be easily built and used.They appear as an 'enriched' version of the standard…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
We report an approach to quantum open system dynamics that leads to novel nonlinear constant relations governing information flow among the participants. Our treatment is for mixed state systems entangled in a pure state fashion with an…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…
The halting probability of a Turing machine is the probability that the machine will halt if it starts with a random stream written on its one-way input tape. When the machine is universal, this probability is referred to as Chaitin's omega…
We present a generalization of quantum Stein's Lemma to the situation in which the alternative hypothesis is formed by a family of states, which can moreover be non-i.i.d.. We consider sets of states which satisfy a few natural properties,…
Nonlinear state-space modelling is a very powerful black-box modelling approach. However powerful, the resulting models tend to be complex, described by a large number of parameters. In many cases interpretability is preferred over…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…
In 1975 Chaitin introduced his \Omega number as a concrete example of random real. The real \Omega is defined based on the set of all halting inputs for an optimal prefix-free machine U, which is a universal decoding algorithm used to…
In the paper, we show that when a quantum state can be decomposed as a convex combination of locally orthogonal mixed states, its entanglement can be decomposed into the entanglement of these mixed states without losing them. The obtained…
We discuss an O(N) exension of the Sine-Gordon (S-G)equation which allows us to perform an expansion around the leading order in large-N result using Path-Integral methods. In leading order we show our methods agree with the results of a…