Entangled quantum states are an important component of quantum computing techniques such as quantum error-correction, dense coding and quantum teleportation. We describe how to generate fully entangled states in the Hilbert space C N C N starting from a unitary matrix and show that they form an orthonormal basis in this space. Disentanglement is also discussed. Moreover we also calculate the Wi...

There has recently been interest in the use of orthonor-mal bases for the purposes of SISO system identiication. Concurrently, but separately, there has also been vigorous work on estimation of MIMO systems by computa-tionally cheap and reliable schemes. These latter ideas have collectively become known as`4SID' methods. This paper is a contribution overlapping these two schools of thought by s...

The c l a s s i f i c a t i o n o f a s e t o f p a t t e r n s i s a p rob lem t h a t appears i n v e r y many f i e l d s . I n g e n e r a l , the number o f p o s s i b l e c l asses i s unknown. To d e f i n e a d i s t a n c e ( o r s i m i l a r i t y ) m a t r i x on the s e t o f p a t t e r n s , we must summarize the a v a i l a b l e da te i n the fo rm o f a f i n i t e s e t o f ...

In this paper a general transform theory is presented that underlies expansions of stable discrete-time transfer functions in terms of rational orthonormal bases. The types of bases considered are generated by cascade connections of stable all-pass functions. If the all-pass sections in such a network are all equal, this gives rise to the Hambo basis construction. In this paper a more general c...

The Local Cosine Decomposition of Coifman and Wickerhauser 1] is modiied by incorporating two degrees of freedom that increase the adaptability of the best basis. These are relative shifts between resolution levels and adaptive polarity foldings. The resultant expansion is shift-invariant, and yields adaptive time-frequency distributions which are characterized by high resolution, high concentr...

We study the roundoff error propagation in an algorithm which computes the orthonormal basis of a Krylov subspace with Householder orthonormal matrices . Moreover, we analyze special implementations of the classical GMRES algorithm, and of the Full Orthogonalization Method . These techniques approximate the solution of a large sparse linear system of equations on a sequence of Krylov subspaces ...

We invert the Fredholm equation representing the light scattered by a single spherical particle or a distribution of spherical particles to obtain the particle size distribution function and refractive index. We obtain the solution by expanding the distribution function as a linear combination of a set of orthonormal basis functions. The set of orthonormal basis functions is composed of Schmidt...

out-of-core singular-value-decomposition algorithm. The algorithm is designed for tall narrow matrices that are too large to fit in main memory and are stored on disks. We have implemented the algorithm and combined it with a larger eigensolver code to obtain the electronic states of a semiconductor nanocrystal. The computationalchemistry application requires finding an orthonormal basis for a ...

Many nonlinear systems can be described by a Wiener-Schetzen model. In this model, the linear dynamics are formulated in terms of orthonormal basis functions (OBFs). The nonlinearity is modeled by a multivariate polynomial. In general, an infinite number of OBFs is needed for an exact representation of the system. This paper considers the approximation of a Wiener system with finite-order infin...