The Nub of an Automorphism of a Totally Disconnected, Locally Compact Group

To any automorphism, $\alpha$, of a totally disconnected, locally compact group, $G$, there is associated a compact, $\alpha$-stable subgroup of $G$, here called the \emph{nub} of $\alpha$, on which the action of $\alpha$ is topologically transitive. Topologically transitive actions of automorphisms of compact groups have been studied extensively in topological dynamics and results obtained transfer, via the nub, to the study of automorphisms of general locally compact groups. A new proof that the contraction group of $\alpha$ is dense in the nub is given, but it is seen that the two-sided contraction group need not be dense. It is also shown that each pair $(G,\alpha)$, with $G$ compact and $\alpha$ topologically transitive, is an inverse limit of pairs that have `finite depth' and that analogues of the Schreier Refinement and Jordan-H\"older Theorems hold for pairs with finite depth

Dimension minimization of a quantum automaton

A new model of a Quantum Automaton (QA), working with qubits is proposed. The quantum states of the automaton can be pure or mixed and are represented by density operators. This is the appropriated approach to deal with measurements and dechorence. The linearity of a QA and of the partial trace super-operator, combined with the properties of invariant subspaces under unitary transformations, are used to minimize the dimension of the automaton and, consequently, the number of its working qubits. The results here developed are valid wether the state set of the QA is finite or not. There are two main results in this paper: 1) We show that the dimension reduction is possible whenever the unitary transformations, associated to each letter of the input alphabet, obey a set of conditions. 2) We develop an algorithm to find out the equivalent minimal QA and prove that its complexity is polynomial in its dimension and in the size of the input alphabet.Comment: 26 page

Countable Random Sets: Uniqueness in Law and Constructiveness

The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two approaches on uniqueness theorems: First, the study of generators for \sigma-fields used in this context and, secondly, the analysis of hitting functions. The last section of this paper deals with the notion of constructiveness. We will prove a measurable selection theorem and a decomposition theorem for constructive countable random sets, and study constructive countable random sets with independent increments.Comment: Published in Journal of Theoretical Probability (http://www.springerlink.com/content/0894-9840/). The final publication is available at http://www.springerlink.co

Disordered Topological Insulators via C∗C^*-Algebras

The theory of almost commuting matrices can be used to quantify topological obstructions to the existence of localized Wannier functions with time-reversal symmetry in systems with time-reversal symmetry and strong spin-orbit coupling. We present a numerical procedure that calculates a Z_2 invariant using these techniques, and apply it to a model of HgTe. This numerical procedure allows us to access sizes significantly larger than procedures based on studying twisted boundary conditions. Our numerical results indicate the existence of a metallic phase in the presence of scattering between up and down spin components, while there is a sharp transition when the system decouples into two copies of the quantum Hall effect. In addition to the Z_2 invariant calculation in the case when up and down components are coupled, we also present a simple method of evaluating the integer invariant in the quantum Hall case where they are decoupled.Comment: Added detail regarding the mapping of almost commuting unitary matrices to almost commuting Hermitian matrices that form an approximate representation of the sphere. 6 pages, 6 figure

Tensor products of subspace lattices and rank one density

We show that, if $M$ is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, $L$ is a commutative subspace lattice and $P$ is the lattice of all projections on a separable infinite dimensional Hilbert space, then the lattice $L\otimes M\otimes P$ is reflexive. If $M$ is moreover an atomic Boolean subspace lattice while $L$ is any subspace lattice, we provide a concrete lattice theoretic description of $L\otimes M$ in terms of projection valued functions defined on the set of atoms of $M$. As a consequence, we show that the Lattice Tensor Product Formula holds for \Alg M and any other reflexive operator algebra and give several further corollaries of these results.Comment: 15 page

Quantum Homodyne Tomography as an Informationally Complete Positive Operator Valued Measure

We define a positive operator valued measure $E$ on $[0,2\pi]\times R$ describing the measurement of randomly sampled quadratures in quantum homodyne tomography, and we study its probabilistic properties. Moreover, we give a mathematical analysis of the relation between the description of a state in terms of $E$ and the description provided by its Wigner transform.Comment: 9 page

Generalized Satisfiability Problems via Operator Assignments

Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used to represent constraints by multilinear polynomials in a unique way. The polynomial representation of constraints gives rise to a relaxation of the notion of satisfiability in which the values to variables are linear operators on some Hilbert space. For the case of constraints given by a system of linear equations over the two-element field, this relaxation has received considerable attention in the foundations of quantum mechanics, where such constructions as the Mermin-Peres magic square show that there are systems that have no solutions in the Boolean domain, but have solutions via operator assignments on some finite-dimensional Hilbert space. We obtain a complete characterization of the classes of Boolean relations for which there is a gap between satisfiability in the Boolean domain and the relaxation of satisfiability via operator assignments. To establish our main result, we adapt the notion of primitive-positive definability (pp-definability) to our setting, a notion that has been used extensively in the study of constraint satisfaction problems. Here, we show that pp-definability gives rise to gadget reductions that preserve satisfiability gaps. We also present several additional applications of this method. In particular and perhaps surprisingly, we show that the relaxed notion of pp-definability in which the quantified variables are allowed to range over operator assignments gives no additional expressive power in defining Boolean relations

Multipartite entanglement in fermionic systems via a geometric measure

We study multipartite entanglement in a system consisting of indistinguishable fermions. Specifically, we have proposed a geometric entanglement measure for N spin-1/2 fermions distributed over 2L modes (single particle states). The measure is defined on the 2L qubit space isomorphic to the Fock space for 2L single particle states. This entanglement measure is defined for a given partition of 2L modes containing m >= 2 subsets. Thus this measure applies to m <= 2L partite fermionic system where L is any finite number, giving the number of sites. The Hilbert spaces associated with these subsets may have different dimensions. Further, we have defined the local quantum operations with respect to a given partition of modes. This definition is generic and unifies different ways of dividing a fermionic system into subsystems. We have shown, using a representative case, that the geometric measure is invariant under local unitaries corresponding to a given partition. We explicitly demonstrate the use of the measure to calculate multipartite entanglement in some correlated electron systems. To the best of our knowledge, there is no usable entanglement measure of m > 3 partite fermionic systems in the literature, so that this is the first measure of multipartite entanglement for fermionic systems going beyond the bipartite and tripartite cases.Comment: 25 pages, 8 figure

Semispectral measures as convolutions and their moment operators

The moment operators of a semispectral measure having the structure of the convolution of a positive measure and a semispectral measure are studied, with paying attention to the natural domains of these unbounded operators. The results are then applied to conveniently determine the moment operators of the Cartesian margins of the phase space observables.Comment: 7 page

Deterministic and Unambiguous Dense Coding

Optimal dense coding using a partially-entangled pure state of Schmidt rank $\bar D$ and a noiseless quantum channel of dimension $D$ is studied both in the deterministic case where at most $L_d$ messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability $\tau_x$) Bob knows for sure that Alice sent message $x$, and when it fails (probability $1-\tau_x$) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For $\bar D\leq D$ a bound is obtained for $L_d$ in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes et al. For $\bar D > D$ it is shown that $L_d$ is strictly less than $D^2$ unless $\bar D$ is an integer multiple of $D$, in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for $\bar D \leq D$, assuming $\tau_x>0$ for a set of $\bar D D$ messages, and a bound is obtained for the average \lgl1/\tau\rgl. A bound on the average \lgl\tau\rgl requires an additional assumption of encoding by isometries (unitaries when $\bar D=D$) that are orthogonal for different messages. Both bounds are saturated when $\tau_x$ is a constant independent of $x$, by a protocol based on one-shot entanglement concentration. For $\bar D > D$ it is shown that (at least) $D^2$ messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states.Comment: Short new section VII added. Latex 23 pages, 1 PSTricks figure in tex