Derived equivalences for symmetric groups and sl2- categorification

We define and study sl2-categorifications on abelian categories. We show in particular that there is a self-derived (even homotopy) equivalence categorifying the adjoint action of the simple reflection. We construct categorifications for blocks of symmetric groups and deduce that two blocks are splendidly Rickard equivalent whenever they have isomorphic defect groups and we show that this implies Brou´e’s abelian defect group conjecture for symmetric groups. We give similar results for general linear groups over finite fields. The constructions extend to cyclotomic Hecke algebras. We also construct categorifications for category O of gln(C) and for rational representations of general linear groups over ¯Fp, where we deduce that two blocks corresponding to weights with the same stabilizer under the dot action of the affine Weyl group have equivalent derived (and homotopy) categories, as conjectured by Rickard

Quantum Computers, Factoring, and Decoherence

In a quantum computer any superposition of inputs evolves unitarily into the corresponding superposition of outputs. It has been recently demonstrated that such computers can dramatically speed up the task of finding factors of large numbers -- a problem of great practical significance because of its cryptographic applications. Instead of the nearly exponential ($\sim \exp L^{1/3}$, for a number with $L$ digits) time required by the fastest classical algorithm, the quantum algorithm gives factors in a time polynomial in $L$ ($\sim L^2$). This enormous speed-up is possible in principle because quantum computation can simultaneously follow all of the paths corresponding to the distinct classical inputs, obtaining the solution as a result of coherent quantum interference between the alternatives. Hence, a quantum computer is sophisticated interference device, and it is essential for its quantum state to remain coherent in the course of the operation. In this report we investigate the effect of decoherence on the quantum factorization algorithm and establish an upper bound on a ``quantum factorizable'' $L$ based on the decoherence suffered per operational step.Comment: 7 pages,LaTex + 2 postcript figures in a uuencoded fil

Holographic data storage in a DX-center material

We report on the optical storage of digital data in a semiconductor sample containing DX centers. The diffraction efficiency and the bit-error-rate performance of multiplexed data images are shown to agree well with a simple model of the material. Uniform storage without an exposure schedule is demonstrated. The volume sensitivity is found to be ~10^3 times that of LiNBO3:Fe. The importance of coherent addition of scattered light with diffracted light in holographic data storage is discussed

Deutsch-Jozsa algorithm as a test of quantum computation

A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of the use of entanglement between the qubits in the algorithm and provides criteria for deciding when the Deutsch-Jozsa algorithm constitutes a meaningful test of quantum computation.Comment: 10 pages, 2 figures, RevTex, Approved for publication in Phys Rev

Sudden death of effective entanglement

Sudden death of entanglement is a well-known effect resulting from the finite volume of separable states. We study the case when the observer has a limited measurement capability and analyse the effective entanglement, i.e. entanglement minimized over the output data. We show that in the well defined system of two quantum dots monitored by single electron transistors, one may observe a sudden death of effective entanglement when real, physical entanglement is still alive. For certain measurement setups, this occurs even for initial states for which sudden death of physical entanglement is not possible at all. The principles of the analysis may be applied to other analogous scenarios, such as etimation of the parameters arising from quantum process tomography.Comment: final version, 5 pages, 3 figure