A canonical result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of 2-qubit projectors
Πij on a system of
n qubits, and the task is to decide whether the Hamiltonian
H=∑Πij has a 0-eigenvalue, or it is larger than
1/nα for some
α=O(1). The problem is not only a natural extension of the classical 2-SAT problem to the quantum case, but is also equivalent to the problem of finding the ground state of 2-local frustration-free Hamiltonians of spin
21, a well-studied model believed to capture certain key properties in modern condensed matter physics. While Bravyi has shown that the quantum 2-SAT problem has a classical polynomial-time algorithm, the running time of his algorithm is
O(n4). In this paper we give a classical algorithm with linear running time in the number of local projectors, therefore achieving the best possible complexity.
A well-known result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of 2-qubit projectors
Πij on a system of
n qubits, and the task is to decide whether the Hamiltonian
H=∑Πij has a 0-eigenvalue, or all eigenvalues are greater than
1/nα for some
α=O(1). The problem is not only a natural extension of the classical 2-SAT problem to the quantum case, but is also equivalent to the problem of finding a ground state of 2-local frustration-free Hamiltonians of spin
21, a well-studied model believed to capture certain key properties in modern condensed matter physics. Bravyi has shown that the quantum 2-SAT problem has a deterministic algorithm of complexity
O(n4) in the algebraic model of computation where every arithmetic operation on complex numbers can be performed in unit time, and
n is the number of variables. In this paper we give a deterministic algorithm in the algebraic model with running time
O(n+m), where
m is the number of local projectors, therefore achieving the best possible complexity in that model. We also show that if in the input every number has a constant size representation then the bit complexity of our algorithm is
O((n+m)M(n)), where
M(n) denotes the complexity of multiplying two
n-bit integers. A conference version of this paper appeared in the Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), 2016.
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm requires a running time that grows as a polynomial in the number of bits. In this paper we present numerical results on randomly generated instances of an NP-complete problem and of a problem that can be solved classically in polynomial time. We simulate a quantum computer (of up to 16 qubits) by integrating the Schrodinger equation on a conventional computer. For both problems considered, for the set of instances studied, the required running time appears to grow slowly as a function of the number of bits.
A canonical result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of 2-qubit projectors Q_{ij} on a system of n qubits, and the task is to decide whether the Hamiltonian H = sum Q_{ij} has a 0-eigenvalue, or it is larger than 1/n^c for some c = O(1). The problem is not only a natural extension of the classical 2-SAT problem to the quantum case, but is also equivalent to the problem of finding the ground state of 2-local frustration-free Hamiltonians of spin 1/2, a well-studied model believed to capture certain key properties in modern condensed matter physics. While Bravyi has shown that the quantum 2-SAT problem has a classical polynomial-time algorithm, the running time of his algorithm is O(n^4). In this paper we give a classical algorithm with linear running time in the number of local projectors, therefore achieving the best possible complexity.
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the 3-SAT problem, the prototypical NP-complete problem which allows general programming of all NP problems. We use Rydberg atom graphs, each of which consists of Rydberg atom dimers and trimers coupled with quantum wires in the Rydberg blockade interaction regime, to formulate general Boolean expressions, and obtain their many-body ground states to determine the satisfiabilities of the given 3-SAT problem instances quantum mechanically.
Quantum propositional logic, introduced by Birkhoff and von Neumann, formalizes reasoning about experimental propositions in quantum mechanics through closed subspaces of Hilbert spaces. We provide a comprehensive complexity analysis of the satisfiability problem for quantum logic formulas over the connectives conjunction, disjunction, and negation. Distinguishing between weak satisfiability (evaluation to a nonzero subspace) and strong satisfiability (evaluation to the full space), we establish that both notions coincide with Boolean satisfiability for dimension one, are classically NP complete for dimension two, and become complete for the Blum Shub Smale class NP_R when dimension d >= 3 is fixed. Our principal contribution is twofold. First, we present two alternative constructive reductions from quantum logic satisfiability to the Existential Theory of the Reals (ETR): a realification based encoding that explicitly handles the complex to real translation through commutant characterizations, and a rank one column encoding with orthogonal splitting gadgets. Both reductions yield polynomial size systems of quadratic equations for fixed dimension, proving membership in the complexity class existsR and hence in PSPACE via Cannys algorithm. Second, we provide detailed size bounds distinguishing weak and strong satisfiability: weak satisfiability encodes with O(n D^2 + N_v D) scalar variables where n is the number of atoms, D the real dimension, and N_v the number of disjunctions, while strong satisfiability requires O(n D^2 + N_v D^2) variables due to basis vector witnesses. When dimension is part of the input, strong satisfiability becomes polynomial time equivalent to feasibility of noncommutative integer polynomial equations. These results position quantum logic satisfiability precisely between classical NP and existsR, highlighting dimension as a fundamental complexity parameter.