We review our work concerning a method of decoherence control via concatenated dynamical decoupling (DD) pulses. These recursively nested DD pulse sequences exhibit a fault-tolerance threshold similar to that of concatenated quantum error correcting codes. We briefly discuss how quantum logic gates can be incorporated into this framework.
We review our work concerning a method of decoherence control via concatenated dynamical decoupling (DD) pulses. These recursively nested DD pulse sequences exhibit a fault-tolerance threshold similar to that of concatenated quantum error correcting codes. We briefly discuss how quantum logic gates can be incorporated into this framework.
Dynamical decoupling pulse sequences have been used to extend coherence times in quantum systems ever since the discovery of the spin-echo effect. Here we introduce a method of recursively concatenated dynamical decoupling pulses, designed to overcome both decoherence and operational errors. This is important for coherent control of quantum systems such as quantum computers. For bounded-strength, non-Markovian environments, such as for the spin-bath that arises in electron- and nuclear-spin based solid-state quantum computer proposals, we show that it is strictly advantageous to use concatenated pulses, as opposed to standard periodic dynamical decoupling pulse sequences. Namely, the concatenated scheme is both fault tolerant and superpolynomially more efficient, at equal cost. We derive a condition on the pulse noise level below which concatenation is guaranteed to reduce decoherence.
We study how dynamical decoupling (DD) pulse sequences can improve the reliability of quantum computers. We prove upper bounds on the accuracy of DD-protected quantum gates and derive sufficient conditions for DD-protected gates to outperform unprotected gates. Under suitable conditions, fault-tolerant quantum circuits constructed from DD-protected gates can tolerate stronger noise and have a lower overhead cost than fault-tolerant circuits constructed from unprotected gates. Our accuracy estimates depend on the dynamics of the bath that couples to the quantum computer and can be expressed either in terms of the operator norm of the bath's Hamiltonian or in terms of the power spectrum of bath correlations; we explain in particular how the performance of recursively generated concatenated pulse sequences can be analyzed from either viewpoint. Our results apply to Hamiltonian noise models with limited spatial correlations.
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 does not outweigh the increased ability in averaging away the original background noise. We present break-even 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.
Quantum control and fault-tolerant quantum computing (FTQC) are two of the cornerstones on which the hope of realizing a large-scale quantum computer is pinned, yet only preliminary steps have been taken towards formalizing the interplay between them. Here we explore this interplay using the powerful strategy of dynamical decoupling (DD), and show how it can be seamlessly and optimally integrated with FTQC. To this end we show how to find the optimal decoupling generator set (DGS) for various subspaces relevant to FTQC, and how to simultaneously decouple them. We focus on stabilizer codes, which represent the largest contribution to the size of the DGS, showing that the intuitive choice comprising the stabilizers and logical operators of the code is in fact optimal, i.e., minimizes a natural cost function associated with the length of DD sequences. Our work brings hybrid DD-FTQC schemes, and their potentially considerable advantages, closer to realization.
Quantum computation (QC) relies on the ability to implement high-fidelity quantum gate operations and successfully preserve quantum state coherence. One of the most challenging obstacles for reliable QC is overcoming the inevitable interaction between a quantum system and its environment. Unwanted interactions result in decoherence processes that cause quantum states to deviate from a desired evolution, consequently leading to computational errors and loss of coherence. Dynamical decoupling (DD) is one such method, which seeks to attenuate the effects of decoherence by applying strong and expeditious control pulses solely to the system. Provided the pulses are applied over a time duration sufficiently shorter than the correlation time associated with the environment dynamics, DD effectively averages out undesirable interactions and preserves quantum states with a low probability of error, or fidelity loss. In this study various aspects of this approach are studied from sequence construction to applications of DD to protecting QC. First, a comprehensive examination of the error suppression properties of a near-optimal DD approach is given to understand the relationship between error suppression capabilities and the number of required DD control pulses in the case of ideal, instantaneous pulses. While such considerations are instructive for examining DD efficiency, i.e., performance vs the number of control pulses, high-fidelity DD in realizable systems is difficult to achieve due to intrinsic pulse imperfections which further contribute to decoherence. As a second consideration, it is shown how one can overcome this hurdle and achieve robustness and recover high-fidelity DD in the presence of faulty control pulses using Genetic Algorithm optimization and sequence symmetrization. Thirdly, to illustrate the implementation of DD in conjunction with QC, the utilization of DD and quantum error correction codes (QECCs) as a protection method for adiabatic quantum computing (AQC) is discussed. A performance comparison between two deterministic DD schemes is given, where preference towards one particular method is found due to sequence structure and procedure from which higher accuracy sequences are generated.
Dephasing--phase randomization of a quantum superposition state--is a major obstacle for the realization of high fidelity quantum logic operations. Here, we implement a two-qubit controlled-NOT gate using dynamical decoupling (DD), despite the gate time being more than 1 order of magnitude longer than the intrinsic coherence time of the system. For realizing this universal conditional quantum gate, we have devised a concatenated DD sequence that ensures robustness against imperfections of DD pulses that otherwise may destroy quantum information or interfere with gate dynamics. We compare its performance with three other types of DD sequences. These experiments are carried out using a well-controlled prototype quantum system--trapped atomic ions coupled by an effective spin-spin interaction. The scheme for protecting conditional quantum gates demonstrated here is applicable to other physical systems, such as nitrogen vacancy centers, solid state nuclear magnetic resonance, and circuit quantum electrodynamics.