Related papers: Algebraic Equations in State Condition
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…
We consider rotationally invariant states in $\mathbb{C}^{N_{1}}\ot \mathbb{C}^{N_{2}}$ Hilbert space with even $N_{1}\geq 4$ and arbitrary $N_{2}\geq N_{1}$, and show that in such case there always exist states which are inseparable and…
We consider initial value problems for differential-algebraic equations in a possibly infinite-dimensional Hilbert space. Assuming a growth condition for the associated operator pencil, we prove existence and uniqueness of solutions for…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
Integrable integral operator can be studied by means of a matrix Riemann--Hilbert problem. However, in the case of so-called integrable operators with shifts, the associated Riemann--Hilbert problem becomes operator valued and this…
We show that the conditional independence (CI) implication problem with bounded cardinalities, which asks whether a given CI implication holds for all discrete random variables with given cardinalities, is co-NEXPTIME-hard. The problem…
With any state of a multipartite quantum system its separability polytope is associated. This is an algebro-topological object (non-trivial only for mixed states) which captures the localisation of entanglement of the state. Particular…
We revisit the issue of the geometrical separability of the Hilbert space of physical states on lattice Abelian theories in the context of entanglement entropy. We discuss the conditions under which vectors in the Hilbert space, as well as…
Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n >= 1 over k. Then Hilbert's Tenth Problem for L is undecidable. In particular, Hilbert's Tenth Problem for…
The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…
Our first result is that a homogeneous form $F$ in $n$ variables is GIT semistable with respect to the natural $SL(n)$-action if and only if the first non-trivial Hilbert point of the associated Milnor algebra is semistable. We also prove…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
We study a set of truncated matrices, given by Smith~\cite{Smith2005}, in connection to an identification criterion for the ground state in our proposed quantum adiabatic algorithm for Hilbert's tenth problem. We identify the origin of the…
Recently [quant-ph/0608250] again created a lot of interest to prove the existence of bound entangled states with negative partial transpose (NPT) in any $d \times d (d \geq 3)$ Hilbert space. However the proof in quant-ph/0608250 is not…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
In this paper, we consider the maximum $k$-edge-colorable subgraph problem. In this problem we are given a graph $G$ and a positive integer $k$, the goal is to take $k$ matchings of $G$ such that their union contains maximum number of…
We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…