Spin in a General Time Varying Magnetic Field: Generalization of the Adiabatic Factorization of Time Evolution

An extension of the adiabatic factorization of the time evolution operator is studied for spin in a general time varying magnetic field $B(t)$. When $B(t)$ changes adiabatically, such a factorization reduces to the product of the geometric operator which embodies the Berry phase phenomenon and a usual dynamical operator. For a general time variation of $B(t)$, there should be another operator $N(t)$ in the factorization that is related to non-adiabatic transitions. A simple and explicit expression for the instantaneous angular velocity of this operator is derived. This is done in a way that is independent of any specific representation of spin. Two classes of simple conditions are given under which the operator $N(t)$ can be made explicit. As a special case, a generalization of the traditional magnetic resonance condition is pointed out.Comment: 10 page

Self-Dual Conformal Supergravity and the Hamiltonian Formulation

In terms of Dirac matrices the self-dual and anti-self-dual decomposition of a conformal supergravity is given and a self-dual conformal supergravity theory is developed as a connection dynamic theory in which the basic dynamic variabes include the self-dual spin connection i.e. the Ashtekar connection rather than the triad. The Hamiltonian formulation and the constraints are obtained by using the Dirac-Bergmann algorithm. PACS numbers: 04.20.Cv, 04.20.Fy,04.65.+

Optimal Memoryless Encoding for Low Power Off-Chip Data Buses

Off-chip buses account for a significant portion of the total system power consumed in embedded systems. Bus encoding schemes have been proposed to minimize power dissipation, but none has been demonstrated to be optimal with respect to any measure. In this paper, we give the first provably optimal and explicit (polynomial-time constructible) families of memoryless codes for minimizing bit transitions in off-chip buses. Our results imply that having access to a clock does not make a memoryless encoding scheme that minimizes bit transitions more powerful.Comment: Proceedings of the 2006 IEEE/ACM international Conference on Computer-Aided Design (San Jose, California, November 05 - 09, 2006). ICCAD '06. ACM, New York, NY, 369-37

Realizing quantum controlled phase-flip gate through quantum dot in silicon slow-light photonic crystal waveguide

We propose a scheme to realize controlled phase gate between two single photons through a single quantum dot in slow-light silicon photonic crystal waveguide. Enhanced Purcell factor and beta factor lead to high gate fidelity over broadband frequencies compared to cavity-assisted system. The excellent physical integration of this silicon photonic crystal waveguide system provides tremendous potential for large-scale quantum information processing.Comment: 9 pages, 3 figure

Linear scaling computation of the Fock matrix. IX. Parallel computation of the Coulomb matrix

We present parallelization of a quantum-chemical tree-code [J. Chem. Phys. {\bf 106}, 5526 (1997)] for linear scaling computation of the Coulomb matrix. Equal time partition [J. Chem. Phys. {\bf 118}, 9128 (2003)] is used to load balance computation of the Coulomb matrix. Equal time partition is a measurement based algorithm for domain decomposition that exploits small variation of the density between self-consistent-field cycles to achieve load balance. Efficiency of the equal time partition is illustrated by several tests involving both finite and periodic systems. It is found that equal time partition is able to deliver 91 -- 98 % efficiency with 128 processors in the most time consuming part of the Coulomb matrix calculation. The current parallel quantum chemical tree code is able to deliver 63 -- 81% overall efficiency on 128 processors with fine grained parallelism (less than two heavy atoms per processor).Comment: 7 pages, 6 figure