Related papers: n-particle quantum statistics on graphs
Two-dimensional systems can host exotic particles called anyons whose quantum statistics are neither bosonic nor fermionic. For example, the elementary excitations of the fractional quantum Hall effect at filling factor $\nu=1/m$ (where m…
We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…
Connectivity is a fundamental property of quantum graphs, previously studied in the operator system model for matrix quantum graphs and via graph homomorphisms in the quantum adjacency matrix model. In this paper, we develop an algebraic…
This paper proposes groove-like potential structures for the observation of quantum information processing by trapped particles. As an illustration the effect of quantum statistics at a 50-50 beam splitter is investigated. For…
Topological quantum states of matter, both Abelian and non-Abelian, are characterized by excitations whose wavefunctions undergo non-trivial statistical transformations as one excitation is moved (braided) around another. Topological…
The phase space for a system of $n$ qubits is a discrete grid of $2^{n} \times 2^{n}$ points, whose axes are labeled in terms of the elements of the finite field $\Gal{2^n}$ to endow it with proper geometrical properties. We analyze the…
Topological phases of noninteracting particles are distinguished by global properties of their band structure and eigenfunctions in momentum space. On the other hand, group theory as conventionally applied to solid-state physics focuses…
Anyons are low-dimensional quasiparticles that obey fractional statistics, hence interpolating between bosons and fermions. In two dimensions, they exist as elementary excitations of fractional quantum Hall states and they are believed to…
Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…
The choice of statistics for a quantum particle is almost always a discrete one: either bosonic or fermionic. Anyons are the exceptional case for which the statistics can take a range of intermediate values. Holography provides an…
The article deals with one- and two-particle quantum walks on a graph with Braess-like topology and analyzes the issue of network congestion in the quantum world. Our approach to the study of congestion in quantum networks is based on the…
Indistinguishability of particles is a fundamental principle of quantum mechanics. For all elementary and quasiparticles observed to date - including fermions, bosons, and Abelian anyons - this principle guarantees that the braiding of…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…
We derive single-particle and two-particle correlators of anyons in the presence of a magnetic field in the lowest Landau level. We show that the two-particle correlator exhibits signatures of fractional statistics which can distinguish…
The quantum mechanics is proved to admit no hidden-variable in 1960s, which means the quantum systems are contextual. Revealing the mathematical structure of quantum mechanics is a significant task. We develop the approach of partial…
Let $P_0(A_n), \widetilde{P}_0(A_n), P_0(\mathcal{T}(A_n))$ and $\mathcal{O}_0(A_n)$ be respectively the proper power graph, the proper quotient power graph, the proper power type graph and the proper order graph of the alternating group…
We build interacting Fock spaces from association schemes and set up quantum walks on the resulting regular graphs (distance-regular and distance-transitive). The construction is valid for growing graphs and the interacting Fock space is…