Abstract not found

Abstract not found

We systematically investigate the factorization of causal finite impulse response (FIR) paraunitary filterbanks with given filter length. Based on the singular value decomposition of the coefficient matrices of the polyphase representation, a fundamental order-one factorization form is first proposed for general paraunitary systems. Then, we develop a new structure for the design and implementation of paraunitary system based on the decomposition of Hermitian unitary matrices. Within this framework, the linear-phase filterbank and pairwise mirror-image symmetry filterbank are revisited. Their structures are special cases of the proposed general structures. Compared with the existing structures, more efficient ones that only use approximately half the number of free parameters are derived. The proposed structures are complete and minimal. Although the factorization theory with or without constraints is discussed in the framework of-channel filterbanks, the results can be applied to wavelets and multiwavelet systems and could serve as a general theory for paraunitary systems.

Three extensions and reinterpretations of nonclassical probabilities are reviewed.

Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the physical limit has an operational meaning in agreement with the Abel sums of infinite series. The formal analogies to accelerated (hyper-) computers and the recursion theoretic diagonal methods are discussed. As quantum information is not bound by the mutually exclusive states of classical bits, it allows a consistent representation of fixed point states of the diagonal operator. In an effort to reconstruct the self-contradictory feature of diagonalization, a generalized diagonal method allowing no quantum fixed points is proposed.

For the unitary operator, solution of the Schrödinger equation corresponding to a time-varying Hamiltonian, the relation between the Magnus and the product of exponentials expansions can be expressed in terms of a system of first order differential equations in the parameters of the two expansions, often referred to as Wei-Norman formula. It is shown how to use Wei-Norman formul for the purposes of quantum computing.

Quantum information and computation is the new hype in physics. It is promising, mindboggling and even already applicable in cryptography, with good prospects ahead. A brief, rather subjective outline is presented.

As quantum parallelism allows the effective co-representation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary operators whose eigenvalues are different from one.

Abstract not found

Two entangled particles in threedimensional Hilbert space (per particle) are considered in an EPR-type arrangement. On each side the Kochen-Specker observables {J 2 1,J 2 2,J 2 3} and { ¯ J 2 1, ¯ J 2 2,J 2 3} with [J 2 1, ¯ J 2 1] ̸= 0 are measured. The outcomes of measurements of J 2 3 (via J 2 1,J 2 2) and J 2 3 (via ¯ J 2 1, ¯ J 2 2) are compared. Although formally J 2 3 is associated with the same projection operator, quantum contextuality requires that the outcome depends on the complete disposition of the measurement apparatus, in particular whether J 2 1 or ¯ J 2 1 is measured alongside. Besides complementarity, contextuality [1, 2, 3, 4, 5] is another, more subtle nonclassical feature of quantum mechanics. That is, one and the same physical observable may appear different, depending on the context of measurement; i.e., depending on the particular way it was inferred. Stated differently, the outcome of a physical measurement may depend also on other physical measurements which are coperformed. In Bell’s own words [1, section 5], “The result of an