Related papers: Phase transition for Minesweeper
Gibbs sampling is fundamental to a wide range of computer algorithms. Such algorithms are set to be replaced by physics based processors$-$be it quantum or stochastic annealing devices$-$which embed problem instances and evolve a physical…
We consider concurrent games played by two-players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study a…
The quantum advantage arising in a simplified multi-player quantum game, is found to be a disadvantage when the game's qubit-source is corrupted by a noisy "demon". Above a critical value of the corruption-rate, or noise-level, the coherent…
We analyze the replicator-mutator equations for the Rock-Paper-Scissors game. Various graph-theoretic patterns of mutation are considered, ranging from a single unidirectional mutation pathway between two of the species, to global…
In this work, we introduce a new toolkit for analyzing cloning games, a notion that captures stronger and more quantitative versions of the celebrated quantum no-cloning theorem. This framework allows us to analyze a new cloning game based…
We investigate the fate of dissipative phase transitions in quantum many-body systems when the individual constituents are qudits ($d$-level systems) instead of qubits. As an example system, we employ a permutation-invariant $XY$ model of…
I present an analytic approach to establishing the presence of phase transitions in a large set of decision problems. This approach does not require extensive computational study of the problems considered. The set -- that of all paddable…
The Value Problem for weighted timed games (WTGs) consists in determining, given a two-player weighted timed game with a reachability objective and a rational threshold, whether or not the value of the game exceeds the threshold. This…
We investigate the dynamics of a conservative version of Conway's Game of Life, in which a pair consisting of a dead and a living cell can switch their states following Conway's rules but only by swapping their positions, irrespective of…
The study of phase transition phenomenon of NP complete problems plays an important role in understanding the nature of hard problems. In this paper, we follow this line of research by considering the problem of counting solutions of…
We analyze the crossing of a quantum critical point based on exact results for the transverse XY model. In dependence of the change rate of the driving field, the evolution of the ground state is studied while the transverse magnetic field…
The perceived risk and reward for a given situation can vary depending on resource availability, accumulated wealth, and other extrinsic factors such as individual backgrounds. Based on this general aspect of everyday life, here we use…
We study an exactly solvable model of monitored dynamics in a system of $N$ spin-$1/2$ particles with pairwise all-to-all noisy interactions, where each spin is constantly perturbed by weak measurements of the spin component in a random…
The scaling invariance for chaotic orbits near a transition from unlimited to limited diffusion in a dissipative standard mapping is explained via the analytical solution of the diffusion equation. It gives the probability of observing a…
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on {\it lossy channel systems}, under the constraint that both players are restricted to finite-memory strategies. First, we describe a general…
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NP-complete. The Mastermind is a popular game which can be turned into a logical puzzle called Mastermind Satisfiability Problem in a similar spirit to the…
Phase transitions appear all over science, and are familiar from everyday life, as water boiling, sugar melting into caramel or as nematic molecules turning smectic in liquid-crystal displays. The dynamics of phase transitions can be…
This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner's Dilemma, repeated for a finite length of time. We show that a minimal bound on the players' computational…
Metallic states near the Mott insulator show a variety of quantum phases including various magnetic, charge ordered states and high-temperature superconductivity in various transition metal oxides and organic solids. The emergence of a…
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to undecidability. In…