Related papers: Algebraic Equations in State Condition

For operators representing ill-posed problems, an ordering by ill-posedness is proposed, where one operator is considered more ill-posed than another one if the former can be expressed as a cocatenation of bounded operators involving the…

Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in…

Let $G$ be a commutative algebraic group defined over a number field $K$ that is disjoint over $K$ to $\mathbb G_a$ and satisfies the condition of semistability. Consider a linear form $l$ on the Lie algebra of $G$ with algebraic…

We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show…

Study of an N qubit mixed symmetric separable states is a long standing challenging problem as there exist no unique separability criterion. In this regard, we take up the N-qubit mixed symmetric separable states for a detailed study as…

For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…

Starting from arbitrary Hilbert spaces, we reduce the problem to verify entanglement of any bipartite quantum state to finite dimensional subspaces. Hence, entanglement is a finite dimensional property. A generalization for multipartite…

Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results rely on reductions from a handful of undecidable problems,…

In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is NP-hard. We consider the problem when k = 2. In regards to…

In this paper, by constructing extremely hard examples of CSP (with large domains) and SAT (with long clauses), we prove that such examples cannot be solved without exhaustive search, which is stronger than P $\neq$ NP. This constructive…

The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is regular. In this work we answer to the problem posed as an…

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…

We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…

We compare the 'Smith is Huq' condition (SH) with three commutator conditions in semi-abelian categories: first an apparently weaker condition which arose in joint work with Bourn and turns out to be equivalent with (SH), then an apparently…

A superqubit, belonging to a $(2|1)$-dimensional super-Hilbert space, constitutes the minimal supersymmetric extension of the conventional qubit. In order to see whether superqubits are more nonlocal than ordinary qubits, we construct a…

A parametrization of multipartite separable states in a finite-dimensional Hilbert space is suggested. It is proved to be a diffeomorphism between the set of zero-trace operators and the interior of the set of separable density operators.…

We review the problem of discriminating entangled states from separable states for bipartite systems. We formally define what entangled states are, present some important criteria to detect entanglement, and show how they can be classified…

Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many NP-hard problems can be expressed as integer programs, in…

In this paper, we present the necessary and sufficient conditions of separability for bipartite pure states in infinite dimensional Hilbert spaces. Let $M$ be the matrix of the amplitudes of $\ket\psi$, we prove $M$ is a compact operator.…

This paper investigates an extremely classic NP-complete problem: How to determine if a graph G, where each vertex has a degree of at most 4, can be 3-colorable(The research in this paper focuses on graphs G that satisfy the condition where…