Related papers: Space-Efficient Bimachine Construction Based on th…
In this work, we present a general method to establish properties of multi-dimensional continuous-time Markov chains representing stochastic reaction networks. This method consists of grouping states together (via a partition of the state…
Composition of weighted transducers is a fundamental algorithm used in many applications, including for computing complex edit-distances between automata, or string kernels in machine learning, or to combine different components of a speech…
Computational modeling of assembly is challenging for many systems because their timescales vastly exceed those accessible to simulations. This article describes the MultiMSM, which is a general framework that uses Markov state models…
Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…
The principle of superposition is a key ingredient for quantum mechanics. A recent work [M. Oszmaniec et al., Phys. Rev. Lett. 116, 110403 (2016)] has shown that a quantum adder that deterministically generates a superposition of two…
A semiclassical method for the calculation of tunneling exponent in systems with many degrees of freedom is developed. We find that corresponding classical solution as function of energy form several branches joint by bifurcation points. A…
We introduce a novel approach for decomposing and learning every scale of a given multiscale objective function in $\mathbb{R}^d$, where $d\ge 1$. This approach leverages a recently demonstrated implicit bias of the optimization method of…
We consider a class of finite state three-tape transducers which models the operation of shuffling and splitting words. We present them as automata over the so-called Shuffling Monoid. These automata can be seen as either shufflers or…
A confined system of non-interacting electrons, subject to the combined effect of a time-dependent potential and different external chemical-potentials, is considered. The current flowing through such a system is obtained for arbitrary…
We propose a novel design paradigm for multistate machines where transitions from one state to another are organized by bifurcations of multiple equilibria of the energy landscape describing the collective interactions of the machine…
This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular…
Effective Hamiltonians are usually constructed by using canonical transformations or projection techniques. In contrast to this, we present a method for systems with arbitrary Hilbert space based on the introduction of cumulants. Cumulants…
Biomolecular machines transduce between different forms of energy. These machines make directed progress and increase their speed by consuming free energy, typically in the form of nonequilibrium chemical concentrations. Machine dynamics…
This paper formulates and studies the concepts of approximate (alternating) bisimulation relations characterizing equivalence relations between interconnected systems and their abstractions. These equivalence relations guarantee that the…
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use optical crossbar Switches and fiber Delay Lines (SDL). In this…
Single-electron transistors have been proposed to be used as a read-out device for Cooper pair charge qubits. Here we show that a coupled superconducting transistor at a threshold voltage is much more effective in measuring the state of a…
The stabiliser formalism allows the efficient description of a sizeable class of pure as well as mixed quantum states of N-qubit systems. That same formalism has important applications in the field of quantum error correcting codes, where…
Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible. The problem of checking whether there…
A method to generate reactive trajectories, namely equilibrium trajectories leaving a metastable state and ending in another one is proposed. The algorithm is based on simulating in parallel many copies of the system, and selecting the…
Quantum devices featuring mid-circuit measurement and reset capabilities, such as quantum computers and dual-species Rydberg quantum simulators, enable the realization of quantum cellular automata. These systems evolve in discrete time…