arXiv subjects

Jiaan Qi

Publications and source records attributed to Jiaan Qi.

6 recordsLinked to original sources

arXiv2026

Robust Spin Qubit Coupler via Minimal Kitaev Chain

While a minimal Kitaev chain is promised to host unprotected Majorana zero modes, its role for spin qubits is relatively underappreciated. Following recent breakthroughs in the fine control of transport behaviors, we propose to use minimal Kitaev chain as a robust coupling module between spin qubits. Long-distance, anisotropic exchange coupling can be mediated by the Andreev bound states (ABSs) in the hybrid segment. The chemical potential of ABS gives a simple way to selectively control the coupling strength and its response to local perturbations. Moreover, this additional control degree of freedom creates a unique sweet spot, allowing both strong coupling and first-order immunity against charge noise. The protected qubit encoded on the minimal Kitaev chain at the sweet spot is shown to boast over 200 fold improvement in decoherence time.

cond-mat.mes-hall↗

arXiv2025

Multi-qubit DC gates over an inhomogeneous array of quantum dots

The prospect of large-scale quantum computation with an integrated chip of spin qubits is imminent as technology improves. This invites us to think beyond the traditional 2-qubit-gate framework and consider a naturally supported ``instruction set'' of multi-qubit gates. In this work, we systematically study such a family of multi-qubit gates implementable over an array of quantum dots by DC evolution. A useful representation of the computational Hamiltonian is proposed for a dot-array with strong spin-orbit coupling effects, distinctive $g$-factor tensors and varying interdot couplings. Adopting a perturbative treatment, we model a multi-qubit DC gate by the first-order dynamics in the qubit frame and develop a detailed formalism for decomposing the resulting gate, estimating and optimizing the coherent gate errors with appropriate local phase shifts for arbitrary array connectivity. Examples of such multi-qubit gates and their applications in quantum error correction and quantum algorithms are also explored, demonstrating their potential advantage in accelerating complex tasks and reducing overall errors.

quant-ph↗

arXiv2023

Spin-Orbit Interaction Enabled High-Fidelity Two-Qubit Gates

We study the implications of spin-orbit interaction (SOI) for two-qubit gates (TQGs) in semiconductor spin qubit platforms. SOI renders the exchange interaction governing qubit pairs anisotropic, posing a serious challenge for conventional TQGs derived for the isotropic Heisenberg exchange. Starting from microscopic level, we develop a concise computational Hamiltonian that captures the essence of SOI, and use it to derive properties of the rotating-frame time evolutions. Two key findings are made. First, for the controlled-phase/controlled-Z gate, we show and analytically prove the existence of ``SOI nodes'' where the fidelity can be optimally enhanced, with only slight modifications in terms of gate time and local phase corrections. Second, we discover and discuss novel two-qubit dynamics that are inaccessible without SOI -- the reflection gate and the direct controlled-not gate. The relevant conditions and achievable fidelities are studied for the direct controlled-not gate.

cond-mat.mes-hall↗

arXiv2023

Efficacy of noisy dynamical decoupling

Dynamical decoupling (DD) refers to a well-established family of methods for error mitigation, comprising pulse sequences aimed at averaging away slowly evolving noise in quantum systems. Here, we revisit the question of its efficacy in the presence of noisy pulses in scenarios important for quantum devices today: pulses with gate control errors, and the computational setting where DD is used to reduce noise in every computational gate. We focus on the well-known schemes of periodic (or universal) DD, and its extension, concatenated DD, for scaling up its power. The qualitative conclusions from our analysis of these two schemes nevertheless apply to other DD approaches. In the presence of noisy pulses, DD does not always mitigate errors. It does so only when the added noise from the imperfect DD pulses do not outweigh the increased ability in averaging away the original background noise. We present breakeven conditions that delineate when DD is useful, and further find that there is a limit in the performance of concatenated DD, specifically in how far one can concatenate the DD pulse sequences before the added noise no longer offers any further benefit in error mitigation.

quant-ph↗

arXiv2020

Randomized benchmarking in the presence of time-correlated dephasing noise

Randomized benchmarking has emerged as a popular and easy-to-implement experimental technique for gauging the quality of gate operations in quantum computing devices. A typical randomized benchmarking procedure identifies the exponential decay in the fidelity as the benchmarking sequence of gates increases in length, and the decay rate is used to estimate the fidelity of the gate. That the fidelity decays exponentially, however, relies on the assumption of time-independent or static noise in the gates, with no correlations or significant drift in the noise over the gate sequence, a well-satisfied condition in many situations. Deviations from the standard exponential decay, however, have been observed, usually attributed to some amount of time correlations in the noise, though the precise mechanisms for deviation have yet to be fully explored. In this work, we examine this question of randomized benchmarking for time-correlated noise---specifically for time-correlated dephasing noise for exact solvability---and elucidate the circumstances in which a deviation from exponential decay can be expected.

quant-ph↗

arXiv2019

Comparing randomized benchmarking figure with average infidelity of quantum gate-set

Randomized benchmarking (RB) is a popular procedure used to gauge the performance of a set of gates useful for quantum information processing (QIP). Recently, Proctor et al. [Phys. Rev. Lett. 119, 130502 (2017)] demonstrated a practically relevant example where the RB measurements give a number $r$ very different from the actual average gate-set infidelity $ε$, despite past theoretical assurances that the two should be equal. Here, we derive formulas for $ε$, and for $r$ from the RB protocol, in a manner permitting easy comparison of the two. We show in general that, indeed, $r\neq ε$, i.e., RB does not measure average infidelity, and, in fact, neither one bounds the other. We give several examples, all plausible in real experiments, to illustrate the differences in $ε$ and $r$. Many recent papers on experimental implementations of QIP have claimed the ability to perform high-fidelity gates because they demonstrated small $r$ values using RB. Our analysis shows that such a statement from RB alone has to be interpreted with caution.

quant-ph↗