Related papers: Using Disentangled States and Algorithmic Informat…
We construct a model of the Open Graph Axiom (OGA) in which there is a 2-entangled Suslin line $S$. Consequently, in this model, there is a 2-entangled uncountable linear order, but no such order is separable. This resolves a problem posed…
Learning disentangled representations of natural language is essential for many NLP tasks, e.g., conditional text generation, style transfer, personalized dialogue systems, etc. Similar problems have been studied extensively for other forms…
In this paper we deal with a strongly ill-posed second-order degenerate parabolic problem in the unbounded open set $\Omega\times {\mathcal O}\subset \mathbb R^{M+N}$, related to a linear equation with unbounded coefficients, with no…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
We derive a sharp decomposition formula for the state polytope of the Hilbert point and the Hilbert-Mumford index of reducible varieties by using the decomposition of characters and basic convex geometry. This proof captures the essence of…
We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the…
This monograph presents a unified treatment of single- and multi-user problems in Shannon's information theory where we depart from the requirement that the error probability decays asymptotically in the blocklength. Instead, the error…
We construct entangled states with positive partial transposes using indecomposable positive linear maps between matrix algebras. We also exhibit concrete examples of entangled states with positive partial transposes arising in this way,…
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
We demonstrate how one can construct renormalizable perturbative expansion in formally nonrenormalizable higher dimensional scalar theories. It is based on 1/N-expansion and results in a logarithmically divergent perturbation theory in…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We construct a class of entangled states in $\mathcal{H}=\mathcal{H}_{A}\otimes\mathcal{H}_{B}\otimes\mathcal{H}_{C}$ quantum systems with $dim\mathcal{H}_{A}=dim\mathcal{H}_{B}=dim\mathcal{H}_{C}=2$ and classify those states with respect…
To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert's tenth problem, we consider two further classes of mathematically non-decidable problems, those of a modified version of the Hilbert's tenth…
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…
We give a decomposition formula for computing the state polytope of a reducible variety in terms of the state polytopes of its components.
We present a new method for expressing Chaitin's random real, Omega, through Diophantine equations. Where Chaitin's method causes a particular quantity to express the bits of Omega by fluctuating between finite and infinite values, in our…
We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues…
Disentanglement is the process which transforms a state $\rho$ of two subsystems into an unentangled state, while not effecting the reduced density matrices of each of the two subsystems. Recently Terno showed that an arbitrary state cannot…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…