Related papers: The Complexity of Boolean State Separation (Techni…
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…
A network of delay-coupled logistic maps exhibits two different synchronization regimes, depending on the distribution of the coupling delay times. When the delays are homogeneous throughout the network, the network synchronizes to a…
We study bipartite entanglement in systems of N identical bosons distributed in M different modes. For such systems, a definition of separability not related to any a priori Hilbert space tensor product structure is needed and can be given…
A tree tensor network is proposed for the entanglement distillation of large N SU(N)1 Chern-Simons theory and Riemann surfaces, adopting a proposal of Bao, et al. This is illustrated for the entanglement entropy S(A) of a bipartite…
Computing the entanglement of formation of a bipartite state is generally difficult, but special symmetries of a state can simplify the problem. For instance, this allows one to determine the entanglement of formation of Werner states and…
Transition-based parsers implemented with Pointer Networks have become the new state of the art in dependency parsing, excelling in producing labelled syntactic trees and outperforming graph-based models in this task. In order to further…
Probabilistic representations, such as Bayesian and Markov networks, are fundamental to much of statistical machine learning. Thus, learning probabilistic representations directly from data is a deep challenge, the main computational…
We extend an operational characterization of entanglement in terms of stabilizer groups from pure states to mixed states. For a density matrix $\rho_{AB}$, a stabilizer is a factorized unitary matrix $u_A \otimes u_B$ that, under…
We show that the bipartite separability of a pure qubit state hinges critically on the combinatorial structure of its computational-basis support. Using Boolean cube geometry, we introduce a taxonomy that distinguishes support-guaranteed…
The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward…
We present the notion of stateful priorities for imposing precise restrictions on system actions, in order to meet safety constraints. By using stateful priorities we are able to exclusively restrict erroneous system behavior as specified…
The challenging task of learning structures of probabilistic graphical models is an important problem within modern AI research. Recent years have witnessed several major algorithmic advances in structure learning for Bayesian…
The reachability semantics for Petri nets can be studied using open Petri nets. For us an "open" Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the…
To model a complex system intrinsically separated by a barrier, we use two random Hamiltonians, coupled to each other either by a tunneling matrix element or by an intermediate transition state. We study that model in the universal limit of…
The concept of gapped symmetry-protected topological (SPT) states has been generalized to gapless SPT (gSPT) states. Similar to gapped SPT states, gSPT states in one dimension exhibit universal degeneracies in their entanglement spectra.…
The linearity of quantum operations puts many fundamental constraints on the information processing tasks we can achieve on a quantum system whose state is not exactly known, just as we observe in quantum cloning and quantum discrimination.…
Applying the results of Ref.[1], we carry out the non-abelian bosonization for a class of free fermion symmetry-protected topological states (SPTs). The resulting boson theories are non-linear sigma models with topological $\theta$ term,…
A state feedback control strategy is proposed for input-output (IO) decoupling of a class of fully output controllable Boolean control networks (BCNs). Some necessary and sufficient conditions for BCN IO-decoupling are presented. As an…
Quantum states are the key mathematical objects in quantum mechanics, and entanglement lies at the heart of the nascent fields of quantum information processing and computation. However, there has not been a general, necessary and…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…