Related papers: Quantum expanders and property (T) discrete quantu…
Utilizing the notion of property (T) we construct new examples of quantum group norms on the polynomial algebra of a compact quantum group, and provide criteria ensuring that these are not equal to neither the minimal nor the maximal norm.…
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard definition of expanders. While in the definition of expanders…
A classical t-tensor product expander is a natural way of formalising correlated walks of t particles on a regular expander graph. A quantum t-tensor product expander is a completely positive trace preserving map that is a straightforward…
We consider a random quantum channel obtained by taking a selection of $d$ independent and Haar distributed $N$ dimensional unitaries. We follow the argument of Hastings to bound the spectral gap in terms of eigenvalues and adapt it to give…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages…
Kazhdan's property (T) has been studied for several discrete group-like structures, including standard invariants of Jones' subfactors and discrete quantum groups. We prove a Zuk-type spectral gap criterion for property (T) in this setting.…
The non-commutative differential calculus on quantum groups can be extended by introducing, in analogy with the classical case, inner product operators and Lie derivatives. For the case of $\GL$ we show how this extended calculus induces by…
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
Quantum superchannels are maps whose input and output are quantum channels. Rather than taking the domain to be the space of all linear maps we motivate and define superchannels on the operator system spanned by quantum channels. Extension…
We construct families of cell complexes that generalize expander graphs. These families are called non-$k$-hyperfinite, generalizing the idea of a non-hyperfinite (NH) family of graphs. Roughly speaking, such a complex has the property that…
We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms.…
For the quantum group $GL_{p,q}(2)$ and the corresponding quantum algebra $U_{p,q}(gl(2))$ Fronsdal and Galindo explicitly constructed the so-called universal $T$-matrix. In a previous paper we showed how this universal $T$-matrix can be…
In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Z\'emor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed…
In this survey article we give basic introduction to the theory of quantum families of maps. We begin with a general look at non-commutative (or "quantum") topology. Then we formulate all our results in this language. Existence of quantum…
The location of quantum information in various subsets of the qudit carriers of an additive graph code is discussed using a collection of operators on the coding space which form what we call the information group. It represents the input…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Two hierarchies of quantum principal bundles over quantum real projective spaces are constructed. One hierarchy contains bundles with U(1) as a structure group, the other has the quantum group $SU_q(2)$ as a fibre. Both hierarchies are…
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…