Central elements of the elliptic Zn monodromy matrix algebra at roots of unity

The central elements of the algebra of monodromy matrices associated with the Z(n) R-matrix are studied. When the crossing parameter w takes a special rational value w = n/N, where N and n are positive coprime integers, the center is substantially larger than that in the generic case for which the quantum determinant provides the center. In the trigonometric limit, the situation corresponds to the quantum group at roots of unity. This is a higher rank generalization of the recent results by Belavin and Jimbo. (c) 2004 Elsevier B.V. All rights reserved.

Braided m-Lie algebras

Braided m-Lie algebras induced by multiplication are introduced, which generalize Lie algebras, Lie color algebras and quantum Lie algebras. The necessary and sufficient conditions for the braided m-Lie algebras to be strict Jacobi braided Lie algebras are given. Two classes of braided m-Lie algebras are given, which are generalized matrix braided m-Lie algebras and braided m-Lie subalgebras of End(F)M, where M is a Yetter-Drinfeld module over B with dimB < infinity. In particular, generalized classical braided m-Lie algebras sl(q,f)(GM(G)(A),F) and osp(q,l)(GM(G)(A),M,F) of generalized matrix algebra GMG(A) are constructed and their connection with special generalized matrix Lie superalgebra sl(s,f)(GM(Z2)(A(s)),F) and orthosymplectic generalized matrix Lie super algebra osp(s,l) (GM(Z2)(A(s)),M-s,F) are established. The relationship between representations of braided m-Lie algebras and their associated algebras are established.

Comment on "Grover search with pairs of trapped ions"

In this Comment on Feng's paper [Phys. Rev. A 63, 052308 (2001)], we show that Grover's algorithm may be performed exactly using the gate set given, provided that small changes are made to the gate sequence. An analytic expression for the probability of success of Grover's algorithm for any unitary operator U instead of Hadamard gate is presented.

Full S matrix calculation via a single real-symmetric Lanczos recursion: The Lanczos artificial boundary inhomogeneity method

We present an efficient and robust method for the calculation of all S matrix elements (elastic, inelastic, and reactive) over an arbitrary energy range from a single real-symmetric Lanczos recursion. Our new method transforms the fundamental equations associated with Light's artificial boundary inhomogeneity approach [J. Chem. Phys. 102, 3262 (1995)] from the primary representation (original grid or basis representation of the Hamiltonian or its function) into a single tridiagonal Lanczos representation, thereby affording an iterative version of the original algorithm with greatly superior scaling properties. The method has important advantages over existing iterative quantum dynamical scattering methods: (a) the numerically intensive matrix propagation proceeds with real symmetric algebra, which is inherently more stable than its complex symmetric counterpart; (b) no complex absorbing potential or real damping operator is required, saving much of the exterior grid space which is commonly needed to support these operators and also removing the associated parameter dependence. Test calculations are presented for the collinear H+H-2 reaction, revealing excellent performance characteristics. (C) 2004 American Institute of Physics.