Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userIts anyons game: the race to quantum computation
56
0
0.0
(
0
)
Authors
J. K. Jain
Ask ChatGPT about the research
No Arabic abstract
In 1924, Satyendra Nath Bose dispatched a manuscript introducing the concept now known as Bose statistics to Albert Einstein. Bose could hardly have imagined that the exotic statistics of certain emergent particles of quantum matter would one day suggest a route to fault-tolerant quantum computation. This non-technical Commentary on anyons, namely particles whose statistics is intermediate between Bose and Fermi, aims to convey the underlying concept as well as its experimental manifestations to the uninitiated.
rate research
Read More
We show that braidings of the metaplectic anyons $X_epsilon$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for quantum computation. We conjecture that similar universal computing models can be constructed for all metaplectic anyon systems $SO(p)_2$ for any odd prime $pgeq 5$. In order to prove universality, we find new conceptually appealing universal gate sets for qutrits and qupits.
Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility, accessible anyons with current technology all belong to a class that is called weakly integral---anyons whose squared quantum dimensions are integers. We analyze the computational power of the first non-abelian anyon system with only integral quantum dimensions---$D(S_3)$, the quantum double of $S_3$. Since all anyons in $D(S_3)$ have finite images of braid group representations, they cannot be universal for quantum computation by braiding alone. Based on our knowledge of the images of the braid group representations, we set up three qutrit computational models. Supplementing braidings with some measurements and ancillary states, we find a universal gate set for each model.
We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding exact codes, serving as its fixed points. The computation with a quasi-exact code cannot realize any logical gate to arbitrary accuracy. To overcome this, the notion of quasi-exact universality is proposed, which makes quasi-exact quantum computation a feasible model especially for executing moderate-size algorithms. We find that the incompatibility between universality and transversality of the set of logical gates does not persist in the quasi-exact scenario. A class of covariant quasi-exact codes is defined which proves to support transversal and quasi-exact universal set of logical gates for $SU(d)$. This work opens the possibility of quantum computation with quasi-exact universality, transversality, and fault tolerance.
The dichotomy between fermions and bosons is at the root of many physical phenomena, from metallic conduction of electricity to super-fluidity, and from the periodic table to coherent propagation of light. The dichotomy originates from the symmetry of the quantum mechanical wave function to the interchange of two identical particles. In systems that are confined to two spatial dimensions particles that are neither fermions nor bosons, coined anyons, may exist. The fractional quantum Hall effect offers an experimental system where this possibility is realized. In this paper we present the concept of anyons, we explain why the observation of the fractional quantum Hall effect almost forces the notion of anyons upon us, and we review several possible ways for a direct observation of the physics of anyons. Furthermore, we devote a large part of the paper to non-abelian anyons, motivating their existence from the point of view of trial wave functions, giving a simple exposition of their relation to conformal field theories, and reviewing several proposals for their direct observation.
We consider the realization of universal quantum computation through braiding of Majorana fermions supplemented by unprotected preparation of noisy ancillae. It has been shown by Bravyi [Phys. Rev. A 73, 042313 (2006)] that under the assumption of perfect braiding operations, universal quantum computation is possible if the noise rate on a particular 4-fermion ancilla is below 40%. We show that beyond a noise rate of 89% on this ancilla the quantum computation can be efficiently simulated classically: we explicitly show that the noisy ancilla is a convex mixture of Gaussian fermionic states in this region, while for noise rates below 53% we prove that the state is not a mixture of Gaussian states. These results were obtained by generalizing concepts in entanglement theory to the setting of Gaussian states and their convex mixtures. In particular we develop a complete set of criteria, namely the existence of a Gaussian-symmetric extension, which determine whether a state is a convex mixture of Gaussian states.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
