اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBreakdown of Surface Code Error Correction Due to Coupling to a Bosonic Bath
84
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a surface code suffering decoherence due to coupling to a bath of bosonic modes at finite temperature and study the time available before the unavoidable breakdown of error correction occurs as a function of coupling and bath parameters. We derive an exact expression for the error rate on each individual qubit of the code, taking spatial and temporal correlations between the errors into account. We investigate numerically how different kinds of spatial correlations between errors in the surface code affect its threshold error rate. This allows us to derive the maximal duration of each quantum error correction period by studying when the single-qubit error rate reaches the corresponding threshold. At the time when error correction breaks down, the error rate in the code can be dominated by the direct coupling of each qubit to the bath, by mediated subluminal interactions, or by mediated superluminal interactions. For a 2D Ohmic bath, the time available per quantum error correction period vanishes in the thermodynamic limit of a large code size $L$ due to induced superluminal interactions, though it does so only like $1/sqrt{log L}$. For all other bath types considered, this time remains finite as $Lrightarrowinfty$.
قيم البحث
اقرأ أيضاً
We propose and study a model of a quantum memory that features self-correcting properties and a lifetime growing arbitrarily with system size at non-zero temperature. This is achieved by locally coupling a 2D L x L toric code to a 3D bath of bosons h
opping on a cubic lattice. When the stabilizer operators of the toric code are coupled to the displacement operator of the bosons, we solve the model exactly via a polaron transformation and show that the energy penalty to create anyons grows linearly with L. When the stabilizer operators of the toric code are coupled to the bosonic density operator, we use perturbation theory to show that the energy penalty for anyons scales with ln(L). For a given error model, these energy penalties lead to a lifetime of the stored quantum information growing respectively exponentially and polynomially with L. Furthermore, we show how to choose an appropriate coupling scheme in order to hinder the hopping of anyons (and not only their creation) with energy barriers that are of the same order as the anyon creation gaps. We argue that a toric code coupled to a 3D Heisenberg ferromagnet realizes our model in its low-energy sector. Finally, we discuss the delicate issue of the stability of topological order in the presence of perturbations. While we do not derive a rigorous proof of topological order, we present heuristic arguments suggesting that topological order remains intact when perturbative operators acting on the toric code spins are coupled to the bosonic environment.
Bosonic quantum error correction is a viable option for realizing error-corrected quantum information processing in continuous-variable bosonic systems. Various single-mode bosonic quantum error-correcting codes such as cat, binomial, and GKP codes h
ave been implemented experimentally in circuit QED and trapped ion systems. Moreover, there have been many theoretical proposals to scale up such single-mode bosonic codes to realize large-scale fault-tolerant quantum computation. Here, we consider the concatenation of the single-mode GKP code with the surface code, namely, the surface-GKP code. In particular, we thoroughly investigate the performance of the surface-GKP code by assuming realistic GKP states with a finite squeezing and noisy circuit elements due to photon losses. By using a minimum-weight perfect matching decoding algorithm on a 3D space-time graph, we show that fault-tolerant quantum error correction is possible with the surface-GKP code if the squeezing of the GKP states is higher than 11.2dB in the case where the GKP states are the only noisy elements. We also show that the squeezing threshold changes to 18:6dB when both the GKP states and circuit elements are comparably noisy. At this threshold, each circuit component fails with probability 0.69%. Finally, if the GKP states are noiseless, fault-tolerant quantum error correction with the surface-GKP code is possible if each circuit element fails with probability less than 0.81%. We stress that our decoding scheme uses the additional information from GKP-stabilizer measurements and we provide a simple method to compute renormalized edge weights of the matching graphs. Furthermore, our noise model is general as it includes full circuit-level noise.
The yield of physical qubits fabricated in the laboratory is much lower than that of classical transistors in production semiconductor fabrication. Actual implementations of quantum computers will be susceptible to loss in the form of physically faul
ty qubits. Though these physical faults must negatively affect the computation, we can deal with them by adapting error correction schemes. In this paper We have simulated statically placed single-fault lattices and lattices with randomly placed faults at functional qubit yields of 80%, 90% and 95%, showing practical performance of a defective surface code by employing actual circuit constructions and realistic errors on every gate, including identity gates. We extend Stace et al.s superplaquettes solution against dynamic losses for the surface code to handle static losses such as physically faulty qubits. The single-fault analysis shows that a static loss at the periphery of the lattice has less negative effect than a static loss at the center. The randomly-faulty analysis shows that 95% yield is good enough to build a large scale quantum computer. The local gate error rate threshold is $sim 0.3%$, and a code distance of seven suppresses the residual error rate below the original error rate at $p=0.1%$. 90% yield is also good enough when we discard badly fabricated quantum computation chips, while 80% yield does not show enough error suppression even when discarding 90% of the chips. We evaluated several metrics for predicting chip performance, and found that the average of the product of the number of data qubits and the cycle time of a stabilizer measurement of stabilizers gave the strongest correlation with post-correction residual error rates. Our analysis will help with selecting usable quantum computation chips from among the pool of all fabricated chips.
Topologically quantum error corrected logical gates are complex. Chains of errors can form in space and time and diagonally in spacetime. It is highly nontrivial to determine whether a given logical gate is free of low weight combinations of errors l
eading to failure. We report a new tool Nestcheck capable of analyzing an arbitrary topological computation and determining the minimum number of errors required to cause failure.
The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate how the pre
cise value of the threshold depends on the noise model, measurement circuits, and decoding algorithm. We observe thresholds between 0.502(1)% and 1.140(1)% per gate, values which are generally lower than previous estimates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
