Related papers: The Complexity of Boolean State Separation (Techni…
Given a Boolean network BN and a subset A of attractors of BN, we study the problem of identifying a minimal subset C of vertices of BN, such that the dynamics of BN can reach from a state s in any attractor As in A to any attractor At in A…
A Boolean network (BN) is a discrete dynamical system defined by a Boolean function that maps to the domain itself. A trap space of a BN is a generalization of a fixed point, which is defined as the sub-hypercubes closed by the function of…
Pseudoentangled states are defined by their ability to hide their entanglement structure: they are indistinguishable from random states to any observer with polynomial resources, yet can have much less entanglement than random states.…
Boolean automata networks (aka Boolean networks) are space-time discrete dynamical systems, studied as a model of computation and as a representative model of natural phenomena. A collection of simple entities (the automata) update their…
Two-dimensional Projected Entangled Pair States (PEPS) provide a unique framework giving access to detailed entanglement features of correlated (spin or electronic) systems. For a bi-partitioned quantum system, it has been argued that the…
We identify a nontrivial multistate Landau-Zener model for which transition probabilities between any pair of diabatic states can be determined analytically and exactly. In the semiclassical picture, this model features the possibility of…
This paper presents the following research findings on Boolean networks (BNs) and their dual subspaces.First, we establish a bijection between the dual subspaces of a BN and the partitions of its state set. Furthermore, we demonstrate that…
Tensor networks (TNs) are one of the best available tools to study many-body quantum systems. TNs are particularly suitable for one-dimensional local Hamiltonians, while their performance for generic geometries is mainly limited by two…
In recent years, the entanglement spectra of quantum states have been identified to be highly valuable for improving our understanding on many problems in quantum physics, such as classification of topological phases, symmetry-breaking…
A double--layer system in a strong perpendicular magnetic field is considered. We assume a random potential in each layer to be smooth. We also assume that there is no correlation between random potentials in different layers. Under these…
Boolean networks model finite discrete dynamical systems with complex behaviours. The state of each component is determined by a Boolean function of the state of (a subset of) the components of the network. This paper addresses the…
For many quantum information protocols such as state transfer, entanglement transfer and entanglement generation, standard notions of controllability for quantum systems are too strong. We introduce the weaker notion of accessible pairs,…
The asymmetric simple exclusion process (ASEP) is a model of particle transport used in the study of biological processes such as mRNA translation. In 2014, Zhao and Krishnan introduced a new approach for analyzing the ASEP using…
Many topologically nontrivial states of matter possess gapless degrees of freedom on the boundary, and when these boundary states delocalize into the bulk, a phase transition occurs and the system becomes topologically trivial. We show that…
The complexity of the promise constraint satisfaction problem $\operatorname{PCSP}(\mathbf{A},\mathbf{B})$ is largely unknown, even for symmetric $\mathbf{A}$ and $\mathbf{B}$, except for the case when $\mathbf{A}$ and $\mathbf{B}$ are…
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent,…
For any quantum state representing a physical system of identical particles, the density operator must satisfy the symmetrisation principle (SP) and for massive particles also conform to super-selection rules (SSR) that prohibit coherences…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…
This paper deals with the reachability analysis of {P,A}-Time Petri nets ({P,A}-TPN in short) in the context of strong semantics. It investigates the convexity of the union of state classes reached by different interleavings of the same set…
A probabilistic Boolean network (PBN) is a discrete-time system composed of a collection of Boolean networks between which the PBN switches in a stochastic manner. This paper focuses on the study of quotients of PBNs. Given a PBN and an…