English
Related papers

Related papers: Algebraic Equations in State Condition

200 papers

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

Symbolic Computation · Computer Science 2024-06-13 Cordian Riener , Robin Schabert , Thi Xuan Vu

A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all…

Quantum Physics · Physics 2008-08-14 Jonathan Walgate , A. J. Scott

We show that the Hilbert functor of points on an arbitrary separated algebraic stack is an algebraic space. We also show the algebraicity of the Hilbert stack of points on an algebraic stack and the algebraicity of the Weil restriction of…

Algebraic Geometry · Mathematics 2014-09-19 David Rydh

We consider the problem of existence of bound entangled states with non-positive partial transpose (NPT). As one knows, existence of such states would in particular imply nonadditivity of distillable entanglement. Moreover it would rule out…

Quantum Physics · Physics 2010-08-09 Łukasz Pankowski , Marco Piani , Michał Horodecki , Paweł Horodecki

In this paper, we argue that holographic complexity should be a basis-dependent quantity. Computational complexity of a state is defined as a minimum number of gates required to obtain that state from the reference state. Due to this…

High Energy Physics - Theory · Physics 2018-08-15 Koji Hashimoto , Norihiro Iizuka , Sotaro Sugishita

We present a new approach to quantum computation involving the geometric phase. In this approach, an entire computation is performed by adiabatically evolving a suitably chosen quantum system in a closed circuit in parameter space. The…

Quantum Physics · Physics 2007-05-23 David R. Mitchell

We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamiltonian contains one-local terms, then this task can be NP-hard.…

Quantum Physics · Physics 2020-04-07 Joel Klassen , Milad Marvian , Stephen Piddock , Marios Ioannou , Itay Hen , Barbara Terhal

One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…

Commutative Algebra · Mathematics 2017-11-13 Richard Gustavson , Omar León Sánchez

Beyond the simplest case of bipartite qubits, the composite Hilbert space of multipartite systems is largely unexplored. In order to explore such systems, it is important to derive analytic expressions for parameters which characterize the…

Quantum Physics · Physics 2013-10-04 S. Agarwal , S. M. Hashemi Rafsanjani

This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…

funct-an · Mathematics 2007-05-23 Joachim Kupsch , Oleg G. Smolyanov

Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivalently, the problem is to decide whether a particular type of…

Quantum Physics · Physics 2014-09-19 Sergey Bravyi , Cristopher Moore , Alexander Russell

We provide necessary and sufficient conditions for separability of mixed states of n-particle systems. The conditions are formulated in terms of maps which are positive on product states of $n-1$ particles. The method of providing of the…

Quantum Physics · Physics 2009-11-06 Michal Horodecki , Pawel Horodecki , Ryszard Horodecki

In this article, we describe the relation between the properties of being equational noetherian and ascending chain condition on ideals of an arbitrary algebra. We also give a formulation of Hilbert's basis theorem for varieties of algebras…

Algebraic Geometry · Mathematics 2013-08-16 M. Shahryari

In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other problem classes including certain mathematical programs under…

Optimization and Control · Mathematics 2026-01-27 Pavel Dvurechensky , Meggie Marschner , Shimrit Shtern , Mathias Staudigl

Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced…

Computational Complexity · Computer Science 2009-08-19 Ketan D. Mulmuley

We extend the invariant manifold method for analyzing the asymptotics of dissipative partial differential equations on unbounded spatial domains to treat equations in which the linear part has order greater than two. One important example…

Mathematical Physics · Physics 2007-05-23 J. -P. Eckmann , C. E. Wayne

The status of the quantum state is perhaps the most controversial issue in the foundations of quantum theory. Is it an epistemic state (state of knowledge) or an ontic state (state of reality)? In realist models of quantum theory, the…

Quantum Physics · Physics 2014-04-30 M. S. Leifer

The following problem is NP-hard: given a regular expression $E$, decide if $E^*$ is not co-finite.

Discrete Mathematics · Computer Science 2008-06-30 Zhi Xu , J. Shallit

Analyzing the properties of entanglement in many-particle spin-1/2 systems is generally difficult because the system's Hilbert space grows exponentially with the number of constituent particles, $N$. Fortunately, it is still possible to…

Quantum Physics · Physics 2007-05-23 John K. Stockton , JM Geremia , Andrew C. Doherty , Hideo Mabuchi
‹ Prev 1 3 4 5 6 7 10 Next ›