scholarly journals A Silicon Surface Code Architecture Resilient Against Leakage Errors

Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 212 ◽  
Author(s):  
Zhenyu Cai ◽  
Michael A. Fogarty ◽  
Simon Schaal ◽  
Sofia Patomäki ◽  
Simon C. Benjamin ◽  
...  

Spin qubits in silicon quantum dots are one of the most promising building blocks for large scale quantum computers thanks to their high qubit density and compatibility with the existing semiconductor technologies. High fidelity single-qubit gates exceeding the threshold of error correction codes like the surface code have been demonstrated, while two-qubit gates have reached 98% fidelity and are improving rapidly. However, there are other types of error --- such as charge leakage and propagation --- that may occur in quantum dot arrays and which cannot be corrected by quantum error correction codes, making them potentially damaging even when their probability is small. We propose a surface code architecture for silicon quantum dot spin qubits that is robust against leakage errors by incorporating multi-electron mediator dots. Charge leakage in the qubit dots is transferred to the mediator dots via charge relaxation processes and then removed using charge reservoirs attached to the mediators. A stabiliser-check cycle, optimised for our hardware, then removes the correlations between the residual physical errors. Through simulations we obtain the surface code threshold for the charge leakage errors and show that in our architecture the damage due to charge leakage errors is reduced to a similar level to that of the usual depolarising gate noise. Spin leakage errors in our architecture are constrained to only ancilla qubits and can be removed during quantum error correction via reinitialisations of ancillae, which ensure the robustness of our architecture against spin leakage as well. Our use of an elongated mediator dots creates spaces throughout the quantum dot array for charge reservoirs, measuring devices and control gates, providing the scalability in the design.

2020 ◽  
Vol 2 (1) ◽  
Author(s):  
Savvas Varsamopoulos ◽  
Koen Bertels ◽  
Carmen G. Almudever

Abstract There has been a rise in decoding quantum error correction codes with neural network–based decoders, due to the good decoding performance achieved and adaptability to any noise model. However, the main challenge is scalability to larger code distances due to an exponential increase of the error syndrome space. Note that successfully decoding the surface code under realistic noise assumptions will limit the size of the code to less than 100 qubits with current neural network–based decoders. Such a problem can be tackled by a distributed way of decoding, similar to the renormalization group (RG) decoders. In this paper, we introduce a decoding algorithm that combines the concept of RG decoding and neural network–based decoders. We tested the decoding performance under depolarizing noise with noiseless error syndrome measurements for the rotated surface code and compared against the blossom algorithm and a neural network–based decoder. We show that a similar level of decoding performance can be achieved between all tested decoders while providing a solution to the scalability issues of neural network–based decoders.


Quantum ◽  
2019 ◽  
Vol 3 ◽  
pp. 215 ◽  
Author(s):  
Hendrik Poulsen Nautrup ◽  
Nicolas Delfosse ◽  
Vedran Dunjko ◽  
Hans J. Briegel ◽  
Nicolai Friis

Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laboratory setups is highly challenging. Here, we present a reinforcement learning framework for optimizing and fault-tolerantly adapting quantum error correction codes. We consider a reinforcement learning agent tasked with modifying a family of surface code quantum memories until a desired logical error rate is reached. Using efficient simulations with about 70 data qubits with arbitrary connectivity, we demonstrate that such a reinforcement learning agent can determine near-optimal solutions, in terms of the number of data qubits, for various error models of interest. Moreover, we show that agents trained on one setting are able to successfully transfer their experience to different settings. This ability for transfer learning showcases the inherent strengths of reinforcement learning and the applicability of our approach for optimization from off-line simulations to on-line laboratory settings.


2015 ◽  
Vol 1 (9) ◽  
pp. e1500707 ◽  
Author(s):  
Charles D. Hill ◽  
Eldad Peretz ◽  
Samuel J. Hile ◽  
Matthew G. House ◽  
Martin Fuechsle ◽  
...  

The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in parallel—posing formidable fabrication and control challenges. We present an architecture that addresses these problems through a novel shared-control paradigm that is particularly suited to the natural uniformity of the phosphorus donor nuclear spin qubit states and electronic confinement. The architecture comprises a two-dimensional lattice of donor qubits sandwiched between two vertically separated control layers forming a mutually perpendicular crisscross gate array. Shared-control lines facilitate loading/unloading of single electrons to specific donors, thereby activating multiple qubits in parallel across the array on which the required operations for surface code quantum error correction are carried out by global spin control. The complexities of independent qubit control, wave function engineering, and ad hoc quantum interconnects are explicitly avoided. With many of the basic elements of fabrication and control based on demonstrated techniques and with simulated quantum operation below the surface code error threshold, the architecture represents a new pathway for large-scale quantum information processing in silicon and potentially in other qubit systems where uniformity can be exploited.


Author(s):  
Dongsheng Wang ◽  
Yunjiang Wang ◽  
Ningping Cao ◽  
Bei Zeng ◽  
Raymond Lafflamme

Abstract In this work, we develop the theory of quasi-exact fault-tolerant quantum (QEQ) computation, which uses qubits encoded into quasi-exact quantum error-correction codes (``quasi codes''). By definition, a quasi code is a parametric approximate code that can become exact by tuning its parameters. The model of QEQ computation lies in between the two well-known ones: the usual noisy quantum computation without error correction and the usual fault-tolerant quantum computation, but closer to the later. Many notions of exact quantum codes need to be adjusted for the quasi setting. Here we develop quasi error-correction theory using quantum instrument, the notions of quasi universality, quasi code distances, and quasi thresholds, etc. We find a wide class of quasi codes which are called valence-bond-solid codes, and we use them as concrete examples to demonstrate QEQ computation.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 172623-172643
Author(s):  
Josu Etxezarreta Martinez ◽  
Patricio Fuentes ◽  
Pedro M. Crespo ◽  
J. Garcia-Frias

2018 ◽  
Vol 4 (11) ◽  
pp. eaau1695 ◽  
Author(s):  
Baptiste Royer ◽  
Shruti Puri ◽  
Alexandre Blais

Multiqubit parity measurements are essential to quantum error correction. Current realizations of these measurements often rely on ancilla qubits, a method that is sensitive to faulty two-qubit gates and that requires notable experimental overhead. We propose a hardware-efficient multiqubit parity measurement exploiting the bifurcation dynamics of a parametrically driven nonlinear oscillator. This approach takes advantage of the resonator’s parametric oscillation threshold, which depends on the joint parity of dispersively coupled qubits, leading to high-amplitude oscillations for one parity subspace and no oscillation for the other. We present analytical and numerical results for two- and four-qubit parity measurements, with high-fidelity readout preserving the parity eigenpaces. Moreover, we discuss a possible realization that can be readily implemented with the current circuit quantum electrodynamics (QED) experimental toolbox. These results could lead to substantial simplifications in the experimental implementation of quantum error correction and notably of the surface code.


Sign in / Sign up

Export Citation Format

Share Document