Related papers: n-particle quantum statistics on graphs
We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\to\infty$ and $m=O(n\log n)$ as $n\to\infty$. This is the entire range of $m$ not covered by…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
Anyons, quasiparticles living in two-dimensional spaces with exotic exchange statistics, can serve as the fundamental units for fault-tolerant quantum computation. However, experimentally demonstrating anyonic statistics is a challenge due…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…
Indistinguishable particles in two dimensions can be characterized by anyonic quantum statistics more general than those of bosons or fermions. Such anyons emerge as quasiparticles in fractional quantum Hall states and certain frustrated…
Anyons are exotic quasiparticles living in two dimensions that do not fit into the usual categories of fermions and bosons, but obey a new form of fractional statistics. Following a recent proposal [Phys. Rev. Lett. 98, 150404 (2007)], we…
We study quantum walks of many non-interacting particles on a beam splitter array, as a paradigmatic testing ground for the competition of single- and many-particle interference in a multi-mode system. We derive a general expression for…
Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined. These states are constructed by applying $CNOT$ gates to an arbitrary separable multi-qubit quantum state. The entanglement distance of the resulting…
We establish an exact mapping between identical particles in one dimension with arbitrary exchange statistics, including bosons, anyons and fermions, provided they share the same scattering length. This boson-anyon-fermion mapping…
Anyons are quasiparticles in two-dimensional systems that show statistical properties very distinct from those of bosons or fermions. While their isolated observation has not yet been achieved, here we perform a quantum simulation of anyons…
The one dimensional quantum walk of anyonic systems is presented. The anyonic walker performs braiding operations with stationary anyons of the same type ordered canonically on the line of the walk. Abelian as well as non-Abelian anyons are…
In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…
We demonstrate that a quantum graph exhibits a $\mathcal{PT}$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices; this symmetry is nontrivial if they are not…
Let $G$ be a simple finite graph, and let $\mathcal U_G$ be the related quantum graph. We study the game algebra $C(\mathrm{Qut}(\mathcal U_G))$ of quantum automorphism of $\mathcal U_G$. Moreover, we prove that for any graph $G$ with…
A non-abelian anyon can only occur in the presence of ground state degeneracy in the plane. It is conceivable that for some strange anyon with quantum dimension $>1$ that the resulting representations of all $n$-strand braid groups $B_n$…
We investigate the quantum dynamics of particles on graphs ("quantum random walks"), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on…
We discuss the problem of anyonic statistics in one and two spatial dimensions from the point of view of statistical physics. In particular we want to understand how the choice of the Bornvon Karman or the twisted periodic boundary…
We study the non-abelian statistics characterizing systems where counter-propagating gapless modes on the edges of fractional quantum Hall states are gapped by proximity-coupling to superconductors and ferromagnets. The most transparent…