Related papers: The Complexity of Boolean State Separation (Techni…

We identify a nontrivial 4-state Landau-Zener model for which transition probabilities between any pair of diabatic states can be determined analytically and exactly. The model describes an experimentally accessible system of two…

We study the ground state properties of bosons in a tilted double-well system. We use fidelity susceptibility to identify the possible ground state transitions under different tilt values. For a very small tilt (for example $10^{-10}$), two…

We introduce a class of states so-called semi-SSPPT (semi super strong positive partial transposition) states in infinite-dimensional bipartite systems by the Cholesky decomposition in terms of operator matrices and show that every…

Entanglement is a quantum resource, in some ways analogous to randomness in classical computation. Inspired by recent work of Gheorghiu and Hoban, we define the notion of "pseudoentanglement'', a property exhibited by ensembles of…

There has been great interest in identifying tractable subclasses of NP complete problems and designing efficient algorithms for these tractable classes. Constraint satisfaction and Bayesian network inference are two examples of such…

This paper studies the minimum observability of probabilistic Boolean networks (PBNs), the main objective of which is to add the fewest measurements to make an unobservable PBN become observable. First of all, the algebraic form of a PBN is…

Reliable methods for the classification and quantification of quantum entanglement are fundamental to understanding its exploitation in quantum technologies. One such method, known as Separable Neural Network Quantum States (SNNS), employs…

This paper focuses on proposing a general control framework for large-scale Boolean networks (\texttt{BNs}). Only by the network structure, the concept of structural controllability for \texttt{BNs} is formalized. A necessary and sufficient…

We propose a new method for computing the language intersection of two Time Petri nets (TPN); that is the sequence of labels in timed traces common to the execution of two TPN. Our approach is based on a new product construction between…

We present a general description of separable states in Quantum Mechanics. In particular, our result gives an easy proof that inseparabitity (or entanglement) is a pure quantum (noncommutative) notion. This implies that distinction between…

Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…

Separable Bayesian Networks, or the Influence Model, are dynamic Bayesian Networks in which the conditional probability distribution can be separated into a function of only the marginal distribution of a node's neighbors, instead of the…

We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a…

Capturing stochastic behaviors in business and work processes is essential to quantitatively understand how nondeterminism is resolved when taking decisions within the process. This is of special interest in process mining, where event data…

In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on…

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…

A Boolean control network (BCN) is a discrete-time dynamical system whose variables take values from a binary set $\{0,1\}$. At each time step, each variable of the BCN updates its value simultaneously according to a Boolean function which…

Based on total variance of a pair of Einstein-Podolsky-Rosen (EPR) type operators, the generalized EPR entangled states in continuous variable systems are defined. We show that such entangled states must correspond with two-mode squeezing…

In this paper, we present the construction of tensor network states (TNS) for some of the degenerate ground states of 3D stabilizer codes. We then use the TNS formalism to obtain the entanglement spectrum and entropy of these ground-states…

Quantum phase transitions between different topologically ordered phases exhibit rich structures and are generically challenging to study in microscopic lattice models. In this work, we propose a tensor-network solvable model that allows us…