Related papers: A Transaction Represented with Weighted Finite-Sta…
Many social, technological, biological, and economical systems are best described by weighted networks, whose properties and dynamics depend not only on their structures but also on the connection weights among their nodes. However, most…
State redistribution allows one party to optimally send part of her state to another party. Here we show that this can be derived simply from two applications of coherent state-merging. This provides a protocol whereby a middle party acts…
Directional motion towards a specified destination is a common occurrence in physical processes and human societal activities. Utilizing this prior information can significantly improve the control and predictive performance of system…
In this paper, we study the problem of stabilizing switched linear systems when only limited information about the state and the mode of the system is available, which occurs in many applications involving networked switched systems (such…
Bistable autonomous systems can be found inmany areas of science. When the intrinsic noise intensity is large, these systems exhibits stochastic transitions from onemetastable steady state to another. In electronic bistable memories, these…
Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concepts in trading networks-multi-sided matching markets with…
We develop a cross-border market model for two countries based on a continuous trading mechanism, in which the transmission capacities that enable transactions between market participants from different countries are limited. Our market…
Two quantum systems, each described as a random-matrix ensemble. are coupled to each other via a number of transition states. Each system is strongly coupled to a large number of channels. The average transmission probability is the product…
We introduce a new primitive for quantum communication that we term "state targeting" wherein the goal is to pass a test for a target state even though the system upon which the test is performed is submitted prior to learning the target…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
Stochastic systems feature, in general, both coherent dynamics and incoherent transitions between different states. We propose a method to identify the coherent part in the full counting statistics for the transitions. The proposal is…
In this paper, we investigate signatures of topological phase transitions in interacting systems. We show that the key signature is the existence of a topologically protected level crossing, which is robust and sharply defines the…
Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two…
In this manuscript, we investigate symbolic abstractions that capture the behavior of piecewise-affine systems under input constraints and bounded external noise. This is accomplished by considering local affine feedback controllers that…
Accurate calculation of switching events is important for electromagnetic transient simulation to obtain reliable results. The common presumption of continuous differential state variables could prevent the accurate calculation, thus…
We extend variational quantum optimization algorithms for Quadratic Unconstrained Binary Optimization problems to the class of Mixed Binary Optimization problems. This allows us to combine binary decision variables with continuous decision…
We present a novel mathematical framework for the specification and analysis of fault-resilient distributed protocols and their implementations, with the following components: 1. Transition systems that allow the specification and analysis…
Well-structured systems, aka WSTSs, are computational models where the set of possible configurations is equipped with a well-quasi-ordering which is compatible with the transition relation between configurations. This structure supports…
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…
Motivated by the multivariate wavelet theory, and by the spectral theory of transfer operators, we construct an abstract affine structure and a multiresolution associated to a matrix-valued weight. We describe the one-to-one correspondence…