Related papers: Phase transition in the knapsack problem
Living organisms process information to interact and adapt to their changing environment with the goal of finding food, mates or averting hazards. The structure of their niche has profound repercussions by both selecting their internal…
We study the time evolution of thermodynamic observables that characterise the dissipative nature of thermal relaxation after an instantaneous temperature quench. Combining tools from stochastic thermodynamics and large-deviation theory, we…
This paper studies a risk-sensitive decision-making problem under uncertainty. It considers a decision-making process that unfolds over a fixed number of stages, in which a decision-maker chooses among multiple alternatives, some of which…
We introduce a simple open-ended model that describes the emergence of a shared vocabulary. The ordering transition toward consensus is generated only by an agreement mechanism. This interaction defines a finite and small number of states,…
Temporal commonsense reasoning refers to the ability to understand the typical temporal context of phrases, actions, and events, and use it to reason over problems requiring such knowledge. This trait is essential in temporal natural…
One problem of wide interest involves estimating expected crossing-times. Several tools have been developed to solve this problem beginning with the works of Wald and the theory of sequential analysis. An extension of his approach is…
We study three aspects of work statistics in the context of the fluctuation theorem for the quantum spin chains up to $1024$ sites by numerical methods based on matrix-product states (MPS). First, we use our numerical method to evaluate the…
The question of a phase transition in exiting the Planck epoch of the early universe is addressed. An order parameter is proposed to help decide the issue, and estimates are made concerning its behavior. Our analysis is suggestive that a…
This work theoretically investigates the transition from topology to chaos in a periodically driven system consisting of a quantum top coupled to a spin-1/2 particle. The system is driven by two alternating interaction kicks per period. For…
The Knapsack Problem is a classic problem in combinatorial optimisation. Solving these problems may be computationally expensive. Recent years have seen a growing interest in the use of deep learning methods to approximate the solutions to…
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…
Natural selection drives species to develop brains, with sizes that increase with the complexity of the tasks to be tackled. Our goal is to investigate the balance between the metabolic costs of larger brains compared to the advantage they…
Adaptable computing is an increasingly important paradigm that specializes system resources to variable application requirements, environmental conditions, or user requirements. Adapting computing resources to variable application…
A two-state master equation based decision making model has been shown to generate phase transitions, to be topologically complex and to manifest temporal complexity through an inverse power-law probability distribution function in the…
An effective Hamiltonian describing interaction between generic "fast" and a "slow" systems is obtained in the strong interaction limit. The result is applied for studying the effect of quantum phase transition as a bifurcation of the…
Systems switching between different dynamical phases is an ubiquitous phenomenon. The general understanding of such a process is limited. To this end, we present a general expression that captures fluctuations of a system exhibiting a…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
We consider a type of optimal switching problems with non-uniform execution delays and ramping. Such problems frequently occur in the operation of economical and engineering systems. We first provide a solution to the problem by applying a…
The concept of statistical complexity is studied to characterize the classical kicked top model which plays important role in the qbit systems and the chaotic properties of the entanglement. This allows us to understand this driven…
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…