Unitaries Permuting Two Orthogonal Projections

Let $P$ and $Q$ be two orthogonal projections on a separable Hilbert space, \calH. Wang, Du and Dou proved that there exists a unitary, $U$, with $UPU^{-1} =Q, \quad UQU^{-1} = P$ if and only if $\dim(\ker P \cap \ker(1-Q)) = \dim(\ker Q \cap \ker(1-P))$ (both may be infinite). We provide a new proof using the supersymmetric machinery of Avron, Seiler and Simon.Comment: Final version accepted for publication in Linear Algebra and Its Application

Six-qubit permutation-based decoherence-free orthogonal basis

There is a natural orthogonal basis of the 6-qubit decoherence-free (DF) space robust against collective noise. Interestingly, most of the basis states can be obtained from one another just permuting qubits. This property: (a) is useful for encoding qubits in DF subspaces, (b) allows the implementation of the Bennett-Brassard 1984 (BB84) protocol in DF subspaces just permuting qubits, which completes a the method for quantum key distribution using DF states proposed by Boileau et al. [Phys. Rev. Lett. 92, 017901 (2004)], and (c) points out that there is only one 6-qubit DF state which is essentially new (not obtained by permutations) and therefore constitutes an interesting experimental challenge.Comment: REVTeX4, 5 page

It\u27s Elementary

The periodic table provides the backdrop for the thirty examples presented below. Each word in the list is the result of replacing a single letter in the name of a chemical element with another and permuting the ensuing collection

On the Complexity of List Ranking in the Parallel External Memory Model

We study the problem of list ranking in the parallel external memory (PEM) model. We observe an interesting dual nature for the hardness of the problem due to limited information exchange among the processors about the structure of the list, on the one hand, and its close relationship to the problem of permuting data, which is known to be hard for the external memory models, on the other hand. By carefully defining the power of the computational model, we prove a permuting lower bound in the PEM model. Furthermore, we present a stronger \Omega(log^2 N) lower bound for a special variant of the problem and for a specific range of the model parameters, which takes us a step closer toward proving a non-trivial lower bound for the list ranking problem in the bulk-synchronous parallel (BSP) and MapReduce models. Finally, we also present an algorithm that is tight for a larger range of parameters of the model than in prior work