Michael Freedman

Geometric complexity of embeddings in {\mathbb{R}^{d}}

Given a simplicial complex K, we consider several notions of geometric complexity of embeddings of K in a Euclidean space

From String Nets to Nonabelions

{mathbb{R}^d}

Large quantum Fourier transforms are never exactly realized by braiding conformal blocks

Rd : thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any n-complex with N simplices which topologically embeds in

PROCÉDÉS ET DISPOSITIFS DE CALCUL QUANTIQUE POUR BITS QUANTIQUES DE MAJORANA

{mathbb{R}^{2n}, n > 2}

Embedding thickness below the stable range

R2n,n>2, can be PL embedded in