Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimization of the surface code design for Majorana-based qubits
104
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT gates between the data qubits with nearest-neighbor ancilla qubits. Here, we present surface code error-correction schemes using $textit{only}$ Pauli measurements on single qubits and on pairs of nearest-neighbor qubits. In particular, we provide several qubit layouts that offer favorable trade-offs between qubit overhead, circuit depth and connectivity degree. We also develop minimized measurement sequences for syndrome extraction, enabling reduced logical error rates and improved fault-tolerance thresholds. Our work applies to topologically protected qubits realized with Majorana zero modes and to similar systems in which multi-qubit Pauli measurements rather than CNOT gates are the native operations.
rate research
Read More
Although Majorana platforms are promising avenues to realizing topological quantum computing, they are still susceptible to errors from thermal noise and other sources. We show that the error rate of Majorana qubits can be drastically reduced using a 1D repetition code. The success of the code is due the imbalance between the phase error rate and the flip error rate. We demonstrate how a repetition code can be naturally constructed from segments of Majorana nanowires. We find the optimal lifetime may be extended from a millisecond to over one second.
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.
Leakage outside of the qubit computational subspace, present in many leading experimental platforms, constitutes a threatening error for quantum error correction (QEC) for qubits. We develop a leakage-detection scheme via Hidden Markov models (HMMs) for transmon-based implementations of the surface code. By performing realistic density-matrix simulations of the distance-3 surface code (Surface-17), we observe that leakage is sharply projected and leads to an increase in the surface-code defect probability of neighboring stabilizers. Together with the analog readout of the ancilla qubits, this increase enables the accurate detection of the time and location of leakage. We restore the logical error rate below the memory break-even point by post-selecting out leakage, discarding about 47% of the data. Leakage detection via HMMs opens the prospect for near-term QEC demonstrations, targeted leakage reduction and leakage-aware decoding and is applicable to other experimental platforms.
We analyze a readout scheme for Majorana qubits based on dispersive coupling to a resonator. We consider two variants of Majorana qubits: the Majorana transmon and the Majorana box qubit. In both cases, the qubit-resonator interaction can produce sizeable dispersive shifts in the MHz range for reasonable system parameters, allowing for submicrosecond readout with high fidelity. For Majorana transmons, the light-matter interaction used for readout manifestly conserves Majorana parity, which leads to a notion of quantum nondemolition (QND) readout that is stronger than for conventional charge qubits. In contrast, Majorana box qubits only recover an approximately QND readout mechanism in the dispersive limit where the resonator detuning is large. We also compare dispersive readout to longitudinal readout for the Majorana box qubit. We show that the latter gives faster and higher fidelity readout for reasonable parameters, while having the additional advantage of being manifestly QND, and so may prove to be a better readout mechanism for these systems.
Simulations of high-complexity quantum systems, which are intractable for classical computers, can be efficiently done with quantum computers. Similarly, the increasingly complex quantum electronic circuits themselves will also need efficient simulations on quantum computers, which in turn will be important in quantum-aided design for next-generation quantum processors. Here, we implement variational quantum eigensolvers to simulate a Josephson-junction-array quantum circuit, which leads to the discovery of a new type of high-performance qubit, plasonium. We fabricate this new qubit and demonstrate that it exhibits not only long coherence time and high gate fidelity, but also a shrinking physical size and larger anharmonicity than the transmon, which can offer a number of advantages for scaling up multi-qubit devices. Our work opens the way to designing advanced quantum processors using existing quantum computing resources.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
