Do you want to publish a course? Click here

Computing with spin qubits at the surface code error threshold

196   0   0.0 ( 0 )
 Added by Xiao Xue
 Publication date 2021
  fields Physics
and research's language is English




Ask ChatGPT about the research

High-fidelity control of quantum bits is paramount for the reliable execution of quantum algorithms and for achieving fault-tolerance, the ability to correct errors faster than they occur. The central requirement for fault-tolerance is expressed in terms of an error threshold. Whereas the actual threshold depends on many details, a common target is the ~1% error threshold of the well-known surface code. Reaching two-qubit gate fidelities above 99% has been a long-standing major goal for semiconductor spin qubits. These qubits are well positioned for scaling as they can leverage advanced semiconductor technology. Here we report a spin-based quantum processor in silicon with single- and two-qubit gate fidelities all above 99.5%, extracted from gate set tomography. The average single-qubit gate fidelities remain above 99% when including crosstalk and idling errors on the neighboring qubit. Utilizing this high-fidelity gate set, we execute the demanding task of calculating molecular ground state energies using a variational quantum eigensolver algorithm. Now that the 99% barrier for the two-qubit gate fidelity has been surpassed, semiconductor qubits have gained credibility as a leading platform, not only for scaling but also for high-fidelity control.



rate research

Read More

399 - Matthew Reed 2013
A quantum computer will use the properties of quantum physics to solve certain computational problems much faster than otherwise possible. One promising potential implementation is to use superconducting quantum bits in the circuit quantum electrodynamics (cQED) architecture. There, the low energy states of a nonlinear electronic oscillator are isolated and addressed as a qubit. These qubits are capacitively coupled to the modes of a microwave-frequency transmission line resonator which serves as a quantum communication bus. Microwave electrical pulses are applied to the resonator to manipulate or measure the qubit state. State control is calibrated using diagnostic sequences that expose systematic errors. Hybridization of the resonator with the qubit gives it a nonlinear response when driven strongly, useful for amplifying the measurement signal to enhance accuracy. Qubits coupled to the same bus may coherently interact with one another via the exchange of virtual photons. A two-qubit conditional phase gate mediated by this interaction can deterministically entangle its targets, and is used to generate two-qubit Bell states and three-qubit GHZ states. These three-qubit states are of particular interest because they redundantly encode quantum information. They are the basis of the quantum repetition code prototypical of more sophisticated schemes required for quantum computation. Using a three-qubit Toffoli gate, this code is demonstrated to autonomously correct either bit- or phase-flip errors. Despite observing the expected behavior, the overall fidelity is low because of decoherence. A superior implementation of cQED replaces the transmission-line resonator with a three-dimensional box mode, increasing lifetimes by an order of magnitude. In-situ qubit frequency control is enabled with control lines, which are used to fully characterize and control the system Hamiltonian.
The development of robust architectures capable of large-scale fault-tolerant quantum computation should consider both their quantum error-correcting codes, and the underlying physical qubits upon which they are built, in tandem. Following this design principle we demonstrate remarkable error correction performance by concatenating the XZZX surface code with Kerr-cat qubits. We contrast several variants of fault-tolerant systems undergoing different circuit noise models that reflect the physics of Kerr-cat qubits. Our simulations show that our system is scalable below a threshold gate infidelity of $p_mathrm{CX} sim 6.5%$ within a physically reasonable parameter regime, where $p_mathrm{CX}$ is the infidelity of the noisiest gate of our system; the controlled-not gate. This threshold can be reached in a superconducting circuit architecture with a Kerr-nonlinearity of $10$MHz, a $sim 6.25$ photon cat qubit, single-photon lifetime of $gtrsim 64mu$s, and thermal photon population $lesssim 8%$. Such parameters are routinely achieved in superconducting circuits.
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 have 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.
188 - Ashley M. Stephens 2013
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 precise 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.
131 - Ming Gong , Xiao Yuan , Shiyu Wang 2019
Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal quantum error correcting code, with the subsequent verification of all key features including the identification of an arbitrary physical error, the capability for transversal manipulation of the logical state, and state decoding. To address this challenge, we experimentally realise the $[![5,1,3]!]$ code, the so-called smallest perfect code that permits corrections of generic single-qubit errors. In the experiment, having optimised the encoding circuit, we employ an array of superconducting qubits to realise the $[![5,1,3]!]$ code for several typical logical states including the magic state, an indispensable resource for realising non-Clifford gates. The encoded states are prepared with an average fidelity of $57.1(3)%$ while with a high fidelity of $98.6(1)%$ in the code space. Then, the arbitrary single-qubit errors introduced manually are identified by measuring the stabilizers. We further implement logical Pauli operations with a fidelity of $97.2(2)%$ within the code space. Finally, we realise the decoding circuit and recover the input state with an overall fidelity of $74.5(6)%$, in total with $92$ gates. Our work demonstrates each key aspect of the $[![5,1,3]!]$ code and verifies the viability of experimental realization of quantum error correcting codes with superconducting qubits.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا