Related papers: The SAT Phase Transition
Based on the MFT arguments, a general description for discontinuous phase transitions in the presence temporal disorder is considered. Our analysis extends the recent findings [Phys. Rev. E {\bf 98}, 032129 (2018)] by considering other…
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all…
Parity-time (PT) symmetric systems have two distinguished phases, e.g., one with real energy eigenvalues and the other with complex conjugate eigenvalues. To enter one phase from the other, it is believed that the system must pass through…
The phase transition in the mean-field XY model is shown analytically to be related to a topological change in its configuration space. Such a topology change is completely described by means of Morse theory allowing a computation of the…
In recent years, quantum phase transitions have attracted the interest of both theorists and experimentalists in condensed matter physics. These transitions, which are accessed at zero temperature by variation of a non-thermal control…
The Boolean satisfiability problem (SAT) holds a central place in computational complexity theory as the first shown NP-complete problem. Due to this role, SAT is often used as the benchmark for polynomial-time reductions: if a problem can…
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…
Various phase transitions in models for coupled charge-density waves are investigated by means of the $\epsilon$-expansion, mean-field theory, and Monte Carlo simulations. At zero temperature the effective action for the system with…
The scalar field theory and the scalar electrodynamics quantized in the flat gap are considered. The dynamical effects arising due to the boundary presence with two types of boundary conditions (BC) satisfied by scalar fields are studied.…
In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN…
We study the problem of approximate ranking from observations of pairwise interactions. The goal is to estimate the underlying ranks of $n$ objects from data through interactions of comparison or collaboration. Under a general framework of…
Our general subject is the emergence of phases, and phase transitions, in large networks subjected to a few variable constraints. Our main result is the analysis, in the model using edge and triangle subdensities for constraints, of a sharp…
We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the…
In a quantum measurement, a coupling $g$ between the system S and the apparatus A triggers the establishment of correlations, which provide statistical information about S. Robust registration requires A to be macroscopic, and a dynamical…
Topological phase transition is accompanied with a change of topological numbers. It has been believed that the gap closing and the breakdown of the adiabaticity at the transition point is necessary in general. However, the gap closing is…
By viewing entanglement as a state function, a new kind of phase transition takes place: the geometric phase transition. This phenomenon occurs due to singularities in the shape of the entangled states set. It is shown how this result can…
We study the average-case complexity of the classic Minesweeper game in which players deduce the locations of mines on a two-dimensional lattice. Playing Minesweeper is known to be co-NP-complete. We show empirically that Minesweeper…
Boolean satisfiability (SAT) is a fundamental NP-complete problem with many applications, including automated planning and scheduling. To solve large instances, SAT solvers have to rely on heuristics, e.g., choosing a branching variable in…
Many combinatorial problems can be formulated as "Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?". An example of such a question is: given two k-colourings of a graph, can I transform the…
Boolean satisfiability problem (SAT) is fundamental to many applications. Existing works have used graph neural networks (GNNs) for (approximate) SAT solving. Typical GNN-based end-to-end SAT solvers predict SAT solutions concurrently. We…