اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDemonstrating non-Abelian braiding of surface code defects in a five qubit experiment
57
0
0.0
(
0
)
تأليف
James R. Wootton
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Currently, the mainstream approach to quantum computing is through surface codes. One way to store and manipulate quantum information with these to create defects in the codes which can be moved and used as if they were particles. Specifically, they simulate the behaviour of exotic particles known as Majoranas, which are a kind of non-Abelian anyon. By exchanging these particles, important gates for quantum computation can be implemented. Here we investigate the simplest possible exchange operation for two surface code Majoranas. This is found to act non-trivially on only five qubits. The system is then truncated to these five qubits, so that the exchange process can be run on the IBM 5Q processor. The results demonstrate the expected effect of the exchange. This paper has been written in a style that should hopefully be accessible to both professional and amateur scientists.
قيم البحث
اقرأ أيضاً
The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are therefore require
d to achieve universal quantum computation. Here we propose a hybrid scheme which uses small islands of a qudit variant of the surface code to enhance the computational power of the standard surface code. This allows the non-trivial action of the non-Abelian anyons in the former to process information stored in the latter. Specifically, we show that a non-stabilizer state can be prepared, which allows universality to be achieved.
Non-trivial braid-group representations appear as non-Abelian quantum statistics of emergent Majorana zero modes in one and two-dimensional topological superconductors. Here, we generate such representations with topologically protected domain-wall m
odes in a classical analogue of the Kitaev superconducting chain, with a particle-hole like symmetry and a Z2 topological invariant. The mid-gap modes are found to exhibit distinct fusion channels and rich non-Abelian braiding properties, which are investigated using a T-junction setup. We employ the adiabatic theorem to explicitly calculate the braiding matrices for one and two pairs of these mid-gap topological defects.
Current quantum technology is approaching the system sizes and fidelities required for quantum error correction. It is therefore important to determine exactly what is needed for proof-of-principle experiments, which will be the first major step towa
rds fault-tolerant quantum computation. Here we propose a surface code based experiment that is the smallest, both in terms of code size and circuit depth, that would allow errors to be detected and corrected for both the $X$ and $Z$ basis of a qubit. This requires $17$ physical qubits initially prepared in a product state, on which $16$ two-qubit entangling gates are applied before a final measurement of all qubits. A platform agnostic error model is applied to give some idea of the noise levels required for success. It is found that a true demonstration of quantum error correction will require fidelities for the preparation and measurement of qubits and the entangling gates to be above $99%$.
We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch sphere, and a u
niversal set of single-qubit gates. For each type of operation, we observe higher performance for fault-tolerant variants over non-fault-tolerant variants, and quantify the difference through detailed characterization. In particular, we demonstrate process tomography of logical gates, using the notion of a logical Pauli transfer matrix. This integration of high-fidelity logical operations with a scalable scheme for repeated stabilization is a milestone on the road to quantum error correction with higher-distance superconducting surface codes.
Topological quantum error correction codes are known to be able to tolerate arbitrary local errors given sufficient qubits. This includes correlated errors involving many local qubits. In this work, we quantify this level of tolerance, numerically st
udying the effects of many-qubit errors on the performance of the surface code. We find that if increasingly large area errors are at least moderately exponentially suppressed, arbitrarily reliable quantum computation can still be achieved with practical overhead. We furthermore quantify the effect of non-local two-qubit correlated errors, which would be expected in arrays of qubits coupled by a polynomially decaying interaction, and when using many-qubit coupling devices. We surprisingly find that the surface code is very robust to this class of errors, despite a provable lack of a threshold error rate when such errors are present.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
