Do you want to publish a course? Click here

Fault-Tolerant Multi-Qubit Geometric Entangling Gates Using Photonic Cat Qubits

83   0   0.0 ( 0 )
 Added by Ye-Hong Chen Dr.
 Publication date 2021
  fields Physics
and research's language is English




Ask ChatGPT about the research

We propose a protocol to implement multi-qubit geometric gates (i.e., the M{o}lmer-S{o}rensen gate) using photonic cat qubits. These cat qubits stored in high-$Q$ resonators are promising for hardware-efficient universal quantum computing. Specifically, in the limit of strong two-photon drivings, phase-flip errors of the cat qubits are effectively suppressed, leaving only a bit-flip error to be corrected. A geometric evolution guarantees the robustness of the protocol against stochastic noise along the evolution path. Moreover, by changing detunings of the cavity-cavity couplings at a proper time, the protocol can be robust against control imperfections (e.g., the total evolution time) without introducing extra noises into the system. As a result, the gate can produce multi-mode entangled cat states in a short time with high fidelities.



rate research

Read More

We describe and implement a family of entangling gates activated by radio-frequency flux modulation applied to a tunable transmon that is statically coupled to a neighboring transmon. The effect of this modulation is the resonant exchange of photons directly between levels of the two-transmon system, obviating the need for mediating qubits or resonator modes and allowing for the full utilization of all qubits in a scalable architecture. The resonance condition is selective in both the frequency and amplitude of modulation and thus alleviates frequency crowding. We demonstrate the use of three such resonances to produce entangling gates that enable universal quantum computation: one iSWAP gate and two distinct controlled Z gates. We report interleaved randomized benchmarking results indicating gate error rates of 6% for the iSWAP (duration 135ns) and 9% for the controlled Z gates (durations 175 ns and 270 ns), limited largely by qubit coherence.
We reduce the extra qubits needed for two fault-tolerant quantum computing protocols: error correction, specifically syndrome bit measurement, and cat state preparation. For distance-three fault-tolerant syndrome extraction, we show an exponential reduction in qubit overhead over the previous best protocol. For a weight-$w$ stabilizer, we demonstrate that stabilizer measurement tolerating one fault needs at most $lceil log_2 w rceil + 1$ ancilla qubits. If qubits reset quickly, four ancillas suffice. We also study the preparation of entangled cat states, and prove that the overhead for distance-three fault tolerance is logarithmic in the cat state size. These results apply both to near-term experiments with a few qubits, and to the general study of the asymptotic resource requirements of syndrome measurement and state preparation. With $a$ flag qubits, previous methods use $O(a)$ flag patterns to identify faults. In order to use the same flag qubits more efficiently, we show how to use nearly all $2^a$ possible flag patterns, by constructing maximal-length paths through the $a$-dimensional hypercube.
We demonstrate a simple pulse shaping technique designed to improve the fidelity of spin-dependent force operations commonly used to implement entangling gates in trapped-ion systems. This extension of the M{o}lmer-S{o}rensen gate can theoretically suppress the effects of certain frequency and timing errors to any desired order and is demonstrated through Walsh modulation of a two-qubit entangling gate on trapped atomic ions. The technique is applicable to any system of qubits coupled through collective harmonic oscillator modes.
We present a comprehensive architectural analysis for a fault-tolerant quantum computer based on cat codes concatenated with outer quantum error-correcting codes. For the physical hardware, we propose a system of acoustic resonators coupled to superconducting circuits with a two-dimensional layout. Using estimated near-term physical parameters for electro-acoustic systems, we perform a detailed error analysis of measurements and gates, including CNOT and Toffoli gates. Having built a realistic noise model, we numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. Our next step toward universal fault-tolerant quantum computation is a protocol for fault-tolerant Toffoli magic state preparation that significantly improves upon the fidelity of physical Toffoli gates at very low qubit cost. To achieve even lower overheads, we devise a new magic-state distillation protocol for Toffoli states. Combining these results together, we obtain realistic full-resource estimates of the physical error rates and overheads needed to run useful fault-tolerant quantum algorithms. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer that can run circuits which are intractable for classical supercomputers. Hardware with 32,000 superconducting circuit components, in turn, could simulate the Hubbard model in a regime beyond the reach of classical computing.
We show that parametric coupling techniques can be used to generate selective entangling interactions for multi-qubit processors. By inducing coherent population exchange between adjacent qubits under frequency modulation, we implement a universal gateset for a linear array of four superconducting qubits. An average process fidelity of $mathcal{F}=93%$ is estimated for three two-qubit gates via quantum process tomography. We establish the suitability of these techniques for computation by preparing a four-qubit maximally entangled state and comparing the estimated state fidelity against the expected performance of the individual entangling gates. In addition, we prepare an eight-qubit register in all possible bitstring permutations and monitor the fidelity of a two-qubit gate across one pair of these qubits. Across all such permutations, an average fidelity of $mathcal{F}=91.6pm2.6%$ is observed. These results thus offer a path to a scalable architecture with high selectivity and low crosstalk.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

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