Related papers: (Un)decidable Problems about Reachability of Quant…
We argue that it is fundamentally impossible to recover information about quantum superpositions when a system has interacted with a sufficiently large number of degrees of freedom of the environment. This is due to the fact that gravity…
In quantum systems theory one of the fundamental problems boils down to: given an initial state, which final states can be reached by the dynamic system in question. Here we consider infinite dimensional open quantum dynamical systems…
We study the problem of computing the reachable principals of simulation preorder and the reachable blocks of simulation equivalence. Following a theoretical investigation of the decidability and complexity aspects of this problem, which in…
This paper studies the set of terminal state covariances that are reachable over a finite time horizon from a given initial state covariance for a linear stochastic system with additive noise. For discrete-time systems, a complete…
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…
Various topics concerning the entanglement of composite quantum systems are considered with particular emphasis concerning the strict relations of such a problem with the one of attributing objective properties to the constituents. In…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…
We explore the sense in which the state of a physical system may or may not be regarded (an) observable in quantum mechanics. Simple and general arguments from various lines of approach are reviewed which demonstrate the following no-go…
Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time…
A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…
Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few.…
Quantum uncertainty relations impose fundamental limits on the joint knowledge that can be acquired from complementary observables: perfect knowledge of a quantum state in one basis implies maximal indetermination in all other mutually…
Hybrid systems - more precisely, their mathematical models - can exhibit behaviors, like Zeno behaviors, that are absent in purely discrete or purely continuous systems. First, we observe that, in this context, the usual definition of…
In quantum systems, entanglement corresponds to nonclassical correlation of nonlocal observables. Thus, entanglement (or, to the contrary, separability) of a given quantum state is not uniquely determined by properties of the state, but may…
The separability and entanglement of quantum mixed states in $\Cb^2 \otimes \Cb^3 \otimes \Cb^N$ composite quantum systems are investigated. It is shown that all quantum states $\rho$ with positive partial transposes and rank $r(\rho)\leq…
We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input,…
We consider the master/slave parameterised reachability problem for networks of pushdown systems, where communication is via a global store using only non-atomic reads and writes. We show that the control-state reachability problem is…
This work identifies a necessary condition for any variational quantum approach to reach the exact ground state. Briefly, the norms of the projections of the input and the ground state onto each group module must match, implying that module…
We study the reachability problem for networks of timed communicating processes. Each process is a timed automaton communicating with other processes by exchanging messages over unbounded FIFO channels. Messages carry clocks which are…
A quantum system subject to external fields is said to be controllable if these fields can be adjusted to guide the state vector to a desired destination in the state space of the system. Fundamental results on controllability are reviewed…