Related papers: Insignificant Choice Polynomial Time: A Logic Capt…
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…
Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…
Infinite time Turing machines (ITTMs) have been introduced by Hamkins and Lewis in their seminal article arXiv:math/9808093. The strength of the model comes from a limit rule which allows the ITTM to compute through ordinal stages. This…
Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well-understood that any non-trivial problem studied is undecidable…
In this paper, we present an optimal filter for linear time-varying continuous-time stochastic systems that simultaneously estimates the states and unknown inputs in an unbiased minimum-variance sense. We first show that the unknown inputs…
Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems…
Image-Text Matching (ITM) task, a fundamental vision-language (VL) task, suffers from the inherent ambiguity arising from multiplicity and imperfect annotations. Deterministic functions are not sufficiently powerful to capture ambiguity,…
The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the number of variables, from one where every assignment fails to…
Non-Hermitian systems satisfying parity-time (PT) symmetry have aroused considerable interest owing to their exotic features. Anti-PT symmetry is an important counterpart of the PT symmetry, and has been studied in various classical…
Topology and symmetry play critical roles in characterizing quantum phases of matter. Recent advancements have unveiled symmetry-protected topological (SPT) phases in many-body systems as a unique class of short-range entangled states,…
We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.…
Exclusion processes became paradigmatic models of nonequilibrium interacting particle systems of wide range applicability both across the natural and the applied, social and technological sciences. Usually they are defined as a…
Symmetry protected topological (SPT) phases with gapless edge excitations have been shown to exist in principle in strongly interacting bosonic/fermionic systems and it is highly desirable to find practical systems to realize such phases…
We present extensive numerical simulations of a family of non-equilibrium Potts models with absorbing states that allows for a variety of scenarios, depending on the number of spin states and the range of the spin-spin interactions. These…
In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for sub-quadratic time inapproximability. We show that the distributed PCP theorem can be…
The hallmark of symmetry-protected topological (SPT) phases is the existence of anomalous boundary states, which can only be realized with the corresponding bulk system. In this work, we show that for every Hermitian anomalous boundary mode…
For closed quantum systems, topological orders are understood through the equivalence classes of ground states of gapped local Hamiltonians. The generalization of this conceptual paradigm to open quantum systems, however, remains elusive,…
In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…
In this paper, we provide a deterministic polynomial time algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficiency and yet provides a low enough bound, that efficient…
Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…