Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCorrecting correlated errors for quantum gates in multi-qubit systems using smooth pulse control
94
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In multi-qubit system, correlated errors subject to unwanted interactions with other qubits is one of the major obstacles for scaling up quantum computers to be applicable. We present two approaches to correct such noise and demonstrate with high fidelity and robustness. We use spectator and intruder to discriminate the environment interacting with target qubit in different parameter regime. Our proposed approaches combines analytical theory and numerical optimization, and are general to obtain smooth control pulses for various qubit systems. Both theory and numerical simulations demonstrate to correct these errors efficiently. Gate fidelities are generally above $0.9999$ over a large range of parameter variation for a set of single-qubit gates and two-qubit entangling gates. Comparison with well-known control waveform demonstrates the great advantage of our solutions.
rate research
Read More
Error-corrected quantum computers can only work if errors are small and uncorrelated. Here I show how cosmic rays or stray background radiation affects superconducting qubits by modeling the phonon to electron/quasiparticle down-conversion physics. For present designs, the model predicts about 57% of the radiation energy breaks Cooper pairs into quasiparticles, which then vigorously suppress the qubit energy relaxation time ($T_1 sim$ 160 ns) over a large area (cm) and for a long time (ms). Such large and correlated decay kills error correction. Using this quantitative model, I show how this energy can be channeled away from the qubit so that this error mechanism can be reduced by many orders of magnitude. I also comment on how this affects other solid-state qubits.
We propose a strategy for engineering multi-qubit quantum gates. As a first step, it employs an eigengate to map states in the computational basis to eigenstates of a suitable many-body Hamiltonian. The second step employs resonant driving to enforce a transition between a single pair of eigenstates, leaving all others unchanged. The procedure is completed by mapping back to the computational basis. We demonstrate the strategy for the case of a linear array with an even number N of qubits, with specific XX+YY couplings between nearest neighbors. For this so-called Krawtchouk chain, a 2-body driving term leads to the iSWAP$_N$ gate, which we numerically test for N = 4 and 6.
We provide a characterization and analysis of the effects of dissipation on oscillator assisted (qubus) quantum gates. The effects can be understood and minimized by looking at the dynamics of the signal coherence and its entanglement with the continuous variable probe. Adding loss in between successive interactions we obtain the effective quantum operations, providing a novel approach to loss analysis in such hybrid settings. We find that in the presence of moderate dissipation the gate can operate with a high fidelity. We also show how a simple iteration scheme leads to independent single qubit dephasing, while retaining the conditional phase operation regardless of the amount of loss incurred by the probe.
We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error correcting codes, thus allowing us to ``quantize all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a small-scale ion trap quantum information processor. We further adapt the method to state preparation and quantum algorithms with in-sequence measurements.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
