منابع مشابه
Monotone 3-Sat-4 is NP-complete
Monotone 3-Sat-4 is a variant of the satisfiability problem for boolean formulae in conjunctive normal form. In this variant, each clause contains exactly three literals—either all or none of them are positive, i. e., no clause contains both a positive and a negative literal—and every variable appears at most four times in the formula. Moreover, every clause consists of three distinct literals....
متن کاملQuantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete
We show that the quantum SAT problem is QMA1-complete when restricted to interactions between a three-dimensional particle and a five-dimensional particle. The best previously known result is for particles of dimensions 4 and 9. The main novel ingredient of our proof is a certain Hamiltonian construction named the Triangle Hamiltonian. It allows to verify the application of a 2-qubit CNOT gate ...
متن کاملThree "quantum" algorithms to solve 3-SAT
We propose three quantum algorithms to solve the 3-SAT NP-complete decision problem. The first algorithm builds, for any instance φ of 3-SAT, a quantum Fredkin circuit that computes a superposition of all classical evaluations of φ in a given output line. Similarly, the second and third algorithms compute the same superposition on a given register of a quantum register machine, and as the energ...
متن کاملComputing quantum discord is NP-complete
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum disc...
متن کاملAbout Inverse 3-SAT
The Inverse 3–SAT problem is known to be coNP Complete: Given φ a set of models on n variables, is there a 3–CNF formula such that φ is its exact set of models ? An immediate candidate formula F 3 φ arises, which is the conjunction of all 3–clauses satisfied by all models in φ. The (co)Inverse 3–SAT problem can then be resumed: Given φ a set of models on n variables, is there a model of F 3 φ /...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2016
ISSN: 0097-5397,1095-7111
DOI: 10.1137/140957056