Related papers: Phase transition in the Countdown problem
We consider the problem of recovering an unknown $k$-factor, hidden in a weighted random graph. For $k=1$ this is the planted matching problem, while the $k=2$ case is closely related to the planted travelling salesman problem. The…
Decision-making problems can be modeled as combinatorial optimization problems with Constraint Programming formalisms such as Constrained Optimization Problems. However, few Constraint Programming formalisms can deal with both optimization…
Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through…
We study a random matrix model for the statistical properties of the purity of a bipartite quantum system at a finite (fictitious) temperature. This enables us to write the generating function for the cumulants, for both balanced and…
We report a kind of quantum phase transition which takes place in isolated quantum systems with non-thermal equilibrium states and an extra symmetry that commutes with the Hamiltonian for any values of the system parameters. A critical…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
Models for quantum computation with circuit connections subject to the quantum superposition principle have been recently proposed. There, a control quantum system can coherently determine the order in which a target quantum system…
For a system of N identical particles in a random pure state, there is a threshold k_0 = k_0(N) ~ N/5 such that two subsystems of k particles each typically share entanglement if k > k_0, and typically do not share entanglement if k < k_0.…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
Phase transitions in many complex combinational problems have been widely studied in the past decade. In this paper, we investigate phase transitions in the knowledge compilation empirically, where DFA, OBDD and d-DNNF are chosen as the…
Heuristic methods for solution of problems in the NP-Complete class of decision problems often reach exact solutions, but fail badly at "phase boundaries", across which the decision to be reached changes from almost always having one value…
Recently, it was shown that there is a phase transition in the community detection problem. This transition was first computed using the cavity method, and has been proved rigorously in the case of $q=2$ groups. However, analytic…
In this paper we argue that one-way quantum computation can be seen as a form of phase transition with the available information about the solution of the computation being the order parameter. We draw a number of striking analogies between…
Classifying phases of matter is a central problem in physics. For quantum mechanical systems, this task can be daunting owing to the exponentially large Hilbert space. Thanks to the available computing power and access to ever larger data…
Game theory formalizes certain interactions between physical particles or between living beings in biology, sociology, and economics, and quantifies the outcomes by payoffs. The prisoner's dilemma (PD) describes situations in which it is…
The evolution of cooperative behaviour is studied in the deterministic version of the Prisoners' Dilemma on a two-dimensional lattice. The payoff parameter is set at the critical region $1.8 < b < 2.0$ , where clusters of cooperators are…
Machine learning algorithms provide a new perspective on the study of physical phenomena. In this paper, we explore the nature of quantum phase transitions using multi-color convolutional neural-network (CNN) in combination with quantum…
Phase estimation is a quantum algorithm for measuring the eigenvalues of a Hamiltonian. We propose and rigorously analyse a randomized phase estimation algorithm with two distinctive features. First, our algorithm has complexity independent…
We consider a topological Hamiltonian and establish a correspondence between its eigenstates and the resource for a causal order game introduced in Ref. [1] known as process matrix. We show that quantum correlations generated in the quantum…