Quantum Dynamics of Systems Connected by a Canonical Transformation

Quantum Hamiltonian systems corresponding to classical systems related by a general canonical transformation are considered. The differential equation to find the unitary operator, which corresponds to the canonical transformation and connects quantum states of the original and transformed systems, is obtained. The propagator associated with their wave functions is found by the unitary operator. Quantum systems related by a linear canonical point transformation are analyzed. The results are tested by finding the wave functions of the under-, critical-, and over-damped harmonic oscillator from the wave functions of the harmonic oscillator, free-particle system, and negative harmonic potential system, using the unitary operator to connect them, respectively.     

Metaplectic Representation of ospq(1/2) Algebra and Basic Hypergeometric Functions

In this paper we use the bosonic realization of osp_q(1/2) algebra to obtain its metaplectic representation. The group element for this algebra is shown to be described in terms of the basic hypergeometric function.     

Design of a widely tunable laser with a chirped ladder filter

We theoretically investigated a digitally tunable laser with a chirped ladder filter and a ring resonator to obtain a wide wavelength tuning range covering the whole C- or L- band. The clear relation between the tuning range and laser structure, especially the ladder filter, is described analytically. The introduction of a chirped structure into a ladder filter is effective in achieving both wide tunability and a stable lasing mode. A numerical simulation based on multimode rate equations shows that a tuning range of over 40 nm and a mode suppression ratio over 40 dB can be achieved by introducing a chirped ladder filter.     

De Bruijn cycles for covering codes

A de Bruijn covering code is a q‐ary string S so that every q‐ary string is at most R symbol changes from some n‐word appearing consecutively in S. We introduce these codes and prove that they can have size close to the smallest possible covering code. The proof employs tools from field theory, probability, and linear algebra. Included is a table of the best known bounds on the lengths of small binary de Bruijn covering codes, up to R = 11 and n = 13, followed by several open questions in this area. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004