Related papers: Classical and quantum satisfiability
The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…
We demonstrate that any logical problem can be solved by Bayesian inference. In this approach, the distinction between complexity classes vanishes. The method is illustrated by solving the 3-SAT problem in polynomial time. Beyond this,…
This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT), an archetypal NP-complete problem, with the help of machine learning techniques. Despite the great success of modern SAT solvers to solve large…
Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
In this article we propose a solution to the measurement problem in quantum mechanics. We point out that the measurement problem can be traced to an a priori notion of classicality in the formulation of quantum mechanics. If this notion of…
The quantum logical `or' is analyzed from a physical perspective. We show that it is the existence of EPR-like correlation states for the quantum mechanical entity under consideration that make it nonequivalent to the classical situation.…
This paper demonstrates that P \not= NP. The way was to generalize the traditional definitions of the classes P and NP, to construct an artificial problem (a generalization to SAT: The XG-SAT, much more difficult than the former) and then…
We consider quantum versions of two well-studied classical learning models: Angluin's model of exact learning from membership queries and Valiant's Probably Approximately Correct (PAC) model of learning from random examples. We give…
We perform an analytic semi-classical quantization of the straight QCD string with one end fixed and a massless quark on the other, in the limits of orbital and radial dominant motion. We compare our results to the exact numerical…
Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical…
Regular signed SAT is a variant of the well-known satisfiability problem in which the variables can take values in a fixed set V \subset [0,1], and the `literals' have the form "x \le a" or "x \ge a". We answer some open question regarding…
I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a…
The complexity class QMA is the quantum analog of the classical complexity class NP. The functional analogs of NP and QMA, called functional NP (FNP) and functional QMA (FQMA), consist in either outputting a (classical or quantum) witness,…
Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard…
The classical limit of quantum q-oscillators suggests an interpretation of the deformation as a way to introduce non linearity. Guided by this idea, we considered q-fields, the partition fumction, and compute a consequence on specific heat…
The investigation of quantum-classical correspondence may lead to gain a deeper understanding of the classical limit of quantum theory. We develop a quantum formalism on the basis of a linear-invariant theorem, which gives an exact…
We show that classical and quantum Kolmogorov complexity of binary strings agree up to an additive constant. Both complexities are defined as the minimal length of any (classical resp. quantum) computer program that outputs the…
A novel parallel algorithm for solving the classical Decision Boolean Satisfiability problem with clauses in conjunctive normal form is depicted. My approach for solving SAT is without using algebra or other computational search strategies…
When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell…