Despite significant advances in quantum algorithms, quantum programs in practice are often
expressed at the circuit level, forgoing helpful structural abstractions common to their …

A univariate polynomial f over a field is decomposable if f= goh= g (h) for nonlinear
polynomials g and h. It is intuitively clear that the decomposable polynomials form a small …

The study of quantum algorithms is stymied by a lack of human intuition—many of these
algorithms appear to rely on non-intuitive attributes unique to quantum mechanics, and as …

Designing and implementing systems as an interconnection of smaller subsystems is a
common practice for modularity and standardization of components and design algorithms …

An idea of empirical mode decomposition (EMD) with Hilbert Transform (HT) as well as
cross-section of smoothed pseudo Wigner-Ville distribution (SPWVD) and instantaneous …

Polynomial decomposition has attracted considerable attention in computational
mathematics. In general, the field identifies polynomials f (x) and g (x) such that their …

This thesis discusses parameter estimation algorithms for a number of structures for system
representation that can be interpreted as different types of composition. We refer to the term …