اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدActive error correction for Abelian and non-Abelian anyons
142
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a class of decoding algorithms that are applicable to error correction for both Abelian and non-Abelian anyons. This class includes multiple algorithms that have recently attracted attention, including the Bravyi-Haah RG decoder. They are applied to both the problem of single shot error correction (with perfect syndrome measurements) and that of active error correction (with noisy syndrome measurements). For Abelian models we provide a threshold proof in both cases, showing that there is a finite noise threshold under which errors can be arbitrarily suppressed when any decoder in this class is used. For non-Abelian models such a proof is found for the single shot case. The means by which decoding may be performed for active error correction of non-Abelian anyons is studied in detail. Differences with the Abelian case are discussed.
قيم البحث
اقرأ أيضاً
Topological systems, such as fractional quantum Hall liquids, promise to successfully combat environmental decoherence while performing quantum computation. These highly correlated systems can support non-Abelian anyonic quasiparticles that can encod
e exotic entangled states. To reveal the non-local character of these encoded states we demonstrate the violation of suitable Bell inequalities. We provide an explicit recipe for the preparation, manipulation and measurement of the desired correlations for a large class of topological models. This proposal gives an operational measure of non-locality for anyonic states and it opens up the possibility to violate the Bell inequalities in quantum Hall liquids or spin lattices.
Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, q
udit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strenghts of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size $L$ from $Theta(L^{2/3})$ to $Omega(L^{1-epsilon})$ for any $epsilon>0$. We apply our algorithm to decoding $D(mathbb{Z}_d)$ quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the $D(mathbb{Z}_d)$ quantum double models. The parallelized runtime of our algorithm is $text{poly}(log L)$ for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is $O(1)$ for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.
Anyons are particlelike excitations of strongly correlated phases of matter with fractional statistics, characterized by nontrivial changes in the wave function, generalizing Bose and Fermi statistics, when two of them are interchanged. This can be u
sed to perform quantum computations [A. Yu. Kitaev, Ann. Phys. (N.Y.) 303, 2 (2003)]. We show how to simulate the creation and manipulation of Abelian and non- Abelian anyons in topological lattice models using trapped atoms in optical lattices. Our proposal, feasible with present technology, requires an ancilla particle which can undergo single-particle gates, be moved close to each constituent of the lattice and undergo a simple quantum gate, and be detected.
Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture truly scala
ble, even rare errors need to be corrected. Error correction for non-Abelian anyons is complicated by the fact that it needs to be performed on a continuous basis and further errors may occur while we are correcting existing ones. Here, we provide the first study of this problem and prove its feasibility, establishing non-Abelian anyons as a viable platform for scalable quantum computation. We thereby focus on Ising anyons as the most prominent example of non-Abelian anyons and show that for these a finite error rate can indeed be corrected continuously. There is a threshold error rate $p_c>0$ such that for all error rates $p<p_c$ the probability of a logical error per time-step can be made exponentially small in the distance of a logical qubit.
In this paper, we report on the study of Abelian and non-Abelian statistics through Fabry-Perot interferometry of fractional quantum Hall (FQH) systems. Our detection of phase slips in quantum interference experiments demonstrates a powerful, new way
of detecting braiding of anyons. We confirm the Abelian anyonic braiding statistics in the $ u = 7/3$ FQH state through detection of the predicted statistical phase angle of $2pi/3$, consistent with a change of the anyonic particle number by one. The $ u = 5/2$ FQH state is theoretically believed to harbor non-Abelian anyons which are Majorana, meaning that each pair of quasiparticles contain a neutral fermion orbital which can be occupied or unoccupied and hence can act as a qubit. In this case our observed statistical phase slips agree with a theoretical model where the Majoranas are strongly coupled to each other, and strongly coupled to the edge modes of the interferometer. In particular, an observed phase slip of approximately $pi$ is interpreted as a sudden flip of a qubit, or entry of a neutral fermion into the interferometer. Our results provide compelling support for the existence of non-Abelian anyons.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
