The intersection graph of a finite simple group has diameter at most 5

Let G be a non-abelian finite simple group. In addition, let $$\Delta _G$$ Δ G be the intersection graph of G, whose vertices are the proper non-trivial subgroups of G, with distinct subgroups joined by an edge if and only if they intersect non-trivially. We prove that the diameter of $$\Delta _G$$ Δ G has a tight upper bound of 5, thereby resolving a question posed by Shen (Czechoslov Math J 60(4):945–950, 2010). Furthermore, a diameter of 5 is achieved only by the baby monster group and certain unitary groups of odd prime dimension.

Quantum linear network coding for entanglement distribution in restricted architectures

In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network G. This allows for two-qubit operations to be performed between qubits which are remote from each other in G, through gate teleportation. We demonstrate how adapting quantum linear network coding to this problem of entanglement distribution in a network of qubits can be used to solve the problem of distributing Bell states and GHZ states in parallel, when bottlenecks in G would otherwise force such entangled states to be distributed sequentially. In particular, we show that by reduction to classical network coding protocols for the k-pairs problem or multiple multicast problem in a fixed network G, one can distribute entanglement between the transmitters and receivers with a Clifford circuit whose quantum depth is some (typically small and easily computed) constant, which does not depend on the size of G, however remote the transmitters and receivers are, or the number of transmitters and receivers. These results also generalise straightforwardly to qudits of any prime dimension. We demonstrate our results using a specialised formalism, distinct from and more efficient than the stabiliser formalism, which is likely to be helpful to reason about and prototype such quantum linear network coding circuits.

Braided Extensions of a Pointed Fusion Category with Prime Dimension

We obtain a necessary condition for a strictly weakly integral generalized Tambara–Yamagami fusion category to be braided. Then we use this result to classify braided extensions of a pointed fusion category with prime dimension.

Mutually unbiased unitary bases of operators on d-dimensional hilbert space

Analogous to the notion of mutually unbiased bases for Hilbert spaces, we consider mutually unbiased unitary bases (MUUBs) for the space of operators, [Formula: see text], acting on such Hilbert spaces. The notion of MUUB reflects the equiprobable guesses of unitary operators in one basis of [Formula: see text] when estimating a unitary operator in another. Though, for prime dimension [Formula: see text], the maximal number of MUUBs is known to be [Formula: see text], there is no known recipe for constructing them, assuming they exist. However, one can always construct a minimum of three MUUBs, and the maximal number is approached for very large values of [Formula: see text]. MUUBs can also exist for some [Formula: see text]-dimensional subspace of [Formula: see text] with the maximal number being [Formula: see text].

Constructing minimal homeomorphisms on point-like spaces and a dynamical presentation of the Jiang–Su algebra

The principal aim of the present paper is to give a dynamical presentation of the Jiang–Su algebra. Originally constructed as an inductive limit of prime dimension drop algebras, the Jiang–Su algebra has gone from being a poorly understood oddity to having a prominent positive role in George Elliott’s classification programme for separable, nuclear {\mathrm{C}^{*}} -algebras. Here, we exhibit an étale equivalence relation whose groupoid {\mathrm{C}^{*}} -algebra is isomorphic to the Jiang–Su algebra. The main ingredient is the construction of minimal homeomorphisms on infinite, compact metric spaces, each having the same cohomology as a point. This construction is also of interest in dynamical systems. Any self-map of an infinite, compact space with the same cohomology as a point has Lefschetz number one. Thus, if such a space were also to satisfy some regularity hypothesis (which our examples do not), then the Lefschetz–Hopf Theorem would imply that it does not admit a minimal homeomorphism.