Related papers: Insignificant Choice Polynomial Time: A Logic Capt…
Prompt Learning has recently gained great popularity in bridging the gap between pretraining tasks and various downstream tasks. It freezes Pretrained Language Models (PLMs) and only tunes a few task-related parameters (prompts) for…
Quantum mechanics contains some strange unphysical concepts. Among these are complex numbers, Hilbert spaces with their unitary and self-adjoint operators, states represented by complex vectors, superpositions of states, collapse of wave…
Classical CTL temporal logics are built over systems with interleaving model concurrency. Many attempts are made to fight a state space explosion problem (for instance, compositional model checking). There are some methods of reduction of a…
We consider three classification systems for distributed decision tasks: With unbounded computation and certificates, defined by Balliu, D'Angelo, Fraigniaud, and Olivetti [JCSS'18], and with (two flavors of) polynomially bounded local…
Partially observable Markov decision processes (POMDPs) provide a modeling framework for autonomous decision making under uncertainty and imperfect sensing, e.g. robot manipulation and self-driving cars. However, optimal control of POMDPs…
Quantum phase transitions (QPTs) in coherent Ising machines (CIMs) are studied via a spectral mapping between the one-dimensional XY spin model and a network of degenerate optical parametric oscillators (DOPOs). This exact correspondence…
In this work, we propose Asynchronous Perception Machine (APM), a computationally-efficient architecture for test-time-training (TTT). APM can process patches of an image one at a time in any order asymmetrically and still encode…
Any repeated use of a fixed experimental instrument is subject to memory effects. We design an estimation method uncovering the details of the underlying interaction between the system and the internal memory without having any experimental…
Recently developed parity ($\mathcal{P}$) and time-reversal ($\mathcal{T}$) symmetric non-Hermitian quantum theory is envisioned to have far-reaching implications in basic science and applications. It is known that the $PT$-inner product is…
Conventional thermodynamics, which is formulated for our world populated by radiation and matter, can be extended to describe physical properties of antimatter in two mutually exclusive ways: CP-invariant or CPT-invariant. Here we refer to…
This paper presents an algorithm that generates the conditional moment inequalities that characterize the identified set of the common parameter of various semi-parametric panel multinomial choice models. I consider both static and dynamic…
The fixed template Promise Constraint Satisfaction Problem (PCSP) is a recently proposed significant generalization of the fixed template CSP, which includes approximation variants of satisfiability and graph coloring problems. All the…
The termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs.…
$\mathcal{PT}$-symmetric quantum mechanics has been considered an important theoretical framework for understanding physical phenomena in $\mathcal{PT}$-symmetric systems, with a number of $\mathcal{PT}$-symmetry related applications. This…
Physics takes for granted that interacting physical systems with no common history are independent, before their interaction. This principle is time-asymmetric, for no such restriction applies to systems with no common future, after an…
In this short communication it is discussed the relation between disentangled states and algorithmic information theory aiming to construct an irreducible sentence whose length increases in a non-polynomial way when the number of qubits…
We propose a new class of synthetic optical materials in which the refractive index satisfies $n(-\bx)=-n^*(\bx)$. We term such systems antisymmetric parity-time (APT) structures. Unlike PT-symmetric systems which require balanced gain and…
We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of Automatic Constraint Satisfaction Problem ($AutCSP$), where…
In a recent study [C Arita, Phys. Rev. E 80, 051119 (2009)], an extension of the M/M/1 queueing process with the excluded-volume effect as in the totally asymmetric simple exclusion process (TASEP) was introduced. In this paper, we consider…
We studied parity-time (PT) symmetric trimer systems that feature open and closed boundaries. The exceptional point is three-state coalescence at zero energy because of chiral symmetry in the open trimer; however, two-state coalescence…