Related papers: Faster Randomized Dynamical Decoupling
A long line of research about connectivity in the Massively Parallel Computation model has culminated in the seminal works of Andoni et al. [FOCS'18] and Behnezhad et al. [FOCS'19]. They provide a randomized algorithm for low-space MPC with…
Quantum dynamical decoupling is a procedure to cancel the effective coupling between two systems by applying sequences of fast actuations, under which the coupling Hamiltonian averages out to leading order(s). One of its prominent uses is…
We study the dissipative dynamics of a qubit that is afflicted by classical random telegraph noise and it is subject to dynamical decoupling. We derive exact formulas for the qubit dynamics at arbitrary working points in the limit of…
One approach to maintaining phase coherence of qubits through dynamical decoupling consists of applying a sequence of Hahn spin-echo pulses. Recent studies have shown that, in certain noise environments, judicious choice of the delay times…
A dynamical decoupling method is presented which is based on embedding a deterministic decoupling scheme into a stochastic one. This way it is possible to combine the advantages of both methods and to increase the suppression of undesired…
We present a detailed experimental study of the Uhrig Dynamical Decoupling (UDD) sequence in a variety of noise environments. Our qubit system consists of a crystalline array of $^{9}$Be$^{+}$ ions confined in a Penning trap. We use an…
This paper develops a robust dynamic mode decomposition (RDMD) method endowed with statistical and numerical robustness. Statistical robustness ensures estimation efficiency at the Gaussian and non-Gaussian probability distributions,…
With ongoing developments in digitalization and advances in the field of autonomous driving, on-demand ride pooling is a mobility service with the potential to disrupt the urban mobility market. Nevertheless, to apply this kind of service…
We investigate decoupling, one of the most important primitives in quantum Shannon theory, by replacing the uniformly distributed random unitaries commonly used to achieve the protocol, with repeated applications of random unitaries…
In pulsed dynamic nuclear polarization (DNP), enhancement of the polarization of bulk nuclei requires the repeated application of a microwave pulse sequence. So far, analysis of a one-time transfer of electron spin polarization to a…
Mixup is an efficient data augmentation approach that improves the generalization of neural networks by smoothing the decision boundary with mixed data. Recently, dynamic mixup methods have improved previous static policies effectively…
Denoising Diffusion Probabilistic Models (DDPMs) have emerged as a powerful family of generative models that can yield high-fidelity samples and competitive log-likelihoods across a range of domains, including image and speech synthesis.…
Dynamic polarization protocols aim to hyperpolarize a spin bath by transferring spin polarization from a well-controlled qubit such as a quantum dot or a color defect. Building on techniques from shortcuts to adiabaticity, we design fast…
This paper proposes a communication strategy for decentralized learning on wireless systems. Our discussion is based on the decentralized parallel stochastic gradient descent (D-PSGD), which is one of the state-of-the-art algorithms for…
Sampling-based motion planning is the predominant paradigm in many real-world robotic applications, but its performance is immensely dependent on the quality of the samples. The majority of traditional planners are inefficient as they use…
We demonstrate the use of dynamic decoupling techniques to extend the coherence time of a single memory qubit by nearly two orders of magnitude. By extending the Hahn spin-echo technique to correct for unknown, arbitrary polynomial…
Differential Dynamic Programming (DDP) is an efficient computational tool for solving nonlinear optimal control problems. It was originally designed as a single shooting method and thus is sensitive to the initial guess supplied. This work…
The fidelity of applications on near-term quantum computers is limited by hardware errors. In addition to errors that occur during gate and measurement operations, a qubit is susceptible to idling errors, which occur when the qubit is idle…
We present a set of experimentally feasible pulse sequences that implement any single-qubit gate on a singlet-triplet spin qubit and demonstrate that these new sequences are up to three times faster than existing sequences in the…
An embedded selective recoupling method is proposed which is based on the idea of embedding the recently proposed deterministic selective recoupling scheme of Yamaguchi et al. [quant-ph/0411099] into a stochastic dynamical decoupling…