Related papers: Uniformity within Parameterized Circuit Classes
We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…
This paper investigates the verification and synthesis of parameterized protocols that satisfy leadsto properties $R \leadsto Q$ on symmetric unidirectional rings (a.k.a. uni-rings) of deterministic and constant-space processes under no…
In the paper a new sufficient condition for the Aubin property to a class of parameterized variational systems is derived. In these systems the constraints depend both on the parameter as well as on the decision variable itself and they…
In this letter, we describe and develop edge-based and node-based formulations for combined-cycle units (CCUs) with different levels of accuracy in respecting physical restrictions of each turbine, from no restriction requirement of each…
We define different classes of local random quantum circuits (L-RQC) and show that: a) statistical properties of L-RQC are encoded into an associated family of completely positive maps and b) average purity dynamics can be described by the…
We study the uniform verification problem for infinite state processes, which consists of proving that the parallel composition of an arbitrary number of processes satisfies a temporal property. Our practical motivation is to build a…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
Quantum unitaries of the form $\Sigma_{c}\ket{c}\bra{c}\otimes U_{c}$ are ubiquitous in quantum algorithms. This class encompasses not only standard uniformly controlled gates (UCGs) but also a wide range of circuits with uniformly…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
We provide a characterisation of the continuous-time Markov models where the Markov matrices from the model can be parameterised directly in terms of the associated rate matrices (generators). That is, each Markov matrix can be expressed as…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
We consider the model checking problem of infinite state systems given in the form of parameterized discrete timed networks with multiple clocks. We show that this problem is decidable with respect to specifications given by B- or…
Complex systems typically have many different parts and facets, with different characteristics. In a multi-paradigm approach to modeling, formalisms with different natures are used in combination to describe complementary parts and aspects…
This paper establishes problem-specific sample complexity lower bounds for linear system identification problems. The sample complexity is defined in the PAC framework: it corresponds to the time it takes to identify the system parameters…
The paper studies the output-feedback synchronization problem for a network of identical, linear time-invariant systems. A criterion to test network synchronization is derived and the class of output-feedback synchronizable systems is…
Boolean circuits abstract away from physical details to focus on the logical structure and computational behaviour of digital components. Although such circuits have been studied for many decades, compositionality has been widely ignored or…
We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient…
A new graph-based order parameter is introduced for the characterization of atomistic structures. The order parameter is universal to any material/chemical system, and is transferable to all structural geometries. Three sets of data are…
We propose the Parity Flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Clifford gates can be understood as a recoding of quantum…
We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…