In this paper we present a hybrid scheme for topological quantum computation in a system of cold atoms trapped in an atomic lattice. A topological qubit subspace is defined using Majorana fermions which emerge in a network of atomic Kitaev one-dimens
ional wires. We show how braiding can be efficiently implemented in this setup and propose a direct way to demonstrate the non-Abelian nature of Majorana fermions via a single parity measurement. We then introduce a proposal for the efficient, robust and reversible mapping of the topological qubits to a conventional qubit stored in a single atom. There, well-controlled standard techniques can be used to implement the missing gates required for universal computation. Our setup is complemented with an efficient non-destructive protocol to check for errors in the mapping.
We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of Millikens theorem on trees.
The distinguishing number of a graph $G$ is the smallest positive integer $r$ such that $G$ has a labeling of its vertices with $r$ labels for which there is no non-trivial automorphism of $G$ preserving these labels. Albertson and Collins computed t
he distinguishing number for various finite graphs, and Imrich, Klavv{z}ar and Trofimov computed the distinguishing number of some infinite graphs, showing in particular that the Random Graph has distinguishing number 2. We compute the distinguishing number of various other finite and countable homogeneous structures, including undirected and directed graphs, and posets. We show that this number is in most cases two or infinite, and besides a few exceptions conjecture that this is so for all primitive homogeneous countable structures.
