Computational Complexity of Quantum Satisfiability

@article{Herrmann2011ComputationalCO,
  title={Computational Complexity of Quantum Satisfiability},
  author={Christian Herrmann and Martin Ziegler},
  journal={2011 IEEE 26th Annual Symposium on Logic in Computer Science},
  year={2011},
  pages={175-184}
}
  • C. HerrmannM. Ziegler
  • Published 10 April 2010
  • Mathematics, Computer Science
  • 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Quantum logic generalizes, and in dimension one coincides with, Boolean propositional logic. We introduce the weak and strong satisfiability problem for quantum logic formulas, and show both NP-complete in dimension two as well. For higher-dimensional spaces R^d and C^d with d>2 fixed, on the other hand, we show the problem to be complete for the nondeterministic Blum-Shub-Smale model of real computation. This provides a unified view on both Turing and real BSS complexity theory, and adds (a… 

Figures from this paper

On the complexity of equational decision problems for finite height(ortho)complemented modular lattices

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe

On the consistency problem for modular lattices and related structures

The consistency problem for a class of algebraic structures asks for an algorithm to decide, for any given conjunction of equations, whether it admits a non-trivial satisfying assignment within some member of the class, and unsolvability of the consistency problem is derived.

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines

A new discrete complexity class between NP and PSPACE is exhibited based on questions about expressions built from cross products only, and several problems have been shown complete under many-one reduction by polynomial-time Turing machines for this class.

ON THE SATISFIABILITY PROBLEM FOR CLASSES OF STRUCTURES RELATED TO FINITE DIMENSIONAL VECTOR SPACES

We establish unsolvability of the satisfiability problem in the following cases: conjunctions of equations within any class of (bounded) lattices of subspaces resp. endomorphism rings associated with

Definable relations in finite-dimensional subspace lattices with involution

For a large class of finite dimensional inner product spaces V, over division $$*$$∗-rings F, we consider definable relations on the subspace lattice $$\mathsf{L}(V)$$L(V) of V, endowed with the

On the complexity of equational decision problems for finite height complemented and orthocomplemented modular lattices

We study the computational complexity of the satisfiability problem and the complement of the equivalence problem for complemented (orthocomplemented) modular lattices L and classes thereof.

Quantifier free definable relations on finite dimensional subspace lattices with involution

For finite dimensional hermitean inner product spaces $V$, over $*$-fields $F$, and in the presence of orthogonal bases providing form elements in the prime subfield of $F$, we show that quantifier

On geometric representations of modular ortholattices

A pre-orthogonality on a projective geometry is a symmetric binary relation, ⊥, such that for each point $${p, p^{\perp} = \{q | p \perp q \}}$$p,p⊥={q|p⊥q} is a subspace. An orthogonality is a

A Note on the "Third Life of Quantum Logic"

The purpose of this note is to discuss some of the questions raised by Dunn, J. Michael; Moss, Lawrence S.; Wang, Zhenghan in Editors' introduction: the third life of quantum logic: quantum logic

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons

It is shown that recognizing visibility graphs of polygons with holes is Existential Theory of the Reals Complete, which is the complexity class of problems that can be reduced to the problem of deciding whether there exists a solution to a quantifier-free formula F(X1,X2,...,Xn).

References

SHOWING 1-10 OF 136 REFERENCES

A theory of computation based on quantum logic (I)

  • M. Ying
  • Philosophy
    2005 IEEE International Conference on Granular Computing
  • 2005

On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines

We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-complete

Quantum logic as motivated by quantum computing

In this note, some observations about quantum logic as motivated by quantum computing are made and it is hoped more people will explore this connection.

Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem

  • S. BasuT. Zell
  • Mathematics, Computer Science
    2009 50th Annual IEEE Symposium on Foundations of Computer Science
  • 2009
This paper forms and proves a real analogue of Toda’s theorem, and is able to relate the computational hardness of two extremely well-studied problems in algorithmic semi-algebraic geometry: the problem of deciding sentences in the first-order theory of the reals with a constant number of quantifier alternations, and that of computing Betti numbers of semi- algebraic sets.

Complexity of modal logic

A Link between Quantum Logic and Categorical Quantum Mechanics

AbstractAbramsky and Coecke (Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 415–425, IEEE Comput. Soc., New York, 2004) have recently introduced an approach to finite

Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

It is proved that, for all k ∈ N, the FPSPACE-hardness of the problem of computing the kth Betti number of the set of real zeros of a given integer polynomial holds with respect to the singular homology as well as for the Borel-Moore homology.

Quantum computation from a quantum logical perspective

  • J. Bub
  • Computer Science
    Quantum Inf. Comput.
  • 2007
The salient features of the information-processing in the three algorithms are presented from a different perspective, in terms of the way in which the algorithms exploit the non-Boolean quantum logic represented by the projective geometry of Hilbert space.

Exotic Quantifiers, Complexity Classes, and Complete Problems

It turns out that infinitesimal and generic quantifiers can be eliminated, so that the relevant complexity classes can be described in terms of the usual quantifiers only.
...