Related papers: Algebraic Equations in State Condition
We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…
We consider the separability of various joint states for N qutrits. We derive two results: (i) the separability condition for a two-qutrit state that is a mixture of the maximally mixed state and a maximally entangled state (such a state is…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
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…
We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.
We prove that Hilbert's Tenth Problem for a ring of integers in a number field K has a negative answer if K satisfies two arithmetical conditions (existence of a so-called division-ample set of integers and of an elliptic curve of rank one…
We study the dynamics of a quantum system having Hilbert space of finite dimension $d_{\mathrm{H}}$. Instabilities are possible provided that the master equation governing the system's dynamics contain nonlinear terms. Here we consider the…
Different versions of the notion of a state have been formulated for various so-called quantum structures. In this paper, we investigate the interplay among states on synaptic algebras and on its sub-structures. A synaptic algebra is a…
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be $\NP$-complete on arbitrary…
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…
We consider the two weight problem for the Hilbert transform, namely the question of finding real-variable characterization of those pair of weights for which the Hilbert transform acts boundedly on $ L ^2 $ of the weights. Such a…
In quantum many-body systems with kinetically constrained dynamics, the Hilbert space can split into exponentially many disconnected subsectors, a phenomenon known as Hilbert-space fragmentation. We study the interplay of such fragmentation…
We aim to find conditions on two Hilbert space operators $A$ and $B$ under which the expression $AX-XB$ having low rank forces the operator $X$ itself to admit a good low rank approximation. It is known that this can be achieved when $A$…
In this paper, we give new explicit representations of the Hilbert scheme of $\mu$ points in $\PP^{r}$ as a projective subvariety of a Grassmanniann variety. This new explicit description of the Hilbert scheme is simpler than the previous…
The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula $C$, are well-known {\it NP}-complete problems. Here we…
In this article, we study an opposite problem of universal quantum state comparison, that is unambiguous determining whether multiple unknown quantum states from a Hilbert space are orthogonal or not. We show that no unambiguous quantum…
Quantum mechanics is formulated on a Hilbert space that is assumed to be separable. However, there seems to be no clear reason justifying this assumption. Does it have physical implications? We answer in the positive by proposing a test…
Necessary and sufficient conditions for bipartite entanglement are derived, which apply to arbitrary Hilbert spaces. Motivated by the concept of witnesses, optimized entanglement inequalities are formulated solely in terms of arbitrary…
We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…
We study approximations of compact linear multivariate operators defined over Hilbert spaces. We provide necessary and sufficient conditions on various notions of tractability. These conditions are mainly given in terms of sums of certain…