Related papers: Partial decidability protocol for the Wang tiling …
Distinguishability plays a major role in quantum and statistical physics. When particles are identical their wave function must be either symmetric or antisymmetric under permutations and the number of microscopic states, which determines…
I discuss the analytic structure of thermodynamic quantities for complex values of thermodynamic variables within Landau theory. In particular, the singularities connected with phase transitions of second order, first order and cross over…
We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…
The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of $\mathbb{Z}^2$-subshifts of finite type are standard problems of symbolic dynamics. In this article we study these questions with horizontal…
We characterize finite-time thermodynamic processes of multidimensional quadratic overdamped systems. Analytic expressions are provided for heat, work, and dissipation for any evolution of the system covariance matrix. The Bures-Wasserstein…
Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in…
The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…
The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…
This paper proposes a new algorithm for an automatic variable selection procedure in High Dimensional Graphical Models. The algorithm selects the relevant variables for the node of interest on the basis of mutual information. Several…
We show within the framework of relativistic quantum tasks that the doability of any task is fully determined by a small subset of its parameters that we call its "coarse causal structure", as well as the distributed computation it aims to…
In any bipartition of a quantum state, it is proved that the negative values of the conditional version of sandwiched Tsallis relative entropy necessarily implies quantum entanglement. For any N, the separability ranges in the $1:N-1$…
Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with…
We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing…
We present a quantum annealing-based solution method for topology optimization (TO). In particular, we consider TO in a more general setting, i.e., applied to structures of continuum domains where designs are represented as distributed…
The partial scaling transform of the density matrix for multiqubit states is introduced to detect entanglement of quantum states. The transform contains partial transposition as a special case. The scaling transform corresponds to partial…
Many multiscale problems have a high contrast, which is expressed as a very large ratio between the media properties. The contrast is known to introduce many challenges in the design of multiscale methods and domain decomposition…
The wide-spread opinion is that original quantum mechanics is a reversible theory, but this statement is only true for undecomposed systems, that are those systems which sub-systems are out of consideration. Taking sub-systems into account,…
Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
In this paper we construct nonlinear partial differential equations in more than 3 independent variables, possessing a manifold of analytic solutions with high, but not full, dimensionality. For this reason we call them ``partially…