اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPolyestimate: instantaneous open source surface code analysis
199
0
0.0
(
0
)
تأليف
Austin G. Fowler
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The surface code is highly practical, enabling arbitrarily reliable quantum computation given a 2-D nearest-neighbor coupled array of qubits with gate error rates below approximately 1%. We describe an open source library, Polyestimate, enabling a user with no knowledge of the surface code to specify realistic physical quantum gate error models and obtain logical error rate estimates. Functions allowing the user to specify simple depolarizing error rates for each gate have also been included. Every effort has been made to make this library user-friendly.
قيم البحث
اقرأ أيضاً
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing protocols
is low as two-way classical communication is used. We show that, if Bell pairs are generated between neighboring stations with a probability of heralded success greater than 0.65 and fidelity greater than 0.96, two-way classical communication can be entirely avoided and quantum information can be sent over arbitrary distances with arbitrarily low error at a rate limited only by the local gate speed. The number of qubits per repeater scales logarithmically with the communication distance. If the probability of heralded success is less than 0.65 and Bell pairs between neighboring stations with fidelity no less than 0.92 are generated only every T_B seconds, the logarithmic resource scaling remains and the communication rate through N links is proportional to 1/(T_B log^2 N).
Performing large calculations with a quantum computer will likely require a fault-tolerant architecture based on quantum error-correcting codes. The challenge is to design practical quantum error-correcting codes that perform well against realistic n
oise using modest resources. Here we show that a variant of the surface code -- the XZZX code -- offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel; it is the first explicit code shown to have this universal property. We present numerical evidence that the threshold even exceeds this hashing bound for an experimentally relevant range of noise parameters. Focusing on the common situation where qubit dephasing is the dominant noise, we show that this code has a practical, high-performance decoder and surpasses all previously known thresholds in the realistic setting where syndrome measurements are unreliable. We go on to demonstrate the favourable sub-threshold resource scaling that can be obtained by specialising a code to exploit structure in the noise. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states |A>=(|0>+e^{ipi/4}|1>)/sqrt{2} produced a single
improved |A> state given 15 input copies. New block code state distillation methods can produce k improved |A> states given 3k+8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three.
In recent years there has been a considerable effort in optimising formal methods for application to code. This has been driven by tools such as CPAChecker, DIVINE, and CBMC. At the same time tools such as Uppaal have been massively expanding the rea
lm of more traditional model checking technologies to include strategy synthesis algorithms - an aspect becoming more and more needed as software becomes increasingly parallel. Instead of reimplementing the advances made by Uppaal in this area, we suggest in this paper to develop a bridge between the source code and the engine of Uppaal. Our approach uses the widespread intermediate language LLVM and makes recent advances of the Uppaal ecosystem readily available to analysis of source code.
Electronic stopping (ES) of energetic atoms is not taken care of by the interatomic potentials used in molecular dynamics (MD) simulations when simulating collision cascades. The Lindhard-Scharff (LS) formula for electronic stopping is therefore incl
uded as a drag term for energetic atoms in the open source large scale atomic molecular massively parallel simulator (LAMMPS) code. In order to validate the ES implementation, MD simulations of collision cascades at primary knock-on atom (PKA) energies of 5, 10 and 20 keV are carried out in W and Fe in 100 random directions. The total ES losses from the MD simulations show energy straggling due to the stochastic nature of the phenomena. Thelosses due to ES are compared with that predicted by theNorgett-Robinson-Torrens (NRT) model to validate our implementation. It is seenthat the root mean square deviation of ES losses from the MD implementation is around 10 % for both W and Fe compared to the NRT model. The velocity threshold above which electronic stopping is important is explored. The effect of ES on the number of defects in collision cascades is presented for Fe and W.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
