Branching rules of semi-simple Lie algebras using affine extensions

We present a closed formula for the branching coefficients of an embedding p in g of two finite-dimensional semi-simple Lie algebras. The formula is based on the untwisted affine extension of p. It leads to an alternative proof of a simple algorithm for the computation of branching rules which is an analog of the Racah-Speiser algorithm for tensor products. We present some simple applications and describe how integral representations for branching coefficients can be obtained. In the last part we comment on the relation of our approach to the theory of NIM-reps of the fusion rings of WZW models with chiral algebra g_k. In fact, it turns out that for these models each embedding p in g induces a NIM-rep at level k to infinity. In cases where these NIM-reps can be be extended to finite level, we obtain a Verlinde-like formula for branching coefficients.Comment: 11 pages, LaTeX, v2: one reference added, v3: Clarified proof of Theorem 2, completely rewrote and extended Section 5 (relation to CFT), added various references. Accepted for publication in J. Phys.

Quantum algorithms for problems in number theory, algebraic geometry, and group theory

Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same problem appears to be intractable on classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article will review the current state of quantum algorithms, focusing on algorithms for problems with an algebraic flavor that achieve an apparent superpolynomial speedup over classical computation.Comment: 20 pages, lecture notes for 2010 Summer School on Diversities in Quantum Computation/Information at Kinki Universit