 Research
 Open Access
 Published:
Walshsynthesized noise filters for quantum logic
EPJ Quantum Technology volume 2, Article number: 11 (2015)
Abstract
We study a novel class of openloop control protocols constructed to perform arbitrary nontrivial singlequbit logic operations robust against timedependent nonMarkovian noise. Amplitude and phase modulation protocols are crafted leveraging insights from functional synthesis and the basis set of Walsh functions. We employ the experimentally validated generalized filtertransfer function formalism in order to find optimized control protocols for target operations in SU(2) by defining a cost function for the filtertransfer function to be minimized through the applied modulation. Our work details the various techniques by which we define and then optimize the filtersynthesis process in the Walsh basis, including the definition of specific analytic design rules which serve to efficiently constrain the available synthesis space. This approach yields modulatedgate constructions consisting of chains of discrete pulsesegments of arbitrary form, whose modulation envelopes possess intrinsic compatibility with digital logic and clocking. We derive novel families of Walshmodulated noise filters designed to suppress dephasing and coherent amplitudedamping noise, and describe how wellknown sequences derived in NMR also fall within the Walshsynthesis framework. Finally, our work considers the effects of realistic experimental constraints such as limited modulation bandwidth on achievable filter performance.
1 Introduction
In realistic laboratory settings, decoherence in quantum systems is dominated by timedependent nonMarkovian noise processes with long correlations, frequently characterized by lowfrequency dominated noise power spectra [1–5]. These may arise either from environmental fluctuations or  in the important case of driven quantum systems  from noise in the control device itself [6]. In either case, the result is a reduction in the fidelity of a target control operation, including both memory and nontrivial operations. These phenomena present a major challenge as quantum devices move from proof of principle demonstrations to realistic applications, where performance demands on the quantum devices are frequently extreme. Accordingly, finding ways to control quantum systems efficiently and effectively in the presence of noise is a central task in quantum control theory [7–10].
A range of techniques relying on both open and closedloop control have been devised to address this challenge [11–13] at various levels in a layered architecture for quantum computing [14]. In particular, openloop dynamical error suppression strategies (without the need for measurement or feedback) such as dynamic decoupling (DD) [15–18], dynamically corrected gates (DCGs) [19–25], and composite pulsing [26–28], have emerged as resourceefficient approaches for physicallayer decoherence control. They are joined by a new class of continuously modulated (‘alwayson’) dynamical decoupling and dynamically protected gate schemes [29–36] inspired by well established techniques in NMR.
These schemes all address the question of decoherence mitigation, but looking across their breadth, have both benefitted and suffered from reliance on a wide range of theoretical techniques. Unfortunately the analytic tools for crafting control protocols employed in any particular setting do not necessarily translate equivalently between approaches, nor do the methods generally employed for evaluating efficacy easily translate to experimentally measured characteristics of the environment. This is a major challenge for experimentalists or systems designers attempting to determine which of the many openloop control schemes to employ in a particular experiment. As an example, the powerful group theoretic insights and consideration of timevarying environments that permit the construction of errorrobust, boundedstrength SU(2) operations for quantum information in Viola’s DCG framework are quite different from the geometric considerations and quasistatic noise assumptions widely employed in NMR composite pulsing. This issue has been highlighted recently as new work has revealed striking differences between the timedomain noise sensitivity of control protocols as compared to longstanding notions of error cancellation in the Magnus expansion [37, 38].
A unified and experimentally relevant framework for devising and evaluating errorsuppressing gates in realistic noise environments is therefore needed to secure the role of dynamical error suppression in systematic designs of quantum technologies including faulttolerant quantum computers. Kurizki provided a promising path towards this end with his seminal work framing the problem of finding decoherencesuppressing control protocols by considering appropriate frequencydomain modification of the systemenvironment coupling [39, 40]. Residual errors could be calculated through overlap integrals of the power spectrum describing the environmental noise, and functions capturing the frequencydomain response of any applied control. This framework  effectively a quantum generalization of transfer functions widely used in control engineering [41]  provides a simple heuristic approach to understanding the performance of an arbitrary control protocol in an arbitrary noise environment. Stated simply, effective errorsuppressing control protocols ‘filter’ the noise over a userdefined band, therefore mitigating decoherence in the quantum system [42].
Early demonstrations of this framework applied to the simple case of implementing the protected identity operator to qubits by dynamical decoupling [15, 43–47], where the filter functions could be calculated for pure dephasing in a straightforward manner using concepts of linear control [42]. Expanding significantly beyond this work, the challenge of crafting generalized analytic forms for the transfer functions describing arbitrary singlequbit control compatible with universal noncommuting noise (a problem in nonlinear control) has recently been addressed theoretically [28, 38, 48, 49], and validated in experiment [37]. Further theoretical extensions of filtertransfer functions to twoqubit gates highlight the breadth of applicability of this approach to quantum control [50–52].
Beyond its simple intuitive nature, the power of the filter transfer function approach comes from the fact that it can in principle be applied to studying dynamicerrorsuppression control protocols derived through any manner of analytic approach. It permits the application of well tested engineering concepts for control systems design; the complex physics associated with quantum dynamics in timedependent environments with noncommuting noise and control Hamiltonians is relegated to the calculation of the generalized filter transfer functions themselves, and once derived these may be deployed in blockdiagram systems analyses [41].
With these significant advances and the promise of applying the suite of insights from control theory to the quantum regime, the noisefiltering approach to quantum control has leapt to the fore, providing a unifying framework applicable over a wide parameter range of interest to real experimental settings. Nonetheless, outstanding challenges remain in how to leverage the generalized filtertransferfunction framework [48, 49] to systematically craft effective errorsuppressing gate constructions while also heeding realistic system constraints imposed by hardware systems. For instance, the presence of finite timing precision and limited classical communication bandwidth between the physical (quantum) layer and a classical controller [14] impose new constraints not generally captured when solely considering quantum dynamical evolution of an individual state.
We address this challenge, introducing a quantum control toolkit permitting the realization of physicallayer errorsuppressing control protocols that are simultaneously effective in suppressing error and compatible with a variety of major hardware restrictions. We leverage the generalized filtertransfer function formalism as a unifying theoretical construct, and employ techniques from functional analysis in order to realize appropriate modulation protocols applied to a nearresonant carrier frequency for enacting highfidelity quantum control operations on single qubits [30, 53]. Our work identifies the Walsh functions  squarewave analogues of the sines and cosines  as natural building blocks for constructing the modulation protocols designed to filter timevarying noise over a user defined band while enacting a nontrivial qubit rotation. The Walsh functions are defined in a uniform piecewiseconstant fashion, building intrinsic compatibility with discrete clocking [54] and classical digital logic, and have previously been identified as providing a powerful mathematical framework in the context of quantum control sequencing [51]. Moreover, they may be arbitrarily combined using Fourierlike synthesis using techniques for arbitrary waveform generation well established in digital signal processing.
We treat a Walshmodulated driven qubit system weakly interacting with both dephasing and coherent amplitudedamping noise processes. The task of finding Walshsynthesized modulation patterns that produce effective filters is reduced to minimizing a cost function measuring the extent to which noise over a userdefined spectral band is filtered by the applied control. The performance of resulting control protocols is completely characterized by their Walsh spectra, facilitating intuitive analytic design rules based on symmetry and spectral properties of the Walsh basis. Our work details the various techniques and mathematical constructs through which we define and then optimize the filtersynthesis process in the Walsh basis, and considers the effects of realistic experimental constraints such as limited modulation bandwidth.
With these insights, we derive novel families of Walshmodulated noise filters designed to suppress dephasing and coherent amplitudedamping noise, and describe their properties. Modulation protocols are tailored to a particular operation on SU(2), but are otherwise largely modelrobust (being tailored to suppress noise over a frequency band rather than to a specific timedomain noise signal), and portable between different qubit technologies. Combined with the discovery, presented here, that several prominent composite pulse protocols derived in NMR actually fall within the Walshsynthesis basis  mirroring similar insights in the context of dynamical decoupling [51]  this work positions the Walsh functions as a natural basis for crafting physicallayer error suppression strategies for scalable quantum technologies.
The remainder of this paper is organized as follows. In Section 2 we describe our model quantum system by defining relevant control and noise Hamiltonians. In Section 3 we review the generalized filtertransfer function formalism used to derive a spectral representation of the operational infidelity. Notation for defining and parameterizing the control space is introduced and explicit expressions for computing corresponding filter functions are presented. Section 4 provides a formal definition of a filter cost function used for optimizing operational fidelity over the control space and deriving useful filters. Performance characteristics of these filters are discussed and interpreted, with care taken to differentiate filter order from Magnus order. In Section 5 physically motivated constraints on the control space are established by synthesizing control waveforms as superpositions of functions in the Walsh basis, bounding the dimensionality of the filteroptimization task. Two useful representations of the Walsh basis  Paley ordering and the Hadamard representation  are introduced. We then develop a range of analytic filterdesign rules for efficient filter construction based on the symmetry and spectral properties of the Walsh functions. In Sections 69 we apply the above framework to derive several novel families of noise filters implementing nontrivial logic gates. These include filters for dephasing and coherent amplitudedamping noise in addition to concatenated filters for universal noise. In Section 10 we study how relaxing the assumption of perfect square pulses reduces the performance of filters optimized in the Walsh basis, and demonstrate that these filter properties may be recovered in general by simply reoptimizing under the assumption of nonsquare pulses. We then close with a brief summary and outlook, followed by a number of appendices containing detailed derivations of relevant quantities used in the main text.
2 Physical setting
We begin by establishing the Hamiltonian framework for the control and noise interactions treated in this paper. This is necessary background in order to study noise filtering via Walshsynthesized control fields implementing logic gates. We consider a model quantum system consisting of an ensemble of identically prepared noninteracting qubits immersed in a weakly interacting noise bath and driven by an external control device. Working in the interaction picture with respect to the qubit splitting, state transformations are represented as unitary rotations of the Bloch vector. In this interaction picture the generalized timedependent Hamiltonian is written
where \({H}_{c} (t)\) describes perfect control of the qubit state, e.g. via an ideal external driving field, and the noise Hamiltonian \({H}_{0} (t)\) captures undesirable interactions with a timevarying nonMarkovian noise environment. The full qubit dynamics are governed by the Schrodinger equation \(i\dot{U}(t,0) = H(t)U(t,0)\) where the timeevolution operator \(U(t,0)\) transforms an initial state \( \psi(0) \rangle \) to the final \(U(\tau,0) \psi(0) \rangle \) after an interaction of duration τ.
In the absence of noise the total Hamiltonian reduces to \(H(t) = {H}_{c} (t)\), in which case timeevolution is determined purely by control operations according to \(i\dot{U}_{c}(t,0) = H_{c}(t)U_{c}(t,0)\). An intended evolution path under ideal control is therefore described by the control propagator \(U_{c} (t,0) = \mathcal {T}\exp (i\int_{0}^{t}{H}_{c} (t')\,dt' )\), with \(\mathcal {T}\) denoting the timeordering operator. For a single qubit the timedependent control Hamiltonian may in general be written \({H}_{c} (t) = \Omega(t)\hat {\mathbf {n}}(t)\cdot \boldsymbol {\sigma }/2\). Here \(\hat {\mathbf {n}}(t)\cdot \boldsymbol {\sigma }\equiv n_{x}\hat {\sigma }_{x}+n_{y}\hat {\sigma }_{y}+n_{z}\hat {\sigma }_{z}\) is the rotation generator, \(\hat {\mathbf {n}}(t)\in\mathbb{R}\) is a unit vector defining the instantaneous axis of rotation, and \(\Omega(t)\) is the instantaneous rate of rotation (Rabi rate) for the Bloch vector.
Environmental interactions are modeled semiclassically, with stochastic noise processes expressed in terms of timedependent fluctuating classical noise fields. We consider timedependent dephasing (detuning) and coherent amplitudedamping processes, captured respectively through (stochastic) rotations about \(\hat {\sigma }_{z}\) and about the instantaneous direction of control \(\hat {\mathbf {n}}(t)\cdot \boldsymbol {\sigma }\). The universal noise Hamiltonian thus takes the form \({H}_{0} (t) = H_{0}^{(z)}(t) + H_{0}^{(\Omega)}(t)\) where \(H_{0}^{(z)}(t)\) and \(H_{0}^{(\Omega)}(t)\) denote noise interactions in the dephasing and amplitude noise quadratures respectively. Dephasing noise thus contributes the additive term
where \(\beta_{z} (t)\) describes a timevarying noise field. Coherent amplitudedamping noise contributes the multuplicative term
Including this term is equivalent to making the substitution \(\Omega (t)\longrightarrow\Omega(t)(1+\beta_{{\Omega}}(t))\) in the control Hamiltonian, where \(\beta_{{\Omega}}(t)\) describes a (multiplicative) noise source in the amplitude of the driving field. Inclusion of this term in the noise Hamiltonian enables us to go beyond previous studies where attention has been restricted to dephasing processes. This novel approach is important for most realistic experimental situations where correctable nonMarkovian amplitudedamping errors arise from noise in the control system itself (for example, fluctuations in the strength of the driving field).
In our model both \(\beta_{z} (t)\) and \(\beta_{{\Omega}}(t)\) are assumed to be classical random variables with zero mean and nonMarkvovian power spectra. We also assume they are wide sense stationary and independent.^{Footnote 1} The former implies the autocorrelation functions \(\langle\beta_{i}(t_{1})\beta_{i}(t_{2})\rangle\), \(i\in\{ z,\Omega\}\), depend only on the time difference \(t_{1}t_{2}\). The latter implies the crosscorrelation functions vanish. That is, \(\langle\beta_{i}(t_{1})\beta_{j}(t_{2})\rangle= 0\) where \(i,j\in\{ z,\Omegai\ne j\}\). The angle brackets denote a time average of the random variables. Finally, our model permits access to a wide range of parameter regimes, from quasistatic (noise slow compared to \({H}_{c} (t)\)) to the limit in which the noise fluctuates on timescales comparable to or faster than \({H}_{c} (t)\).
These noise Hamiltonians generate uncontrolled rotations in the qubit dynamics, leading to errors in the evolution path (and hence the final state) relative to the target transformation intended under \({H}_{c} (t)\). An estimate for this error is derived in the next section using the generalized filtertransfer function formalism.
3 Building noise filters
Overall, our objective is to craft control protocols such that the deleterious effects of timedependent noise on the intended evolution of an arbitrary qubit transformation are suppressed  filtered by the control. Accordingly, we require a measure for the operational fidelity in the presence of both noise and the relevant control. For this we employ the method developed by Green et al. [49]. In this framework the error contributed by the noise fields over the duration of the control is approximated, to first order, via a truncated Magnus expansion. Each noise field then contributes a term to the gate infidelity in the spectral domain expressed as an overlap integral between the noise power spectrum and an appropriate generalized filtertransfer function. We describe this in detail below.
3.1 Calculating operational fidelity
In the absence of noise interactions, state evolution is determined by \(i\dot{U}_{c}(t)={H}_{c} (t)U_{c}(t)\) with \(U_{c}(t)\) the ideal evolution operator describing the target operation. Including the effects of noise, however, time evolution is determined by the operator \(U(t)\) satisfying \(i\dot{U}(t) = ({H}_{c} (t)+H_{0}^{(z)}(t)+H_{0}^{(\Omega )}(t))U(t)\). Our measure for operational fidelity is given by \(\mathcal{F}_{av}(\tau) = \frac {1}{4}\langle\operatorname{Tr}(U_{c}^{\dagger}(\tau)U(\tau))^{2}\rangle\), effectively measuring the extent to which the intended and realized operators ‘overlap’, as captured by the HilbertSchmidt inner product [55]. Computing the evolution dynamics, however, is very challenging since the control and noise Hamiltonians do not commute at different times; sequential application of the resulting timedependent, noncommuting operations gives rise to both dephasing and depolarization errors, mandating approximation methods.
Our error model assumes nondissipative qubit evolution with both control and noise interactions resulting in unitary rotations. Hence we approximate the evolution operator as a unitary using a Magnus expansion [56, 57]. This involves moving to a frame corotating with the control known as the toggling frame, originally appearing in the development of average Hamiltonian theory [58]. This approach allows us to separate the part of the system evolution due solely to the control from the part affected by environmental coupling, and is standard in the study of coherent control in NMR [58, 59] and quantum information.
Defining the error propagator \(\tilde {U}(t)\equiv U_{c} ^{\dagger}(t)U (t)\), the total evolution operator is written \(U (t) = U_{c} (t)\tilde {U}(t)\). In this case the realized evolution operator approaches the target operation as \(\tilde {U}(\tau) \rightarrow \mathbf {I}\), establishing the condition for suppression of noisy evolution dynamics. However, moving to the toggling frame defined by toggling frame Hamiltonian \(\tilde{H}_{0} (t) \equiv U_{c}^{\dagger}(t){H}_{0} (t) U_{c} (t)\), the error propagator satisfies the Schrodinger equation \(i\dot{\tilde {U}}(t) = \tilde{H}_{0} (t)\tilde {U}(t)\). Performing a Magnus expansion in this frame  assuming convergence of the series [57]  we may write \(\tilde {U}(\tau) = \exp [i\sum_{\mu= 1}^{\infty} \mathbf {a}_{\mu}(\tau )\cdot \boldsymbol {\sigma }]\) where the error vectors \(\mathbf {a}_{\mu}(\tau )\) determine expansion coefficients of the Magnus series operators \(\Phi_{\mu}(\tau)\) expressed in the basis of Pauli matrices (see Appendix A). We may then in principle approximate \(\tilde{U}(t)\) to arbitrary accuracy by truncating the infinite series at an appropriate order.
The operational fidelity \(\mathcal{F}_{av}(\tau)=\frac{1}{4}\langle \operatorname{Tr}(\tilde {U}(\tau))^{2}\rangle\) may now be fully expressed as an infinite power series over the ensembleaveraged magnitudes of the expansion vectors \(\mathbf {a}_{\mu}(\tau)\). In the limit of sufficiently weak noise,^{Footnote 2} however, it is appropriate to truncate the expansion to firstorder yielding \(\mathcal{F}_{av}(\tau) \approx1  \langle a ^{2}_{1}\rangle\) with \(\langle a ^{2}_{1}\rangle \equiv\langle \mathbf {a}_{1}(\tau)\mathbf {a}_{1}^{T}(\tau)\rangle\) defining the first order infidelity. Now, as set out in Appendix A the firstorder error vector is related to the firstorder Magnus term according to Eq. (70), yielding \(\mathbf {a}_{1}(\tau)\cdot \boldsymbol {\sigma }= \Phi_{1}(\tau) = \int_{0}^{\tau}dt \tilde{H}_{0} (t)\). That is, the firstorder infidelity \(\langle a^{2}_{1}\rangle\) is associated with the timeaverage of the toggling frame Hamiltonian over the total sequence duration.
Expressing \(\tilde{H}_{0} (t)\equiv\vec{\mathcal{R}}(t)\cdot \boldsymbol {\sigma }\) in the Pauli basis, where the expansion vector \(\vec{\mathcal{R}}(t)\) is some convolution of both control and noise fields, we obtain the computational expression \(\mathbf {a}_{1}(\tau) = \int_{0}^{\tau}dt\vec{\mathcal {R}}(t)\). Using the noise model assumptions outlined in Section 2, and performing a number of Fourierlike transforms (see Appendix A for full details), we obtain a spectral representation of the form
Here \(S_{z} (\omega)\) and \(S_{{\Omega }} (\omega)\) denote the dephasing and amplitude noise powerspectral densities (PSDs). The dephasing \(F_{z} (\omega)\) and amplitude \(F_{{\Omega }}(\omega)\) filtertransfer functions, on the other hand, capture the spectral response of the control sequence. Moving forward, we will present the mathematical framework that permits calculation of these quantities for arbitrary control protocols.
3.2 Defining the control space
In order to realize specific noise filters, characterized by the filtertransfer functions introduced above, we require a simple framework to define the timedomain control operations that can be applied to the qubit. Representing the qubit state on the Bloch sphere, state manipulation maps to a rotation in \(\mathbb{R}^{3}\) of the Bloch vector associated with a unitary transformation \(\mathcal {U}(\theta, \hat {\sigma }_{\hat {\mathbf {n}}})\equiv\exp [i (\boldsymbol {\sigma }\cdot \hat {\mathbf {n}})\theta/2 ]\), reflecting the homeomorphism between \(SU(2)\) and \(SO(3)\). The rotation generator \(\hat {\sigma }_{\hat {\mathbf {n}}} \equiv \hat {\mathbf {n}}\cdot \boldsymbol {\sigma }\equiv n_{x}\hat {\sigma }_{x}+n_{y}\hat {\sigma }_{y}+n_{z}\hat {\sigma }_{z}\) produces a rotation though an angle θ about the axis defined by the unit vector \(\hat {\mathbf {n}}\in\mathbb{R}^{3}\).
We treat control protocols taking the form of an nsegment sequence of such unitaries, executed over the time period \([0, \tau ]\). This implies a natural partition of the total sequence duration τ into n subintervals \(I_{l} = [t_{l1},t_{l}]\), \(l\in\{1,\ldots ,n\} \), such that the lth control unitary has duration \(\tau_{l} = t_{l}t_{l1}\). Here \(t_{l1}\) and \(t_{l}\) are the start and end times of the lth rotation respectively, and we define \(t_{0} \equiv0\) and \(t_{n} \equiv\tau\). In particular we consider control unitaries of the form
corresponding to the experimentally relevant case of a resonantly driven qubit. Here \(\Omega_{l}\) is the Rabi rate during the lth time interval \([t_{l1},t_{l}]\), and is assumed constant over the duration \(\tau_{l}\) of the associated control interaction. During this interaction the rotation generator \(\hat {\sigma }_{\phi _{l}}\), parameterized by \(\phi _{l}\in[0,2\pi]\), thus generates a rotation of the Bloch vector through an angle \(\theta_{l} \equiv\Omega_{l}\tau_{l}\) about the axis \(\hat {\mathbf {n}}_{l} \equiv (\cos(\phi_{l}),\sin(\phi_{l}),0 )\) in the xy plane.^{Footnote 3} The control Hamiltonian associated with this nsegment sequence takes the form
where the function \(G^{(l)}(t)\) is 1 if \(t\in I_{l}\) and zero otherwise. Controlled evolution during the lth time interval is, under this Hamiltonian, consequently described by the unitary
That is, implementation of the lth completed rotation is equivalently denoted by the operator \(P_{l} = U_{c} (t_{l},t_{l1})\). For compactness we define the cumulative operator
to capture the cumulative action of the first l sequentially competed rotations. Hence the control propagator at any time t may be written
\({H}_{c} (t)\) is thus completely described by the sequence of n triples \(\{(\Omega_{l},\tau_{l},\phi_{l})\}_{l=1}^{n}\), and each control operation is completely parameterized by the control variables according to \(P_{l} = P_{l}(\theta_{l},\Omega_{l},\tau_{l},\phi_{l})\). Although not strictly an independent parameter it is useful to include \(\theta_{l} = \Omega _{l}\tau_{l}\) in the argument to distinguish different realizations of the same net rotation for different choices of \(\Omega_{l}\tau_{l}\). We define the \((n\times4 )\) nsegment matrix
to compactly describe any arbitrary nsegment unitary control sequence (see Figure 1). The entire space \(\mathfrak {C}_{n}\) of such control forms, referred to the nsegment control space, and written formally
thus corresponds to an infinite set of \(\boldsymbol {\Gamma }_{n}\) matrices ranging continously over all possible values taken by the control variables. This general class of control, consisting of boundedstrength unitary sequences, includes familiar compositepulse sequences in NMR and DCGs in quantum information. We use the more general control space, however, to construct novel qubit gates specifically designed to filter nonMarkovian noise.
3.3 Generalized filtertransfer functions
We now present the computational forms of the filtertransfer functions \(F_{z} (\omega)\) and \(F_{{\Omega }}(\omega)\) introduced in Eq. (4) for arbitrary nsegment control protocols implemented by Eq. (7). As outlined above, the filtertransfer functions are completely parametrized by the control variables \(\{(\Omega_{l},\tau_{l},\phi_{l})\}_{l=1}^{n}\cong \boldsymbol {\Gamma }_{n}\). Here we only provide a summary of the relevant computational quantities, leaving the major derivations and full explanation to Appendix A. We start by writing
where the row vectors \(\mathbf{R}^{(z)}(\omega), \mathbf {R}^{(\Omega)}(\omega)\in\mathbb{R}^{3}\) are obtained by Fourier transforming relevant timedomain functions associated with the control evolution dynamics. In Appendix B we derive the explicit computational forms
The row vector \(\mathbf{R}^{P_{l}}_{z}(\omega)\in\mathbb {R}^{3}\) captures the spectral response in the dephasing noise quadrature contributed during the lth unitary control segment. This takes the form (see Appendix B)
We also define the lthSegment Projection Vector
to compactly express the control variables  namely Rabi rate and the rotationaxis vector, projected onto the xy plane of the Bloch sphere  associated with evolution during the lth unitary. In fact, inspection of Eqs. (15) and (16) reveals that \(\vec {{\mathbb{T}}}^{(l)} \) is the computational analogue of \(\mathbf{R}^{P_{l}}_{z}\) for the amplitude noise quadrature. The simpler dependence of \(\vec{ {\mathbb{T}}}^{(l)} \) on the control variables, however, reflects the fact that amplitude noise in our model is always coaxial, and hence commutes with, the control.
On the other hand, the \(3\times3\) Control History Matrix \(\boldsymbol{\Lambda}^{(l1)}\), defined by
is the result of expanding the operator \(Q^{\dagger}_{l1}\hat {\sigma }_{i}Q_{l1}\equiv\sum_{j}\Lambda_{ij}^{(l1)}\hat {\sigma }_{j}\), with \(i,j \in\{ x,y,z\}\), in the Pauli basis, and identifying the coefficients \(\Lambda _{ij}^{(l1)}\) as the matrix elements. \(\boldsymbol{\Lambda}^{(l1)}\) thereby captures the accumulated effect of the previous \(l1\) completed unitaries, implemented via the cumulative operator \(Q_{l1}\).
4 Characteristics of noise filters
The power of the noise filtering formalism lies in the simple interpretation of the filtertransfer functions \(F_{i}(\omega)\), which may be characterized in a standard engineering approach, considering passbands, stopbands, and filter order [42, 48, 49, 60]. In particular, error suppression corresponds to minimizing \(F_{i}(\omega )\), \(i\in\{z,\Omega\}\) in the spectral region where the corresponding PSDs are nonnegligible. This can, in principle, be achieved by judicious construction of the control sequence since the filtertransfer functions are completely parametrized in variables describing the timedomain control applied to the qubit.
We are now in a position to examine the characteristics of the filtertransfer functions for an arbitrary control sequence \(\boldsymbol {\Gamma }_{n}\), formally indicating the functional dependence of the filtertransfer functions on the control variables by writing \(F_{i}(\omega\tau) = F_{i}(\omega\tau; \boldsymbol {\Gamma }_{n})\), \(i\in\{ z,\Omega\}\). Inversely, we may commence a study of filter design based on constructing control sequences satisfying some desired filter property  our main goal. We now advance the main mathematical framework used in this paper to study filter design, pulling together the ideas introduced in the previous sections.
4.1 The filter cost function
A definition of the cost function associated with filter performance  captured through the filter order  leads us naturally to the imposition of constraints on the available space of controls. This cost function therefore lies at the heart of our attempts to craft control protocols appropriate for a given noise environment.
From the spectral overlap in Eq. (4), minimizing the infidelity contributed by the noise process \(S_{i}(\omega)\) corresponds to minimizing the area under \(F_{i}(\omega\tau; \boldsymbol {\Gamma }_{n})\) in the spectral region of interest. We therefore define a cost function over a userdefined frequency band taking the form
to diagnose the filtering effectiveness achieved by the control sequence \(\boldsymbol {\Gamma }_{n}\). The smaller the integral \(A_{i}(\boldsymbol {\Gamma }_{n})\), the more effective the noise filtering over this band, in this noise quadrature. Since \(\boldsymbol {\Gamma }_{n}\) is defined continuously over \(\mathfrak {C}_{n}\) for a given n, we may in principle construct a variational procedure over this control space to derive minimizing ‘values’ of \(\boldsymbol {\Gamma }_{n}\) satisfying a given cost function. In effect, the problem involves solving for paths in the control space over which the functional \(A_{i}(\boldsymbol {\Gamma }_{n})\) is minimized (up to some order).
Typically one would define the band \([\omega_{L},\omega_{c}]\) over which the cost function is defined to fall within the stopband of \(F_{i}(\omega\tau)\), below which filtering generally takes place. In general the band \([\omega_{L},\omega_{c}]\) may be tailored to target specific spectral regions in the noise PSD. Doing so may produce highly effective filtering over this narrow spectral region, though outofband behaviour can be quite poor if not specifically optimized.^{Footnote 4}
4.2 The filter order
Again, following concepts from filtering in classical control engineering, we may define a filter order which will play a central role in efficiently realizing effective noise filters. We will mainly consider highpass filters for lowfrequency noise, setting \(\omega_{L} = 0\) such that filtering takes place in the stopband up to the cutoff \(\omega_{c}\). In this case it is useful to perform the Taylor expansion of the filtertransfer function about \(\omega= 0\), written
where the dependence of the expansion coefficients \(C^{(i)}_{2k}\) on \(\boldsymbol {\Gamma }_{n}\) has been made explicit, and we include only even powers of ωτ due to the evenness of \(F_{i}(\omega\tau)\). Assuming sufficiently lowfrequency noise (\(\omega_{c}<1/\tau\)), the approximation \(F(\omega\tau)\propto(\omega\tau)^{2p}\) holds for some p associated with the most significant power law expansion term. This defines a highpass filter with filter order (determined by p) visualized as the slope in the stopband on a loglog plot.^{Footnote 5}
Using this notation, and working in the lowfrequency limit, we then say the control sequence \(\boldsymbol {\Gamma }_{n}\in \mathfrak {C}_{n}\) filters \(\beta_{i}(t)\) noise to order \((p1)\) over the band \([0,\omega_{c}]\) if \(\boldsymbol {\Gamma }_{n}\) is a concurrent zero of the first \((p1)\) Taylor coefficients. That is, if \(C^{(i)}_{2}(\boldsymbol {\Gamma }_{n}) = C^{(i)}_{4}(\boldsymbol {\Gamma }_{n}) = \cdots= C^{(i)}_{2(p1)}(\boldsymbol {\Gamma }_{n}) = 0\). In this case we approximate \(F_{i}(\omega\tau; \boldsymbol {\Gamma }_{n})\approx C^{(i)}_{2p}(\boldsymbol {\Gamma }_{n})(\omega\tau)^{2p}\) and consequently \(A_{i}(\boldsymbol {\Gamma }_{n})\approx C^{(i)}_{2p}(\boldsymbol {\Gamma }_{n})\frac{(\omega_{c}\tau)^{2p+1}}{2p+1}\). Thus \(\boldsymbol {\Gamma }_{n}\) is a \((p1)\)order (highpass) filter in the ith noise quadrature if the following equivalent conditions are satisfied
This metric will play a central role in the analyses that follow.
It is important to disambiguate the asymptotic filter order \((p1)\), introduced above for characterizing the behaviour near zero frequency, from a more general metric capable of describing filter performance over an arbitrary spectral band. For this we introduce the local filter order \((p^{*}1)\) by the property that, over the band \([\omega _{L},\omega_{c}]\) the filtertransfer function is well approximated by \(F_{i}\propto(\omega\tau)^{2p^{*}}\). One may take the limit that \(\omega _{L}\rightarrow\omega_{c}\rightarrow\omega^{*}\) and thereby obtain the instantaneous filter order, effectively measuring the powerlaw behaviour at \(\omega^{*}\). Both local and instantaneous filter order reduce to the asymptotic filter order over the stopband if over this region \(F_{i}\) is wellcharacterized by its the zerofrequency behaviour.
4.3 Timedomain filter order vs. Magnus order
Both the asymptotic and instantaneous filter orders defined above for timedomain noise must be distinguished from the Magnus order of error cancellation. The latter is familiar from work in NMR in which quasistatic errors can be cancelled by suitable composite pulse sequence design. The regime of quasistatic errors coincides with the DC limit for the timedependent noise fields introduced in Section 2. That is, the timedependent noise fields reduce to scalar constants \(\beta_{z} (\beta_{{\Omega}})\). The Magnus expansion terms in (70), now denoted \(\Phi^{(\mathrm{DC})}_{\mu}\), are then evaluated strictly as time integrals over ideal control operations, scaled by factors \(\beta_{z} ^{\mu}(\beta_{{\Omega}}^{\mu})\) specifying the power law dependence on the magnitude of these static offsets errors. A pulse sequence for which \(\Phi^{(\mathrm{DC})}_{1} = \cdots= \Phi^{(\mathrm{DC})}_{\mu 1} = 0\) is then said to compensate offset errors to Magnus order \((\mu 1)\). In this case the total error operator satisfies \(\Phi^{(\mathrm{DC})}(\tau)=\mathcal{O}(\Phi^{(\mathrm{DC})}_{\mu})\) and is dominated by the residual error proportional to the μth power in the magnitude of the error.
This is quite distinct from timedependent noise where the error expansion used to calculate the fidelity contains terms of various Magnus order but equivalent timedependent error norm in the ensemble average (see, e.g. Eq. 1 in Ref. [48]). The net result is the observation that highorder error suppression in the Magnus expansion does not imply highorder timedomain noise filtering. This has been validated using experiments on trapped ions [37], and formalized rigorously in Ref. [38], where it has been shown that \(p\leq\mu\), but \(p^{*}\) over a userdefined band is unrelated to μ. Our focus throughout this work will be on crafting efficient noise filters rather than highorder error suppressing gates.
5 Filter design by Walsh synthesis
Even with the general insights into the appropriate modulation protocols outlined above, it is desirable to bound the dimensionality of the control space, and hence the complexity of the filterdesign task, by imposing physically motivated constraints on the form of \(\boldsymbol {\Gamma }_{n}\). In practice the achievable filter order is typically limited by the number of unitary operations in the control sequence; one may increase \((p1)\) at the cost of increasing n. From an experimental standpoint, faced with the physical limitation set by a maximum achievable Rabi rate, this cost manifests as a longer total sequence duration \(\tau= \hat {\sigma }_{l}^{n}\tau_{l}\). This may offset the proposed benefit of the higherorder filter due to a longer noise interaction time. From a theoretical standpoint the cost is in the greater complexity of the variational search; the number of (free) variational parameters in \(\boldsymbol {\Gamma }_{n}\) grow as 3n and the number of matrix products in Eqs. (15) and (16) grows as n.
We are able to effectively bound the synthesis space while still achieving highly effective gates by synthesizing relevant timedomain control fields in the basis set of Walsh functions  square wave analogues of the sines and cosines [51, 61]  using the concept of functional analysis. Walsh functions are defined in a uniform piecewiseconstant fashion (Figure 2), building intrinsic compatibility with discrete clocking [54] and classical digital logic. Since their formulation in the first half of the twentieth century [62] they have played an important role in scientific and engineering applications. Their development and utilization has been strongly influenced by parallel developments in digital electronics and computer science since the 1960s, with Walshtype transforms replacing Fourier transforms in a range of engineering applications such as communication, signal processing, pattern recognition, noise filtering and so forth [61, 63].
More recently the Walsh functions have been identified as an attractive resource in quantum information, with applications in timeresolved magnetometry using nitrogenvacancy centres in diamond [64] and in DD for digitalefficient pulse sequencing [51]. Notably, in the latter scheme the decoupling performance was found to be determined by the distinct symmetry and spectral properties of the Walsh basis. These properties enable us to establish analytic design rules (see Section 5.3) to further streamline Walshsynthesized filter construction.
We begin by reviewing the relevant mathematical details of the Walsh basis. Two equivalent representations are introduced, Paley ordering and the Hadamard representation, which shall be used throughout this paper.
5.1 The Paley and Hadamard representations
The set of Walsh functions \(w_{k}:[0,1]\rightarrow\{\pm1\}\), \(k\in\mathbb{N}\) form an orthonormalcomplete family of binaryvalued square waves defined on the unit interval. They are aperiodic and hence do not admit to a unique ordering, in contrast with the Fourier basis in which sinusoids are ordered by increasing frequency. A number of different orderings exist [61, 65, 66] due to the different ways in which the basis elements may be defined. We employ the Paley ordering [67] in which basis functions are generated from products of Rademacher functions [68], defined by
The jth Rademacher function \(R_{j}(x)\) is thus a periodic square wave switching \(2^{j1}\) times between ±1 over the interval \([0,1]\). The Walsh function of Paley order k, here denoted \(\operatorname {PAL}_{k}(x)\), is then defined by
where \((b_{m},b_{m1},\ldots,b_{1})_{2}\) is the binary representation of k. That is, \(k = b_{m}2^{m1}+b_{m1}2^{m2}+\cdots+b_{1}2^{0}\), where \(m(k)\) indexes the most significant binary digit, having defined \(b_{m}\equiv 1\). Consequently, \(\operatorname {PAL}_{k}(x)\) has factors \(R_{j}(x)\) whenever \(b_{j}\) is a nonzero binary digit of k; the total number of Rademacher functions in the construction of \(\operatorname {PAL}_{k}(x)\) is thus given by the number of nonzero \(b_{j}\)’s in k  namely, the Hamming weight denoted \(r(k)\). For a given value of \(m(k)\), the maximum number Rademacher functions therefore occur for \(\operatorname {PAL}_{2^{m(k)}1}(x)\). For example, setting \(m(k) = 3\), a maximum of three Rademacher functions are used to construct \(\operatorname {PAL}_{7}(x) = R_{3}(x)R_{2}(x)R_{1}(x)\), corresponding to the three nonzero digits \(b_{1,2,3}\) in the binary expansion \(k = 7 = (1,1,1)_{2}\). For illustration, the first 32 Walsh functions in the Paley ordering are shown in Figure 2.
The discretetimestep properties of these basis functions produce, under linear superposition, piecewiseconstant waveforms with digitized segment lengths. In our framework these segments are used to specify the a modulation of the control field, ultimately defining a piecewiseconstant sequence of unitaries. We therefore require a straightforward expression for the envelope of an arbitrary synthesis \(\sum_{k = 0}^{N} X_{k}\operatorname {PAL}_{k}(x)\). Due to the aperiodicity of the Walsh functions, however, a general expression in Paley ordering is difficult. To overcome this it is convenient to use the Hadamard representation.
The unique signswitching envelope of \(\operatorname {PAL}_{k}(x)\) is determined by the signswitching of the constituent Rademacher functions. Since any \(R_{j}(x)\) switches sign uniformly \(2^{j}\) times over the interval \([0,1]\), the fastest signmodulation rate in \(\operatorname {PAL}_{k}(x)\) derives from the highest order Rademacher function \(R_{m(k)}(x)\), which switches sign \(2^{m(k)}\) times over \([0,1]\). Provided \(m(k)\le n\), we may therefore partition \([0,1]\) into \(2^{n}\) equal time bins such that \(\operatorname {PAL}_{k}(x)\) is constant valued on each bin. Any basis function \(\operatorname {PAL}_{k}(x)\) then projects completely onto a digital vector in \(\mathbb{R}^{2^{n}}\) with the jth element, \(P^{(k)}_{j}\in\{\pm1\}\), defined by the value of \(\operatorname {PAL}_{k}(x)\) in the jth bin. That is, \(\operatorname {PAL}_{k}(x)\) is isomorphic to the discrete digital vector written
This projection is possible for all \(k\in\{0,1,\ldots,2^{n}1\}\) for which the condition \(m(k)\le n\) is true, resulting in a set of \(2^{n}\) vectors. Since these vectors inherit the orthogonality of the \(\operatorname {PAL}_{k}(x)\), moreover, they form a discrete Walsh basis spanning \(\mathbb{R}^{2^{n}}\).
In the Hadamard representation, these vectors occur as columns (rows) of the Hadamard matrix of dimension \(2^{n}\). Using socalled Sylvester construction [69] the \(2^{n}\)dimensional Hadamard matrix \(H_{2^{n}}\) is generated recursively by
where S is the Sylvester matrix, and ⊗n denotes \(n\ge1\) applications of the Kronecker product. In this construction \(\mathbf{P}^{(k)}_{2^{n}}\) defines the \(i(k)= 1+\sum_{j=1}^{m(k)}b_{j}2^{nj}\) column (row) of \(H_{2^{n}}\). The orthogonality of the Walsh basis is thereby reflected in the familiar property that \(H_{2^{n}}H_{2^{n}}^{T} = 2^{n}I\), implying the orthogonality of the Hadamard matrices.
The Hadamard representation of the Walsh functions has the distinct advantage of naturally specifying the piecewiseconstant structure of time domain sequences constructed via linear combinations of Walsh functions. Any function synthesized in the Paleyordered Walsh basis, \(f(x) = \sum_{k = 0}^{2^{n}1} q_{k}\operatorname {PAL}_{k}(x)\), has a vector representation in the column space of \(H^{2^{n}}\). In this section we will use this observation to efficiently construct Walshsynthesized filters, whose properties map compactly onto the Walsh spectrum.
5.2 Walshsynthesized filters
The basic physics of commutation relations between Pauli operators immediately suggests an immediate constraint on the available modulation, broadly involving structuring of the Rabi rate or control phase in the time domain
referred to as singleaxis amplitudemodulated filters (AMFs) and constantamplitude phasemodulated filters (PMFs). These constrained forms may be used to design filters for dephasing and amplitude noise separately using minimal control resources. For \(\hat {\sigma }_{z}\) (dephasing) noise it is sufficient to employ rotations about a single (orthogonal) axis in the xy plane and therefore restrict attention to AMFs. On the other hand, unless implementing the trivial identity gate such that the total gate rotation angle \(\Theta\equiv \sum_{l = 1}^{\mathcal {M}}\theta_{l}=0\), strict amplitude modulation is insufficient for filtering amplitude noise.^{Footnote 6} For nontrivial gates, amplitude noise filters generally require control over the rotation axis, and for this purpose we employ PMFs.
In the Walsh synthesis framework, the modulated structures \(\boldsymbol {\Gamma }^{\mathrm{AMF}}_{n}\) and \(\boldsymbol {\Gamma }^{\mathrm{PMF}}_{n}\) are further constrained by synthesizing the timedomain Rabi rate \(\Omega(t)\) or phase \(\phi(t)\) as linear superpositions of Walsh functions
Here the synthesis spectra are denoted in terms of \(X_{k}\) (\(Y_{k}\)) to distinguish Walsh modulation in the amplitude (phase) quadratures. We refer to the resulting sequences as Walsh amplitude (WAMF) and phase (WPMF) modulated filters. To compactly express these modulated control forms as sequences of unitaries we now employ the Hadamard representation.
Consider an arbitrary function \(f(x) = \sum_{k = 0}^{N} q_{k}\operatorname {PAL}_{k}(x)\) synthesized in the Walsh basis up to Paley order N. From Section 5.1 all basis functions in this synthesis projected onto a Hadamard matrix of (minimum) dimension \(\mathcal {M}(N)\equiv2^{m(N)}\). A discrete representation of the function \(f(x)\) therefore exists as a projection onto the column space of \(H_{\mathcal {M}}\) by writing
where the column vector \(\tilde{\mathbf{q}}\) consists of the reordered Paley spectral amplitudes \(q_{k}\) according to the change of basis map specified by \(i(k)= 1+\sum_{j=1}^{m(k)}b_{j}2^{nj}\). Thus, in the Hadamard representation, the piecewiseconstant structure of \(f(x)\) is extracted from the vector \(\mathbf{f}= (f_{1}, f_{2},\ldots ,f_{\mathcal {M}} )^{T}\), with \(\tilde{\mathbf{q}}\) representing the synthesis spectrum. In this case Eq. (29) implies the forms
with \(\mathcal {M}\equiv2^{m(N)}\) and \(\tau_{\mathcal {M}}\equiv\tau/\mathcal {M}\). The Rabi rate or phasemodulation is thus defined by the vectors \(\vec {\boldsymbol {\Omega }}= (\Omega_{1},\Omega_{2},\ldots,\Omega _{\mathcal {M}})^{T}\) and \(\vec{\boldsymbol{\phi}} = (\phi _{1},\phi_{2},\ldots,\phi_{\mathcal {M}})^{T}\) whose components
specify the control variables during lth timestep. In this case \(\tau_{l}\) takes a fixed discrete value, though consecutive segments with the same values of \(\Omega_{l}\) and \(\phi_{l}\) may be combined sequentially to form effective operations of longer duration. The remaining degrees of freedom reside in the functional dependencies of \(\Omega_{l}(\mathbf{X})\) and \(\phi_{l}(\mathbf{Y})\) on the Walsh spectra,^{Footnote 7} the explicit forms of which are determined by the Hadamard matrix equations above.
The reduced control space, now compactly parameterized by the Walsh spectra, thus consists of boundedstrength unitary sequences inheriting the discrete timing properties of the Walsh basis. This contrasts with similar composite pulse methods in NMR and quantum information [20, 27, 70] which generally rely on structures defined in continuous time.^{Footnote 8} In the next section we identify useful properties of the Walsh basis which capture filter performance and hence inform effective filter design.
5.3 Analytic filterdesign rules
From Eqs. (31) and (32) the WAMF (WPMF) constructs are completely parameterized by the Walsh spectra \(\mathbf{X}^{(i)}\), \(i\in\{z,\Omega\}\). Here, for compactness, we denote \(\mathbf{X}^{(z)}(\mathbf{X}^{(\Omega)}) = \mathbf{X}( \mathbf{Y})\). Filter properties and gate characteristics consequently map onto the basis functions in the synthesis.
To target these properties it is convenient to partition the Walsh spectrum \(\mathbf{X}^{(i)}\equiv(\mathbf{X}^{(i)}_{\nu},\mathbf{X}^{(i)}_{\rho})\) into spectralamplitude classes to be treated as variational (\(\mathbf{X}^{(i)}_{\nu}\)) and fixed parameters (\(\mathbf{X}^{(i)}_{\rho}\)). Making the formal substitution \(\boldsymbol {\Gamma }_{\mathcal {M}}\rightarrow\mathbf{X}^{(i)}\), the cost function in Section 4 is consequently reexpressed
where it is understood that \(A_{i}\) is minimized over the space spanned by \(\mathbf{X}^{(i)}_{\nu}\) with \(\mathbf{X}^{(i)}_{\rho}\) held constant. Similarly, highpass \((p1)\)order filters satisfy the conditions
We are now in a position to establish a range of analytic filterdesign rules to refine our search space and streamline Walsh synthesis leveraging approaches similar to electrical or digital signal filter construction. In particular, the well defined spectral properties and symmetries of the Walsh functions may be used to inform effective filter construction with improved performance. These include:

(1)
Alternate modulation quadratures for dephasing or amplitude noise.

(2)
Restricting Walsh synthesis by symmetry considerations.

(3)
Constraining Walsh spectra for target gate angle.

(4)
Achievable filtering characteristics determined by \(m(k)\) and \(r(k)\).
We address each of these in turn.
(i) Alternate modulation quadratures for dephasing or amplitude noise  As the most basic element of design, we first reiterate the statements made above establishing WAMFs (WPMFs) as useful for filtering dephasing (amplitude) noise separately. In Section 9, however, we derive universal noise filters by concatenating these two filter constructs.
(ii) Restricting Walsh synthesis by symmetry considerations  As with the cosines (sines) constituting the Fourier basis, the Walsh basis separates into socalled CAL (SAL) functions with even (odd) parity. Restricting the synthesis to the CAL subset ensures the modulated waveform has timereversal symmetry about the sequence midpoint \(\tau/2\). This can be a convenient and effective method in filter design, in line with the observation in dynamic decoupling literature [13, 71] that sequence performance is often improved using timesymmetric over asymmetric building blocks.^{Footnote 9}
(iii) Constraining Walsh spectra for target gate angle  Imposing desired physical properties on a candidate control sequence may generally be achieved by holding some subset \(\mathbf{X}^{(i)}_{\rho}\) of the Walshspectral amplitudes constant. For example, we may fix the total rotation angle of the Bloch vector in order to implement a target logic operation. For WAMFs this involves a very straightforward constraint on the Walsh spectrum: the total rotation angle depends only on \(X_{0}\). This can be seen as follows. First observe for Paley orders \(k\ge1\) the Walsh functions are balanced in the sense that \(\int_{0}^{1}\operatorname {PAL}_{k}(x)\,dx = \delta_{0k}\), where \(\delta _{ij}\) denotes the Kronecker delta. For WAMFs the total gate angle \(\Theta\equiv\int_{0}^{\tau}dt \Omega(t)\) therefore takes the form
The effective gate rotation, \(\theta= \Theta\bmod 2\pi\), is consequently given by
implying the necessary constraint on \(X_{0}\) for a desired θ.
(iv) Achievable filtering characteristics determined by \(m(k)\) and \(r(k)\)  The achievable filter order over the entire stopband is essentially limited by the number of constituent control operations: one may achieve higher p at the cost of higher n. For the Walshsynthesized filters in Eqs. (31) and (32), with N the highestorder basis function, \(n \equiv2^{m(N)}\). Hence higherorder Walsh functions generally produce higherorder filters.
For highpass filters further insight is gained by examining the lowfrequency spectral properties of the \(\operatorname {PAL}_{k}(t/\tau)\). This reflects the fact that the filtertransfer functions are closely related to Fourier transforms of relevant timedomain control functions. In particular, the Fourier transform of \(\operatorname {PAL}_{k}(t/\tau)\), near zero frequency, has a powerlaw expansion [51]
where \(r(k)\) is the Hamming weight. Here \(x \equiv t/\tau\) is a nondimensional timedomain variable and \(\mathscr {F}_{x} [\operatorname {PAL}_{k}(x) ]\) denotes the forward Fourier transform of \(\operatorname {PAL}_{k}(x)\) from x to the (nondimensional) angular frequency variable ωτ in Fourier space. Increasing the lowfrequency rolloff is therefore associated with maximizing \(r(k)\) for a given number of control operations \(n = 2^{m(k)}\). This corresponds to maximizing the number of Rademacher functions in the construction^{Footnote 10} and immediately identifies Paley orders \(k = 2^{\alpha}1\), \(\alpha\in\mathbb{N}\), (see Figure 2) as key design resources.
6 Walsh Amplitude Modulated Filters (WAMFs)
Having introduced the basic physical picture and mathematical basis for Walsh filter synthesis, we move on to demonstrate explicit realizations of WAMFs for dephasing noise. Both first and secondorder filters with highpass filter characteristics are constructed.
6.1 Firstorder WAMFs
We begin by considering firstorder filters for dephasing noise implementing target singlequbit rotations. Construction begins by considering the design rules (i)(iv) outlined in Section 5.3. For filtering noise in this quadrature (i) implies we should employ the WAMF construction (Eq. (31)). In this case, invoking (iii), the requirement of implementing nontrivial gates dictates we include Paley order \(k = 0\) in the synthesis. The average Rabi rate (and hence rotation angle) is then determined by \(X_{0}\), the spectral amplitude of \(\operatorname {PAL}_{0}(t/\tau)\). The remaining synthesis choices include basis functions of Paley order \(k>0\) and are in principle unbounded.
As a first application, we pursue the construction minimizing the number \(n = 2^{m(N)}\) of unitary operations in the synthesized sequence such that error suppression is still attainable. In line with design rules (ii) and (iv), timereversal symmetry is ensured and the number of Rademacher functions is maximized by reducing the remaining synthesis choices to the single basis function \(\operatorname {PAL}_{3}(t/\tau)\) (Figure 2). Hence, in this simple example, \(N = 3\), and \(\mathcal {M}(N) = 2^{m(N)} = 2^{2}\), yielding 4segment gates with segment lengths \(\tau_{\mathcal {M}}= \tau/4\). These represent the lowestorder constructions with error suppression capabilites.
The Rabi rate is consequently written \(\Omega(t) = X_{0}\operatorname {PAL}_{0}(t/\tau)+X_{3}\operatorname {PAL}_{3}(t/\tau)\). Physically, \(X_{3}\) specifies the modulation depth of the resulting Rabi rate envelope (see inset to Figure 3(c)) while \(X_{0}\) determines the average value as described above. Accordingly, for a particular target rotation, we treat \(X_{0}\) as a fixed parameter (see Eq. (36)) while \(X_{3}\) is treated as a variational parameter by which to optimize the (dephasing) cost function (Eq. (34)). Thus, values of \(X_{3}\) for which \(A_{z}(X_{3};X_{0})\) is minimized specify the optimum modulation depths for an effective filter.
Using Eq. (30) the Walsh synthesis spectrum is represented \(\tilde{\mathbf{X}}\equiv (\tilde {X}_{1},\tilde {X}_{2},\tilde {X}_{3},\tilde {X}_{4} )^{T} = (X_{0},0,0,X_{3} )^{T}\), yielding the Hadamard representation of the modulated Rabi rate
The resulting WAMF construction, denoted \(\mathrm{WAMF}_{0,3}^{(1)}\), is thus represented
where \(X_{\pm} := X_{0}\pm X_{3}\), and the superscript in this notation denotes firstorder filter capabilities. Hence these gates inhabit the twodimensional control space spanned by the \(X_{0}X_{3}\) plane (see Figure 3(a)). The dephasing filtertransfer function \(F_{z} (\omega; X_{3};X_{0})\) for an arbitrary \(\mathrm{WAMF}_{0,3}^{(1)}\) gate is derived by substituting Eq. (39) into Eq. (13). The cost function \(A_{z}(X_{3};X_{0})\) may then be numerically integrated.
Figure 3(a) shows a twodimensional representation of \(A_{z}(X_{3};X_{0})\) integrated over the stopband \(\omega\in [10^{9}, 10^{1}]\tau^{1}\). The value of \(\operatorname{Log}_{10} [A_{z}(X_{3};X_{0}) ]\) is indicated by the color scale. Total sequence length is normalized to \(\tau=1\) in this data, so the total gate rotation angle \(\Theta\equiv X_{0}\) is given directly by the \(X_{0}\)axis. As can be seen, for any fixed \(X_{0}\) there exist quasiperiodic tunings of \(X_{3}\) which minimize the cost function. In other words, we have a prescription for synthesizing spectrallyoptimized dephasing filters which implement arbitrary rotation angles. Interestingly, the point \((X_{0},X_{3})\equiv( 3\pi,\pi)\) reproduces the previously derived firstorder DCG NOT construction [19].
Blue regions, where the cost function has been minimized, represent firstorder filters for lowfrequency noise due to the restrictions placed on the synthesis space.^{Footnote 11} To demonstrate that these optimized \(\mathrm{WAMF}^{(1)}_{0,3}\) gates perform as firstorder filters we Taylor expand \(F_{z} (\omega; X_{3};X_{0})\) as in Eq. (35), and derive an easy analytic expression for the first order coefficient
In principle we may now solve \(C^{(z)}_{2}(X_{0};X_{3})=0\) to find values of \(X_{3}\) giving firstorder filters for a given \(X_{0}\). In Figure 3(b) we plot \(C^{(z)}_{2}(X_{0};X_{3})\) (solid lines) as a function of \(X_{3}\) for the choices \(X_{0} = (2\frac{1}{4}, 2\frac {1}{2}, 3 )\pi\) as above. Zeros of \(C^{(z)}_{2}(X_{0},X_{3})\), appearing as dips on the log scale, occur quasiperiodically in \(X_{3}\) and match with points in Figure 3(a) where corresponding lines of constant \(X_{0}\) intersect with the blue contours. To demonstrate this we plot onedimensional slices of \(A_{z}(X_{3};X_{0})\) for fixed values \(X_{0} = (2\frac{1}{4}, 2\frac{1}{2} , 3 )\pi\) (dotted lines). We find the minima in \(A_{z}(X_{3};X_{0})\) align with zeros of \(C^{(z)}_{2}(X_{0};X_{3})\), implying the blue contours in the \(X_{0}X_{3}\) plane do indeed produce firstorder filters, with \((p1) = 1\). The boxed zeros near \(X_{3} = (0.36\ldots, 0.65\ldots, 1 )\pi\) correspond to the termination points of the colored lines in Figure 3(a) (also boxed). These indicate representative points in the \(X_{0}X_{3}\) plane producing firstorder filters with nontrivial rotations. In particular, these filters implement \(\theta= (\frac{\pi}{4}, \frac{\pi}{2}, \pi )\) rotations.
The corresponding dephasing filtertransfer functions for these three optimized gates are shown in Figure 3(c). As expected from Eq. (21), with \(C_{2}^{(z)} = 0\), these approximately satisfy \(F_{z} \propto(\omega\tau)^{4}\) in the stopband, producing firstorder filters with \((p1) = 1\). For comparison we include the dephasing filtertransfer function for a primitive π rotation where \(F_{z} \propto(\omega\tau)^{2}\), implying \((p1)=0\). The steeper slopes, or rolloffs, for the optimized \(\mathrm{WAMF}_{0,3}^{(1)}\) gates captures this difference. This filter design method, and the performance of the \(\mathrm{WAMF}^{(1)}_{0,3}\) filters, has recently been experimentally validated by our group [37].
6.2 Secondorder WAMFs
We now consider higherorder dephasing filters by increasing the number n of segments in the sequence. In particular we consider 8segment gates. Construction again begins by considering the design rules (i)(iv) outlined in Section 5.3.
Using (i) and (iii) we employ the WAMF construction and include Paley order \(k=0\) to ensure nontrivial rotation angles. Extending to 8segments, however, increases the accessible range of Walsh functions in the synthesis as identified in design rule (iv). Specifically we extend the synthesis to Paley orders \(k\le7\) corresponding to the complexity class \(m(k)\le3\), implying a \(2^{3} = 8\) segments construction in the Hadamard representation. We denote these constructions by \(\mathrm{WAMF}_{0:7}^{(2)}\) where the superscript indicates secondorder filtering capabilities, as will be shown. Imposing timereversal symmetry about \(\tau/2\) further restricts the synthesis space to \(k\in\{3,5,6\}\), corresponding to CAL functions referenced in design rule (ii). We therefore study synthesized filters with spectral amplitudes partitioned into fixed \(\mathbf{X}_{\rho}= X_{0}\) and variational \(\mathbf{X}_{\nu}= (X_{3}, X_{5}, X_{6})\) classes.
As a representative example we set \(X_{0} = 3\pi\) and restrict attention to filters implementing a net π rotation (\(\tau\equiv 1\)). Our cost function consequently takes the form \(A_{z}(X_{3},X_{5},X_{6};3\pi)=\int_{\omega_{L}}^{\omega_{c}} F_{z} (\omega\tau; X_{3},X_{5},X_{6};3\pi)\,d\omega\), implying a threedimensional variational control space over which to derive spectrallyoptimized filters. We accomplish this using a NelderMead search to minimize \(A_{z}(\mathbf{X}_{\nu};3\pi )\) over the \(\mathbf{X}_{\nu}\)domain.
Representative examples of spectrallyoptimized \(\mathrm{WAMF}_{0:7}^{(2)}\) constructions are shown in Figure 4. The 8segment timedomain amplitudemodulated profiles are represented in Figure 4(a), with corresponding Walsh spectra shown in Figure 4(b). The blue, red and green spectra were obtained using a NelderMead optimization of the cost function \(A_{z}(X_{3},X_{5},X_{6})\) defined over \([\omega_{L},\omega_{c}]\) with \(\omega_{c} = \tau^{1}\) and \(\omega_{L} = (10^{4},10^{3},10^{2})\tau^{1}\) respectively. The corresponding dephasing filtertransfer functions \(F_{z} (\omega)\) are plotted as solid blue, red and green traces in Figure 4(d). Within the respective cost function bands these satisfy \(F_{z} \propto(\omega\tau)^{2p^{*}}\), with the instantaneous filter order ranging between \(2<(p^{*}1)<3.8\) at various points.^{Footnote 12} For comparison we also plot the dephasing filtertransfer function for a primitive π rotation (black dashed trace) and an optimized \(\mathrm{WAMF}_{0,3}^{(1)}\) gate (yellow dashed trace). These respectively satisfy \(F_{z} \propto(\omega\tau)^{2,4}\) over the whole stopband and are well characterized by the (asymptotic) filter orders \((p1)=0,1\).
Figure 4(a) shows a twodimensional representation of \(A_{z}(X_{5},X_{6})\) defined on a twodimensional crosssection of the \(\mathbf{X}_{\nu}\)domain, holding \(X_{3}\) fixed, and integrated over the stopband \(\omega\in [10^{9}, 10^{1}]\tau^{1}\). The value of \(\operatorname{Log}_{10} [A_{z}(X_{5},X_{6}) ]\) is indicated by the color scale. Areas in blue indicate minima in \(A_{z}(X_{5},X_{6})\), indicating optimized paths in \(X_{5}X_{6}\) plane the over which effective filters may be found. Notably, it is possible to find ‘crossregions’ (circled) in which the spectral amplitudes \(X_{5}\) and \(X_{6}\) may independently be varied substantially without the cost function moving off a local minima. This potentially indicates the existence of classes of WAMFs which may be robust to errors in the Walsh spectrum itself.
7 Walsh Phase Modulated Filters (WPMFs)
We now turn to filters for amplitudedamping noise constructed via phase modulation using the WPMF construction set out in Eq. (32). Following the same procedure described above for WAMFs, one can implement a NelderMead search to derive spectrallyoptimized WPMFs which implement nontrivial rotations. For these constructions, however, the target rotation angle is dependent on both the Rabi rate and the sequence of phase modulations. Consequently it is less straightforward to impose a constraint during the optimization procedure to ensure a particular target rotation. Although we do not pursue the general problem in detail in this paper, we demonstrate the approach in this and the following sections, deriving a family of WPMFs in which the synthesis space is limited to a variety of simple combinations of Walsh function.
In the remainder of this section we study a variation on the strict WPMF structure which resolves the difficulty of imposing a target rotation and enables us to make some useful connections with existing composite pulse sequences in NMR. This variation involves partitioning the control modulation into a target rotation \(P(\theta,0)\) followed by a sequence of phasemodulated identity operations \(\prod_{l = 1}^{\mathcal {M}} P(2\pi,\phi_{l})\) with the \(\phi_{l}\) chosen such that amplitude noise is filtered to some order. Here the operator \(P(\theta ,\phi)\) denotes the rotation through angle θ about \(\hat {\sigma }_{\phi}\). By insisting these \(\mathcal {M}\) ‘correction’ segments are all identity operations, the phase modulations do not produce complicated rotation paths and the net rotation is determined simply by the initial target pulse.
We assume a constant Rabi rate \(\Omega_{0}\) so that each correction segment has equal duration \(\tau_{2\pi} = 2\pi/\Omega_{0}\). Provided \(\mathcal {M}\) is a power of 2, the phase modulation describing the correction sequence may therefore be constructed as a Walshsynthesized waveform consisting of Paley orders \(k\le \mathcal {M}1\). The simplest such ‘synthesis’ derives from a single Walsh function \(\operatorname {PAL}_{k}(x)\) with spectral weight \(Y_{k}\), yielding the sequence
where, as in Eq. (25), the column vector \(\mathbf{P}^{(k)}_{\mathcal {M}}\) specifies the sequence of values taken by \(\operatorname {PAL}_{k}(\frac{t\tau_{\theta}}{\tau\tau_{\theta}})\) over the interval \([\tau_{\theta},\tau]\) partitioned into the minimum \(\mathcal {M}(k)\) equal time bins. We include the superscript (c) and write the vectorized phase \(\vec{\boldsymbol{\phi}}_{c}\) to indicate Walsh modulation during the ‘correction stage’ of the sequence, disambiguating this from the strict WPMF structure. For a given θ we may now treat \(Y_{k}\) as a tuning parameter which may be optimized by minimizing the cost function \(A_{\Omega}(Y_{k};\theta)\equiv \int_{0}^{\omega_{c}}d\omega F_{{\Omega }}(\omega\tau;Y_{k};\theta)\). The optimized \(Y_{k}\) are thereby defined as an implicit function of θ.
In fact we may analytically show this construction yields firstorder filters for amplitude noise by Taylor expanding \(F_{{\Omega }}(\omega)\) and solving the firstorder filter condition \(C_{2}^{(\Omega)}(Y_{k};\theta) = 0\). We compute \(C_{2}^{(\Omega)}{(Y_{k};\Omega)} = [\theta+2\pi \mathcal {M}(k)\cos(Y_{k}) ]^{2}/4\), implying the optimized Walsh spectral amplitude
On the other hand, computing the secondorder Taylor coefficient and substituting in the firstorderoptimized spectral value in Eq. (42), one finds \(C_{4}^{(\Omega )}\ne0\). Hence the \(\mathrm{WPMF}^{(c)}_{k}\) sequence has \((p1) = 1\) filtering properties.
We make the interesting observation that Eqs. (41) and (42) produce the firstorder SolovayKitaev SK1(θ) sequence [72, 73] and the secondorder Wimperis passband P2(θ) sequence [27] by setting \(k = 1,3\) respectively. Hence these wellknown NMR sequences, originally designed to compensate for static amplitude errors to first and second Magnus order respectively (see Section 4.3), appear in the Walsh filter space as phasemodulated filters for nonMarkovian amplitude noise. Table 1 summarizes this.
Another remarkable result is found using the synthesis \(\vec {\boldsymbol{\phi}}_{c} = H_{\mathcal {M}}\tilde{\mathbf{Y}}\) over the two Walsh functions PAL_{0} and PAL_{3}, setting \(\tilde{\mathbf{Y}} \equiv (Y_{0},0,0,Y_{3} )^{T}\) in analogy with the Walsh spectrum defining amplitude modulation in the \(\mathrm{WAMF}_{0,3}^{(1)}\) construction. The firstorder filtering condition \(C_{2}^{(\Omega )}(Y_{0},Y_{3},\Omega_{0};\theta) = 0\) then implies solutions
yielding the Wimperis broadband BB1 sequence [74]
Here \(Y_{\pm} := Y_{0}\pm Y_{3}\) and in the last equality we have collapsed the array to show the BB1 construction explicitly. Computing the secondorder Taylor coefficient and in substituting the firstorderoptimized spectral values, however, we find \(C_{4}^{(\Omega)}\ne0\). Thus, although BB1 was originally derived to compensate static amplitude errors to second Magnus order, it only provides firstorder noise filtering.
8 Walsh Rotary Spin Echo (WRSE)
In this section we treat a subclass of Walsh modulated filters which may be described either in terms of phase or amplitudemodulation. The phasemodulation consists of applying a sequence of πphase shifts, relative to some offset \(\phi_{0}\), on the driving field with a constant amplitude \(\Omega _{0}\). This construction generalizes the rotary spin echo (RSE) sequence from NMR, analogous to the Hahnecho sequence for driven systems, consisting of a single πphase shift applied at the sequence midpoint \(\tau/2\). In quantum information RSE has been employed, for example, in relaxation noise spectroscopy [75] and in mitigating lowfrequency offresonant noise [76] in driven superconducting flux qubits. In contrast with previous approaches, our generalization permits higherorder filter performance in both amplitude and dephasing quadratures and may prove of significant use.
In our construction the temporal profile of the phase is expressed \(\phi(t) = \phi_{0}+\frac{\pi}{2}(1y(t))\), where \(y(t)\in\{\pm1\}\) is a binaryvalued switching function defined to change sign at the application of each πshift. Specifically, we consider sequences based on Walsh functions by defining the switching function
Consequently the phase has Walsh synthesis \(\phi(t) = Y_{0}\operatorname {PAL}_{0}(t/\tau)+Y_{k}\operatorname {PAL}_{k}(t/\tau)\) where \(Y_{0} = \phi _{0}+\frac{\pi}{2}\) and \(Y_{k} = \frac{\pi}{2}\). These gates only perform the identity operation with \(\Theta\equiv0\) owing to the property that \(\hat {\sigma }_{\phi_{0}+\pi} = \hat {\sigma }_{\phi_{0}}\) (see Eq. (6)). This implies the direction of unitary rotation is reversed by the application of each π shift, and since any Walsh function of Paley order \(k>0\) is equally distributed between values ±1 over the domain these rotations perfectly cancel, yielding zero total rotation. This is formally equivalent to modulating the sign of the Rabi rate and holding the phase \(\phi_{0}\) constant (see Appendix C), as schematically illustrated in Figure 5(a). These sequences, referred to as Walsh rotary spin echo order k (\(\mathrm{WRSE}_{k}\)), thus take the form
where, referring to Eqs. (32) and (30), \(\mathcal {M}(k)\equiv2^{m(k)}\) and the Walsh spectrum \(\tilde{\mathbf{Y}}\) has only two nonzero elements: \(\tilde {Y}_{1} = \phi _{0}+\frac{\pi}{2}\) and \(\tilde {Y}_{i(k)} = \frac{\pi}{2}\). This naming convention reflects the fact that the WRSE family generalize the traditional RSE sequence: in particular, \(\mathrm{WRSE}_{1}\equiv\mbox{ RSE}\). We now proceed to derive the filtering properties of the WRSE family, starting with the amplitude quadrature then moving to the dephasing quadrature.
8.1 WRSE as amplitude filters
The amplitude filtertransfer function, in the stopband, is determined by the Hamming weight of the chosen Walsh function by
Comparing this with the lowfrequency approximation \(F_{{\Omega }}(\omega\tau ;k) \propto(\omega\tau)^{2p}\) from Eq. (22), we conclude the timedomain filter order is given by \((p1) = r(k)\). That is, highpass filter performance is completely determined by the Hamming weight. Figure 5(c) demonstrates this by plotting \(F_{{\Omega }}(\omega)\) for the \(\mathrm{WRSE}_{k}\) sequences with \(k\in\{1,3,7,15,31\}\), corresponding to the Hamming weights \(r(k)\in\{1,2,3,4,5\}\). The corresponding filter order increase is clear from the steepening rolloff.
This result follows from deriving \(F_{{\Omega }}(\omega)\) for Eq. (46) which, owing to the fact that the noise Hamiltonian in this quadrature always commutes with control operations, takes the relatively simple analytical form (see Appendix C)
Our key insight now is to observe the sum inside the modulus square above satisfies \(\sum_{l=1}^{\mathcal {M}}P^{(k)}_{l} [e^{i\omega t_{l}}e^{i\omega t_{l1}} ] = i\omega\tau \mathscr {F}_{x} [\operatorname {PAL}_{k}(x) ]\), where \(x\equiv t/\tau\) is a nondimensional timedomain variable. We now invoking Eq. (37) in design rule (iii), namely \(\mathscr {F}_{x} [\operatorname {PAL}_{k}(x) ]\propto(\omega \tau)^{r(k)}\), to map the lowfrequency spectral properties onto the Hamming weight \(r(k)\) of the chosen Walsh function. Substituting this into Eq. (48) then yields Eq. (47).
8.2 WRSE as dephasing filters
The dephasing filter performance for \(\mathrm{WRSE}_{k}\) is more complicated to study as noise terms in this quadrature do not commute with our control, obfuscating a compact expression for \(F_{z} (\omega)\). It is convenient instead to study the zeros of the Taylor coefficients \(C^{(z)}_{2j}\) as in Eq. (22). Since the Rabi rate is the only free variable in the \(\mathrm{WRSE}_{k}\), for a given k, it follows the Taylor coefficients are functions only of \(\Omega _{0}\). Filtering to order \((p1)\) then corresponds to the condition
where η denotes some value of \(\Omega_{0}\) for which the above coefficients are concurrently zero. Here we have included the Paley order as a parameter of the coefficients. Analysis shows, however, concurrent zeros exist only for \(j\in\{1,2\}\). We effectively obtain the following ‘nogo theorem’: \(\mathrm{WRSE}_{k}\) sequences perform as (highpass) dephasing noise filters up to (but not beyond) second order. This result may be of use to characterize the relevant quadrature of an unknown noise source, by probing with higherorder \(\mathrm{WRSE}_{k}\) sequences and determining the resulting filtering properties.
The general insight supporting this statement is developed in Appendix C, by explicitly studying the representative case for \(\mathrm{WRSE}_{3}\). The Taylor coefficients \(C^{(z)}_{2,4,6}\) for this representative case are plotted in Figure 6(a) as functions of \(\Omega_{0}\). Zeros of \(C^{(z)}_{2}\) occur at multiples of 4π, and concurrent zeros of \(C^{(z)}_{2,4}\) occur at multiples of 8π. However, since \(C^{(z)}_{6}\) is never zero at multiples of 8π (see inset to Figure 6(a)), it follows we can never achieve higher than secondorder filtering. We verify this by examining the slope of \(F_{z} (\omega;\Omega_{0})\) for the values \(\Omega_{0} = 2\pi q\), \(q\in\{1,\ldots,8\}\) (see Figure 6(b)). Similar considerations for other values of k generalize the result.
9 Universal Walsh Modulated Filters (UWMFs)
In the previous sections we have considered WAMF and WPMF gates which implement target qubit rotations while filtering, to some order, either dephasing or amplitude noise respectively. In this section we derive filters for universal noise by concatenating both filter types into a composite structure that filters both noise quadratures simultaneously, while still implementing a target qubit rotation. We refer to such constructions as universal Walsh modulated filters (UWMFs).
The general approach is conveniently illustrated through a particular concatenated structure obtained by embedding the \(\mathrm{WPMF}^{(c)}_{1}(\theta )\equiv\operatorname{SK1}(\theta)\) gate (Section 7) within the various segments of the \(\mathrm{WAMF}_{0,3}^{(1)}\) gate (Section 6.1). The former is explicitly written
The basic concatenation procedure is now to replace each constantamplitude pulse in \(\mathrm{WAMF}_{0,3}^{(1)}\) with the constantamplitude phasemodulated sequence implementing the equivalent rotation. Doing so effectively distributes the dephasing filter across the composite sequence, each subsequence of which filters amplitude noise. In our example, this takes place via the operator substitutions
where, as indicated, each SK1 is equal in duration to the original \(\mathrm{WAMF}_{0,3}^{(1)}\) pulse being replaced. We denote this concatenated structure by \(\mathrm{UWMF}_{1,\mathrm{SK1}}\). The temporal profile is shown in Figure 7(a). The SK1 phase flips \(\phi= \pm \phi _{\mathrm {SK1}}\) are indicated by the oppositely oriented hatching within each constantamplitude segment of the \(\mathrm{WAMF}_{0,3}^{(1)}\) envelope; \(\phi= 0\) is indicated by white fill. Once again the total gate rotation is determined by Eq. (36) and, as in Figure 3, \(X_{3}\) may be treated as an independent tuning parameter to achieve firstorder filtering against dephasing noise. The dephasing and amplitude filtertransfer functions for the concatenated and tuned sequence (in this case for a net π rotation) are shown in Figure 7(d), indicating effective filtering of both amplitude and dephasing noise. Below we detail two alternative constructions for realizing the UWMF structure.
9.1 Concatenation Method 1: Constrain Sequencing of WAMF Envelope
The amplitudemodulated envelope of the \(\mathrm{WAMF}_{0,3}^{(1)}\) construction, as defined by Eq. (39), may be viewed as a sequence of 3 piecewiseconstant rotations \(\vec {\boldsymbol{\theta}} = (\frac{X_{+}}{4},\frac {X_{}}{2},\frac{X_{+}}{4} )\), implemented over durations \((\frac{\tau}{4},\frac {\tau}{2},\frac{\tau}{4} )\) with Rabi rates \(\vec {\boldsymbol {\Omega }}= (\frac{X_{+}}{\tau},\frac {X_{}}{\tau},\frac {X_{+}}{\tau} )\). In our first concatenation method each rotation \(\theta_{l}\), \(l\in\{1,2,3\}\), is replaced by a constantamplitude phasemodulated operation SK1\((\theta_{l})\), implemented over a duration \(\tau _{\mathrm {SK1}}^{(l)}\) equal to that of the original rotation. That is, we constrain \((\tau _{\mathrm {SK1}}^{(1)},\tau _{\mathrm {SK1}}^{(2)},\tau _{\mathrm {SK1}}^{(3)} ) = (\frac {\tau}{4},\frac{\tau}{2},\frac{\tau }{4} )\). The constant Rabi rate \(\Omega _{\mathrm {SK1}}^{(l)} = \theta_{l}/\tau _{\mathrm {SK1}}^{(l)}\) driving each SK1 sequence is thus given by
The composite structure may then be written
Using this method one finds tunings of \(X_{0}\) and \(X_{3}\) such that both dephasing and amplitude noise are filtered to firstorder, as in Figure 7. These do not, however, correspond directly to the optimum Walsh coefficients found for simple \(\mathrm{WAMF}_{0,3}^{(1)}\) construction shown in Figure 3(a). Rather, an equivalent tuning plot may be generated over the \(X_{0}X_{3}\) domain, essentially identical to Figure 3(a) but with minima shifted by a constant factor. The second method, detailed below, involves a slightly different construction in which we recover the original \(\mathrm{WAMF}_{0,3}^{(1)}\) tuning plot.
9.2 Concatenation Method 2: Constrain Sequencing of Target SK1 Rotations
In the second construction we impose the constraint that \(\tau_{1}:\tau _{4}:\tau_{7} = 1:2:1\). That is, the target rotations within the three successive SK1 sequences follow the same timing sequence as the three constantamplitude pulses being replaced, previously constituting the amplitudemodulated \(\mathrm{WAMG}_{1}\) envelope. Thus we write \((\tau_{1},\tau_{4},\tau_{7} ) = \nu (1,2,1)\) where ν is some fraction of the total duration τ of the composite structure to be determined.
Now, we know pulses \((1,4,7)\) execute the rotations \((\frac {X_{+}}{4},\frac{X_{}}{2},\frac{X_{+}}{4} )\), given by the third row of Eq. (39). Hence the Rabi rates for these pulses in the composite structure must take the form \((\Omega_{1},\Omega _{4},\Omega_{7} ) = (X_{+},X_{},X_{+})/4\nu\). However each SK1 sequence has constant Rabi rate and we therefore conclude
Now, the duration of the composite sequence must satisfy
Substituting in the results from Eq. (60) we therefore find \(\tau= 16\pi\nu (2/X_{+}+1/X_{}) + 4\nu\). Or, solving for ν,
concluding the construction. The composite structure may then be written
Minima of the cost function in the \(X_{0}X_{3}\) domain for this construction are found in identical regions to those shown in Figure 3(a) for the simple \(\mathrm{WAMF}_{0,3}^{(1)}\) construction. Substituting these minimizing values of \(X_{0,3}\) into Eq. (65) thus optimizes the concatenated structure, yielding a desired net rotation (dictated by \(X_{0}\)) which filters both amplitude and dephasing noise to first order simultaneously.
10 Effect of bandwidth limits on Walsh filters
In the preceding sections of this paper filter design is based on optimizing the Walsh spectrum from which the relevant control structures are synthesized. This necessarily assumes perfectly square waveforms. Real control hardware, however, may suffer from bandwidth limitations which ‘smooth out’ the squareness of the pulse on the timescale of the application, leading to reduced filter performance. Here we show the assumption of perfect square pulses may be readily relaxed, with useful filter construction a simple matter of reoptimization in the Walshsynthesis framework.
To illustrate the general procedure we consider the \(\mathcal {M}\)segment WAMF. Each segment implements a rotation through angle \(\theta_{l} = \Omega_{l}\tau_{l}\) over duration \(\tau_{l}=\tau/\mathcal {M}\) and with constant Rabi rate \(\Omega_{l}\), \(l\in\{1,\ldots, \mathcal {M}\}\). The squareness of the resulting amplitudemodulated waveform may be relaxed by replacing the constant value \(\Omega_{l}\) with an arbitrarily varying function of time in each segment.
In order to achieve this we consider Walsh synthesis over the rotation angle implemented in a single segment rather than the Rabi rate. That is, we write \(\theta_{l} = \theta_{l}(X_{0}, X_{1},\ldots, X_{N})\) with the dependence on the Walsh spectra defined by the Hadamardmatrix equation
Defined in this way, the \(\mathcal {M}\)segment arbitrarypulse sequence shares with the WAMF construction the property that the total gate rotation angle \(\Theta= \sum_{l=1}^{n}\theta_{l} = X_{0}\tau\) is completely determined by the spectral amplitude of PAL_{0}. The symmetrybased design rules similarly carry over and filter optimization proceeds in the same manner as for ordinary Walshmodulated control by minimizing the filter cost function with respect to the Walsh spectrum.
As a natural example of this approach we assume a Gaussian profile \(G_{l}(t;\mu_{l},\sigma_{l})\) defined on \(t\in[t_{l1},t_{l}]\) with mean \(\mu_{l}\) and standard deviation \(\sigma_{l}\). Specifically, we construct
with \(\mu_{l}\) the segment midpoint and \(\sigma_{l}\) expressed as a multiple g of the segment duration. The normalizing factor
is included to ensure the total rotation implemented by the Gaussian pulse in the lth segment is given by \(\int_{t_{l}}^{t_{l1}} G_{l}(t;\mu _{l},\sigma_{l})\,dt = \theta_{l}\). We now impose the same structure on the segment rotations \(\theta_{l}\) as done for WAMFs in the Walshsynthesis framework, such that the smoothpulse sequence remains strictly parametrized in the Walsh spectrum X.
For concreteness, we examine the Gaussianpulse variation on the 4segment \(\mathrm{WAMF}_{0,3}^{(1)}\) filter described by Eq. (39) for two different Gaussian profiles, illustrated in Figure 8(a), (c). The cost function \(A_{z}(X_{3};X_{0}) = \int_{\omega_{L}}^{\omega_{c}}d\omega F_{z} (\omega\tau; X_{3};X_{0})\) may be computed by partitioning the time domain into a large number \(N_{s}\) of subintervals on which the continuous Gaussian envelope is treated as approximately constant. Figure 8(b), (d) show a twodimensional representation of \(A_{z}(X_{3};X_{0})\) integrated over the interval \(\omega\in[10^{9}, 10^{6}]\tau^{1}\). The value of \(\operatorname{Log}_{10} [A_{z}(X_{3};X_{0}) ]\) is indicated by the color scale. Total sequence length is normalized to \(\tau=1\) in this data, so the total gate rotation angle \(\Theta\equiv X_{0}\) is given directly by the \(X_{0}\)axis. Regions in blue represent effective (firstorder) filter constructions, where the cost function is minimized.
Comparing with Figure 3 we conclude useful filter construction using Gaussian pulses is a simple matter of reoptimization in the Walshsynthesis framework. This is readily achieved using a NelderMead optimization of \(A_{z}(X_{3};X_{0})\) for any particular choice of g, \(\omega_{L}\), \(\omega_{c}\), \(X_{0}\) or \(N_{s}\). Minor changes in the filter performance and optimal constructions arise with changes in Gaussian pulse parameters such as g. Comparison with pulses constructed using a trapezoidal form (Figure 8(e)) we find a different optimization outcome that more closely approximates standard square pulses. Nonetheless, these results show that, irrespective the specific pulse form, reoptimization over the Walsh coefficients remains a direct method to construct useful filters. In cases where unknown waveform distortion is likely in hardware, it is possible to implement automated feedback mechanisms, as has previously been demonstrated in dynamical decoupling experiments [15].
We may also explore the impact of finite modulation bandwidth on the application of square pulses if reoptimization of the waveform is, for some reason, not possible. In order to explore these effects we systematically relax the infinitemodulationbandwidth assumption underlying any squarepulse approximation by processing the ideal timedomain profile through a bandlimited digital filter with a userdefined cutoff. This results in an imperfect (bandlimited) profile envelope, effectively due to a reconstruction based on a truncated Fourier series. These profile distortions, manifesting as implementation errors, reduce filter performance, quantified by an increase in the area under the corresponding filtertransfer function.
In this example we again consider the amplitudemodulated profile associated with the \(\mathrm{WAMF}_{0,3}^{(1)}\) gate (\(X_{0} = 3\pi\), \(X_{3}=\pi\)), and impose band limitations using a digital firstorder Butterworth filter. Here the time domain is partitioned into \(1/f_{s}\) subintervals, where \(f_{s} = 1/2^{11}\) is the sampling rate of the digital filter. The bandlimited envelope of reconstructed waveform is then a function of the Butterworth cutoff frequency \(f_{c}\). As the cutoff approaches the Nyquist frequency \(f_{s}/2\) (the maximum possible value), the bandlimited effects are reduced and the reconstructed waveform approaches the ideal squarepulse envelope. Figure 9(a) illustrates this as we increase \(f_{c}/f_{s}\). The corresponding filter characteristics are shown in Figure 9(c) where we plot \(F_{z} (\omega)\) as a function of \(f_{c}/f_{s}\). To compute these filtertransfer functions we treat the reconstructed waveforms as amplitudemodulated sequences consisting of \(n = 1/f_{s}\) segments whose Rabirates are determined by the bandlimited envelope (see Figure 9(b)). The solid black traces in Figure 9(a), (b), (c) respectively show the ideal profile and corresponding filtertransfer function, against which the filter performance of the bandlimited gates are benchmarked. As we decrease the cutoff the integrated area under \(F_{z} (\omega)\) gradually increases. However as this manifests first in the lowfrequency region, even these bandlimited gates can provide useful filtering, given sufficient hardware precision. Similarly motivated studies in dynamic decoupling show analogous lowfrequency filter performance decay with pulsetiming errors.
11 Conclusion
As the size and complexity of quantum information processing technologies increase, resourceefficiency will play a vital role in selecting methods designed to reduce errors in quantum coherent hardware systems. The pressure to minimize quantumhardware overhead is likely to make openloop control protocols a key element in the design of errorrobust quantum information systems [14]. For these to be practically useful, however, it is important to move toward realistic control and noise models.
Decoherence in real driven systems is predominantly due to lowfrequency correlated noise environments. This strongly motivates our study of boundedstrength control as a noise filtering problem using timedependent, nonMarkovian error models. Moreover, in contrast with traditional DD schemes, the added complications of treating boundedstrength control  due to the continual presence of noise interactions during control operations and the resulting nonlinear dynamics  necessitates a streamlined approach to the design of noisefiltering control. The generalized filtertransfer function framework we employ takes as input experimentally measurable characteristics of the environment  namely noise power spectra  and provides a simple framework for both control construction and the calculation of predicted operational fidelities. It also efficiently captures the control nonlinearities implicit in situations where control and noise Hamiltonians do not commute. We have exploited these strengths to pursue a simple variational procedure for filter design by minimizing a cost function over the relevant control space.
A key strength of the method we have presented is derived from our use of functional analysis for the crafting of effective noisefiltering control protocols. In particular, employing the Walsh basis brings an intuitive set of analytic design rules for filter construction that further constrain the possible filterconstruction space [51]. For instance, a userimposed limit on the acceptable number of pulse segments in a filter construction impose additional constraints due to Walshfunction symmetry, spectral properties, and the level of recursiveness of the Walsh functions (measured by the Hamming weight of the Walsh Paleyordered index).
In addition to efficiency of synthesis is the intrinsic compatibility with hardware controllers that comes with the selection of Walsh functions as our basis set. This is particularly important in the layered architecture for quantum information systems mentioned throughout this paper. In such a setting, it rapidly becomes undesirable to mandate a significant amount of communication between the physical qubit layer and hardware at the highest levels of system abstraction. This suggests that controllers implementing dynamic error suppression protocols (here producing noise filters for arbitrary driven operations) should be reasonably simple to implement in standard digital hardware and should require only limited communication bandwidth to higher levels of the system.
These considerations are explicitly met in crafting control solutions from the Walsh basis. First, the Walsh functions are defined using integer multiples of a fundamental clock period, meaning that limitations of finite timing precision in the definition of a control protocol are automatically inbuilt. Further, given a particular Walshmodulated control protocol is entirely defined by its Walsh spectrum, programming of the controller can in principle be reduced to a simple vector of numbers representing the Walsh spectrum and minimum timestep. All other information e.g. the total time, total number of timesteps, etc., is carried implicitly in the spectrum. Moreover, the actual Walshfunction generation is compatible with simple hardware systems (adding of various harmonics of a fundamental squarewave clock) and when Walsh synthesis is performed at the level of the controller hardware, this may provide a path to onthefly synthesis of the required modulation waveform. Such capabilities also reduce the complexity of running automated hardwaredriven optimization procedures for finding relevant control waveforms [15], by allowing efficient generation of many trial waveforms without the need for large memory stores at the local controller.
Synthesizing all of these considerations the Walshmodulated noise filters we have developed in this work provide one of the first solutions for error suppression at the physicalqubit level simultaneously meeting the physical and engineering requirements we outline above for scalable control solutions. Using this framework we have derived a range of novel filters, chiefly WAMFs for dephasing noise and WPMFs for amplitude noise. Both are capable of spectral optimization subject to physically motivated constraints such as implementing target qubit rotations. These design forms are also compatible with concatenation for filtering universal noise. Interestingly, our approach unifies a number of existing composite pulse sequencing schemes; we have revealed how Walshmodulated filter construction naturally incorporates familiar sequences (e.g., DCG, SK1, P2, BB1) in a nonMarkovian timedependent noise context. This potential to incorporate other approaches may prove useful in building a consistent picture of the scope and applicability of the many and varied schemes that continue to be developed by the quantum control community. These considerations make the Walsh basis an attractive design platform and we believe this simple framework will provide a straightforward path for the development of improved quantum control techniques.
Notes
The assumption of independence is reasonable, for instance, in the case of a driving field where random fluctuations in frequency and amplitude arise from different physical processes. A general model including correlations between noise processes is possible, however, following the approach outlined by Green et al. [49].
The firstorder approximation has recently been experimentally tested and demonstrated to produce good agreement in the weak noise limit [37]. For the noise field \(\beta (t)\), this regime is sufficiently characterized by requiring \(\xi^{2}\ll 1\), where the smallness parameter is defined by \(\xi^{2}\equiv \langle\beta^{2}(t)\rangle\tau^{2}\equiv\tau^{2}\int_{\infty }^{+\infty}d\omega S_{\beta}(\omega)\) [48]. The condition \(\xi^{2}<1\) is also required for the Magnus series to formally converge.
For a resonantly driven qubit \(\phi_{l}\) is the phase of the driving field and \(\Omega_{l}\) is linearly proportional to the driving amplitude.
This effect is captured by the multiple slopes in Figure 4(h) which clearly show the difference between the asymptotic zerofrequency rolloff and the local slope over targeted regions \([\omega_{L},\omega_{c}]\) in the stopband.
All stopbands ‘turn on’ with a finite response, the functional form of which determines the filter order and the effectiveness of noise suppression. In the stopband this is quantified by the slope, or roll off in the language of filter design.
This can be shown by Taylor expanding the amplitude noise filter function \(F_{{\Omega }}(\omega\tau; \boldsymbol {\Gamma }^{\mathrm{AMF}}_{n})\) and deriving the result that \(C^{(\Omega)}_{2}(\boldsymbol {\Gamma }^{\mathrm{AMF}}_{n}) = \frac{1}{4} (\sum_{l = 1}^{n}\theta_{l} )^{2}\).
We use the vectors \(\mathbf{X} \equiv(X_{0}, X_{1},\ldots, X_{N})\) and \(\mathbf{Y} \equiv(Y_{0}, Y_{1},\ldots, Y_{N})\) to compactly write the Paley ordered Walsh spectra implied by Eq. (29) in synthesizing \(\Omega(t)\) and \(\phi(t)\).
Pulse periods taking noninteger multiples values of \(\tau_{\mathrm{min}}\) then have intrinsic conflict with implementation in discretized time via digital control, giving rise to residual errors.
Our studies have not produced proof that this symmetry is strictly necessary. In fact for WPMFs it is not required. However WAMF constructions possessing timereversal symmetry do appear to yield results more readily, and all WAMFs we have discovered have this property.
Maximizing the number of Rademacher functions does not correspond to maximizing the switching rate of \(\operatorname {PAL}_{k}(x)\). In fact, for a given \(m(k)\) the maximum switching rate for \(\operatorname {PAL}_{k}(x)\) corresponds to \(k = 2^{m(k)1}\), which consists of the single Rademacher function \(R_{m(k)1}(x)\).
These points may also be derived using NelderMead optimization of \(A_{z}(X_{0};X_{3})\) over the twodimensional domain. This method is useful for more complex constructions (see Section 6.2) where spectral optimization becomes a more multidimensional task.
Since the \(\mathrm{WAMF}_{0:7}^{(2)}\) gates in Figure 4 were derived by optimizing the cost function over local regions in the stopband, the asymptotic filter order \((p1)\) associated with Taylor expanding \(F_{z} (\omega)\) about \(\omega= 0\) is not a meaningful descriptor of these filters. Hence we do not expect \(C^{(z)}_{2,4} = 0\) and do not pursue such a calculation. Instead the instantaneous filter order is used.
This is valid since \(\Phi(\tau)\) belongs to the Lie algebra of \(SU(2)\), inheriting this property from the toggling frame Hamiltonians from which it is derived.
The higherorder \(C^{(k)}_{2j}\) involve terms oscillating at multiple frequencies and have nontrivial dependencies on \(\Omega _{0}\). Their zeros must in general be determined numerically.
References
Van Harlingen DJ, Plourde BLT, Robertson TL, Reichardt PA, Clarke J. Decoherence in flux qubits due to \(1/f\) noise in Josephson junctions. In: Leggett A, Ruggiero B, Silvestini P, editors. Quantum computing and quantum bits in mesoscopic systems. New York: Kluwer Academic; 2004. p. 17184.
Faoro L, Viola L. Dynamical suppression of \(1/f\) noise processes in qubit systems. Phys Rev Lett. 2004;92:117905.
Bylander J, Gustavsson S, Yan F, Yoshihara F, Harrabi K, Fitch G, Cory DG, Nakamura Y, Tsai JS, Oliver WD. Noise spectroscopy through dynamical decoupling with a superconducting flux qubit. Nat Phys. 2011;7:56570.
Zhang W, Dobrovitski VV, Santos LF, Viola L, Harmon BN. Dynamical control of electron spin coherence in a quantum dot: a theoretical study. Phys Rev B. 2007;75:201302.
Biercuk MJ, Uys H, VanDevender AP, Shiga N, Itano WM, Bollinger JJ. Highfidelity quantum control using ion crystals in a Penning trap. Quantum Inf Comput. 2009;9:92049.
Rutman J. Characterization of phase and frequency instabilities in precision frequency sources: fifteen years of progress. Proc IEEE. 1978;66:1048.
Tarn TJ, Huang G, Clark JW. Modelling of quantum mechanical control systems. Math Model. 1980;1:109.
Clark JW, Lucarelli DG, Tarn TJ. Control of quantum systems. Int J Mod Phys B. 2003;17:5397.
Bouten L, Van Handel R, James MR. An introduction to quantum filtering. SIAM J Control Optim. 2007;46:2199.
Nurdin HI, James MR, Petersen IR. Coherent quantum LGQ control. Automatica. 2009;45:1837.
Viola L, Lloyd S, Knill E. Universal control of decoupled quantum systems. Phys Rev Lett. 1999;83:4888.
Ticozzi F, Nishio K, Altafini C. Stabilization of stochastic quantum dynamics via open and closed loop control. IEEE Trans Autom Control. 2013;58:7485.
Lidar DA, Brun TA. Quantum error correction. New York: Cambridge University Press; 2013.
Jones NC, Van Meter R, Fowler AG, McMahon PL, Kim J, Ladd TD, Yamamoto Y. Layered architecture for quantum computing. Phys Rev X. 2012;2:031007.
Biercuk MJ, Uys H, VanDevender AP, Shiga N, Itano WM, Bollinger JJ. Optimized dynamical decoupling in a model quantum memory. Nature. 2009;458:996.
Khodjasteh K, Sastrawan J, Hayes D, Green TJ, Biercuk MJ, Viola L. Designing a practical highfidelity longtime quantum memory. Nat Commun. 2013;4:2045.
Du J, Rong X, Zhao N, Wang Y, Yang J, Liu RB. Preserving electron spin coherence in solids by optimal dynamical decoupling. Nature. 2009;461:1265.
Sagi Y, Almog I, Davidson N. Process tomography of dynamical decoupling in a dense cold atomic ensemble. Phys Rev Lett. 2010;105:053201.
Khodjasteh K, Viola L. Dynamically errorcorrected gates for universal quantum computation. Phys Rev Lett. 2009;102:080501.
Khodjasteh K, Lidar DA, Viola L. Arbitrarily accurate dynamical control in open quantum systems. Phys Rev Lett. 2010;104:090501.
Wang X, Bishop LS, Kestner JP, Barnes E, Sun K, Das Sarma S. Composite pulses for robust universal control of singlettriplet qubits. Nat Commun. 2012;3:997.
Souza AM, Álvarez GA, Suter D. Experimental protection of quantum gates against decoherence and control errors. Phys Rev A. 2012;86:050301.
van der Sar T, Wang ZH, Blok MS, Bernien H, Taminiau TH, Toyli DM, Lidar DA, Awschalom DD, Hanson R, Dobrovitski VV. Decoherenceprotected quantum gates for a hybrid solidstate spin register. Nature. 2012;484:826.
Liu GQ, Po HC, Du J, Liu RB, Pan XY. Noiseresilient quantum evolution steered by dynamical decoupling. Nat Commun. 2013;4:2254.
Fauseweh B, Pasini S, Uhrig GS. Frequencymodulated pulses for quantum bits coupled to timedependent baths. Phys Rev A. 2012;85:022310.
Vandersypen LMK, Chuang IL. NMR techniques for quantum control and computation. Rev Mod Phys. 2005;76:1037.
Merrill JT, Brown KR. Progress in compensating pulse sequences for quantum computation. arXiv:1203.6392 (2012).
Kabytayev C, Green TJ, Khodjasteh K, Biercuk MJ, Viola L, Brown KR. Robustness of composite pulses to timedependent control noise. Phys Rev A. 2014;90:012316.
Viola L, Knill E. Robust dynamical decoupling of quantum systems with bounded controls. Phys Rev Lett. 2003;90:037901.
Jones NC, Ladd TD, Fong BH. Dynamical decoupling of a qubit with alwayson control fields. New J Phys. 2012;14:093045.
Cai JM, Naydenov B, Pfeiffer R, McGuinness LP, Jahnke KD, Jelezko F, Plenio MB, Retzker A. Robust dynamical decoupling with concatenated continuous driving. New J Phys. 2012;14:113023.
Fanchini FF, Hornos JEM, Napolitano RdJ. Continuously decoupling singlequbit operations from a perturbing thermal bath of scalar bosons. Phys Rev A. 2007;75:022329.
Xu X, Wang Z, Duan C, Huang P, Wang P, Wang Y, Xu N, Kong X, Shi F, Rong X, Du J. Coherenceprotected quantum gate by continuous dynamical decoupling in diamond. Phys Rev Lett. 2012;109:070502.
Bermudez A, Schmidt PO, Plenio MB, Retzker A. Robust trappedion quantum logic gates by continuous dynamical decoupling. Phys Rev A. 2012;85:040302.
Chaudhry AZ, Gong J. Decoherence control: universal protection of twoqubit states and twoqubit gates using continuous driving fields. Phys Rev A. 2012;85:012315.
Lemmer A, Bermudez A, Plenio MB. Driven geometric phase gates with trapped ions. New J Phys. 2013;15:083001.
Soare A, Ball H, Hayes D, Sastrawan J, Jarratt MC, McLoughlin JJ, Zhen X, Green TJ, Biercuk MJ. Experimental noise filtering by quantum control. Nat Phys. 2014;10:8259.
Silva GP, Viola L. A general transferfunction approach to noise filtering in openloop quantum control. arXiv:1408.3836 (2014).
Kofman AG, Kurizki G. Universal dynamical control of quantum mechanical decay: modulation of the coupling to the continuum. Phys Rev Lett. 2001;87:270405.
Kofman AG, Kurizki G. Unified theory of dynamically suppressed qubit decoherence in thermal baths. Phys Rev Lett. 2004;93:130406.
Girod B, Rabenstein R, Stenger A. Signals and systems. New York: Wiley; 2001.
Biercuk MJ, Doherty AC, Uys H. Dynamical decoupling sequence construction as a filterdesign problem. J Phys B. 2011;44:154002.
Martinis JM, Nam S, Aumentado J, Lang KM, Urbina C. Decoherence of a superconducting qubit due to bias noise. Phys Rev B. 2003;67:094510.
Kuopanportti P, Mottonen M, Bergholm V, Saira OP, Zhang J, Whaley KB. Suppression of \(1/f^{\alpha}\) noise in onequbit systems. Phys Rev A. 2008;77:032334.
Uys H, Biercuk MJ, Bollinger JJ. Optimized noise filtration through dynamical decoupling. Phys Rev Lett. 2009;103:040501.
Uhrig GS. Keeping a quantum bit alive by optimized pipulse sequences. Phys Rev Lett. 2007;98:100504.
Cywinski L, Lutchyn RM, Nave CP, Sarma SD. How to enhance dephasing time in superconducting qubits. Phys Rev B. 2008;77:174509.
Green TJ, Uys H, Biercuk MJ. Highorder noise filtering in nontrivial quantum logic gates. Phys Rev Lett. 2012;109:020501.
Green TJ, Sastrawan J, Uys H, Biercuk MJ. Arbitrary quantum control of qubits in the presence of universal noise. New J Phys. 2013;15:095004.
Hayes D, Clark SM, Debnath S, Hucul D, Inlek IV, Lee KW, Quraishi Q, Monroe C. Coherent error suppression in multiqubit entangling gates. Phys Rev Lett. 2012;109:020503.
Hayes D, Khodjasteh K, Viola L, Biercuk MJ. Reducing sequencing complexity in dynamical quantum error suppression by Walsh modulation. Phys Rev A. 2011;84:062323.
Green TJ, Biercuk MJ. Phasemodulated decoupling and error suppression in qubitoscillator systems. arXiv:1408.2749 (2014).
Owrutsky P, Khaneja N. Control of inhomogeneous ensembles on the Bloch sphere. Phys Rev A. 2012;86:022315.
Hodgson TE, Viola L, D’Amico I. Towards optimized suppression of dephasing in systems subject to pulse timing constraints. Phys Rev A. 2010;81:062321.
Schumacher B. Sending entanglement through noisy quantum channels. Phys Rev A. 1996;54:2614.
Blanes S, Cases F, Oteo JA, Ros J. The Magnus expansion and some of its applications. Phys Rep. 2009;470:151.
Magnus W. On the exponential solution of differential equations for a linear operator. Commun Pure Appl Math. 1954;7:649.
Haeberlen U, Waugh JS. Coherent averaging effects in magnetic resonance. Phys Rev. 1968;175:453.
Ernst RR, Bodenhausen GB, Wokaun A. Principles of nuclear magnetic resonance in one and two dimensions. New York: Oxford University Press; 1987.
Ajoy A, Álvarez GA, Suter D. Optimal pulse spacing for dynamical decoupling in the presence of a purelydephasing spinbath. Phys Rev A. 2011;83:032303.
Beauchamp KG. Walsh functions and their applications. London: Academic Press; 1975.
Walsh JL. A closed set of normal orthogonal functions. Am J Math. 1923;45:5.
Tzafestas SG. Walsh functions in signal and systems analysis and design. New York: Van Nostrand Reinhold; 1985.
Cooper A, Magesan E, Yum HN, Cappellaro P. Timeresolved magnetic sensing with electronic spins in diamond. Nat Commun. 2014;5:3141.
Harmuth HF. Transmission of information by orthogonal functions. New York: Springer; 1969.
Harmuth HF. Applications of Walsh functions in communications. IEEE Spectr. 1969;6:82.
Paley R. A remarkable series of orthogonal functions (I). Proc Lond Math Soc. 1932;2:241.
Rademacher H. Einige Sätze über Reihen von allgemeinen Orthogonalfunktionen. Math Ann. 1922;87:241.
Horadam KJ. Hadamard matrices and their applications. Princeton: Princeton University Press; 2007.
Khodjasteh K, Viola L. Dynamical quantum error correction of unitary operations with bounded controls. Phys Rev A. 2009;80:032314.
Souza AM, Álvarez GA, Suter D. Effects of timereversal symmetry in dynamical decoupling. Phys Rev A. 2012;85:032306.
Brown KR, Harrow AW, Chuang IL. Arbitrarily accurate composite pulse sequences. Phys Rev A. 2004;70:052318.
Brown KR, Harrow AW, Chuang IL. Erratum: Arbitrarily accurate composite pulse sequences [Phys. Rev. A 70, 052318 (2004)]. Phys Rev A. 2005;72:039905.
Wimperis S. Broadband, narrowband, and passband composite pulses for use in advanced {NMR} experiments. J Magn Reson, Ser A. 1994;109:221.
Yan F, Gustavsson S, Bylander J, Jin X, Yoshihara F, Cory DG, Nakamura Y, Orlando TP, Oliver WD. Rotatingframe relaxation as a noise spectrum analyser of a superconducting qubit undergoing driven evolution. Nat Commun. 2013;4:2337.
Gustavsson S, Bylander J, Yan F, FornDíaz P, Bolkhovsky V, Braje D, Fitch G, Harrabi K, Lennon D, Miloshi J, Murphy P, Slattery R, Spector S, Turek B, Weir T, Welander PB, Yoshihara F, Cory DG, Nakamura Y, Orlando TP, Oliver WD. Driven dynamics and rotary echo of a qubit tunably coupled to a harmonic oscillator. Phys Rev Lett. 2012;108:170503.
Miller SL, Childers D. Probability and random processes with applications to signal processing and communications. Boston: Academic Press; 2012.
Acknowledgements
We thank K Brown, JT Merrill and L Viola for useful discussions. This work partially supported by the US Army Research Office under Contract Number W911NF1110068, and the Australian Research Council Centre of Excellence for Engineered Quantum Systems CE110001013.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.
Appendices
Appendix A: Detailed filtertransfer function derivation
In this appendix we derive the computational form of the firstorder infidelity \(\langle a_{1}^{2}\rangle= \langle \mathbf {a}_{1}\mathbf {a}_{1}^{T}\rangle\) expressed in Eq. (4). Recall, we write the total evolution operator \(U (t) = U_{c} (t)\tilde {U}(t)\) where the error propagator \(\tilde {U}(t)\) satisfies the Schrodinger equation \(i\dot{\tilde {U}}(t) = \tilde{H}_{0} (t)\tilde {U}(t)\) in a frame corotating with the control, defined by the toggling frame Hamiltonian \(\tilde{H}_{0} (t) :=U_{c}^{\dagger}(t){H}_{0} (t) U_{c} (t)\). We may obtain an arbitrarily accurate, unitary estimate of the error propagator by performing a Magnus expansion, whereby \(\tilde {U}(\tau) = \exp[i\Phi (\tau)]\) and the effective error operator \(\Phi(\tau) = \sum_{\mu= 1}^{\infty}\Phi_{\mu}(\tau)\) at the end of the interaction has Magnus expansion terms
These generally take the form of timeordered integrals over nested commutators in \(\tilde{H}_{0} (t)\).
We define the error vector \(\mathbf {a}(\tau)\) by reexpressing the operator \(\Phi(\tau)\equiv \mathbf {a}(\tau)\cdot \boldsymbol {\sigma }\) in the basis of Pauli operators.^{Footnote 13} Assuming unitary processes, one may then employ vector identities to expand \(\mathbf {a}(\tau) = \sum_{\mu= 1}^{\infty} \mathbf {a}_{\mu}(\tau)\) in an infinite power series such that \(\Phi_{\mu}(\tau) = \mathbf {a}_{\mu}(\tau)\cdot \boldsymbol {\sigma }\), \(\forall\mu\in\mathbb{N}\) [49]. The control propagator is therefore written \(\tilde {U}(\tau) = \exp [i\sum_{\mu= 1}^{\infty} \mathbf {a}_{\mu}(\tau)\cdot \boldsymbol {\sigma }]\) and may be approximated, with arbitrary accuracy, as a unitary operator in simple exponential form. In this paper we consider the firstorder approximation \(\mathbf {a}(\tau)\approx \mathbf {a}_{1}(\tau)\). Hence we restrict attention to deriving the form of \(\mathbf {a}_{1}(\tau)\) which, using Eq. (70), satisfies
Our first task is therefore to derive a computationally useful forms for the toggling frame Hamiltonian \(\tilde{H}_{0} (t)\). This is done in the following section.
1.1 Toggling frame Hamiltonian \(\tilde{H}_{0} (t)\): computational form
The noise Hamiltonian \({H}_{0} (t) = H_{0}^{(z)}(t) + H_{0}^{(\Omega)}(t)\), presented in Section 2 is linear in the dephasing and amplitude contributions. Since the \(\tilde{H}_{0} (t)\) is linear in \({H}_{0} (t)\) we may write
where we have defined the dephasing and amplitude toggling frame Hamiltonians by
It is convenient to employ the definitions of the scalar functions \(R_{ij}(t)\), \(R_{ij}^{P_{l}}(tt_{l1})\) and \(\Lambda_{ij}^{(l1)}\), \(i,j\in\{x,y,z\}\) introduced by Green et. al [49]. These are defined as the Cartesian expansion coefficients, in the basis of Pauli matrices, of the following operators
These functions then serve as matrix elements, defining the computational matrices
where the above expressions follow from postmultiplying Eqs. (75), (76) and (77) by \(\hat {\sigma }_{j}\), taking the trace and using the linearity of the trace operation. The matrix \(\mathbf{R}(t)\) captures the qubit dynamics, in the timedomain, due to the control Hamiltonian at any time; \(\mathbf{R}^{Pl}(tt_{l1})\) captures essentially the same information, but restricted to the time interval \(t\in I_{l}\). That is, during the lth pulse. The \(3\times3\) Control History Matrix \(\boldsymbol{\Lambda}^{(l1)}\), on the other hand, captures the accumulated effect of the previous \(l1\) completed pulses, implemented via the cumulative operator \(Q_{l1}\).
1.2 Dephasing toggling Hamiltonian \(\tilde{H}^{(z)}_{0} (t)\)
Substituting Eq. (2) into Eq. (73) the dephasing noise component of \(\tilde{H}_{0} (t)\) takes the form
Using Eq. (75), we may express \(U_{c}^{\dagger}(t)\hat {\sigma }_{z} U_{c} (t) = \sum_{j}R_{zj}(t)\hat {\sigma }_{j}\), \(j\in\{x,y,z\}\), yielding
where the timedomain Dephasing Control Vector \(\mathbf {R}^{(z)}(t)\) is defined as the third row of \(\mathbf{R}(t)\). Here, and in the following derivations, for notational simplicity σ is understood to be the column vector
The computational form of \(\mathbf{R}^{(z)}(t)\), by inspection of the more general computational form for \(\mathbf{R}(t)\) derived in Appendix B, is
1.3 Amplitude toggling Hamiltonian \(\tilde{H}^{(\Omega)}_{0} (t)\)
Similarly, substituting Eq. (3) into Eq. (74) we find
where in the second line we have substituted \(U_{c} (t) = \sum_{l=1}^{n} G^{(l)}(t)U_{c}(t,t_{l1})Q_{l1}\) using Eq. (10). From Eq. (8) the control operator \(U_{c}(t,t_{l1}) = \exp[i\frac{\Omega _{l}}{2}\hat {\sigma }_{\phi _{l}}(tt_{l1})]\) commutes with \(\hat {\sigma }_{\phi _{l}}\), \(\forall l\in\{ 1,\ldots,n\}\). That is, coaxial amplitude noise always ‘tracks’ the direction of control. Hence Eq. (86) reduces to
Now, from Eq. (77), we know \(Q^{\dagger}_{l1}\hat {\sigma }_{i}Q_{l1} = \boldsymbol{\Lambda}^{(l1)}_{i}\boldsymbol {\sigma }\), where \(\boldsymbol{\Lambda }^{(l1)}_{i}\) denotes the ith row of \(\boldsymbol{\Lambda}^{(l1)}\). We may therefore write
where \(\vec{{\mathbb{T}}}^{(l)} \equiv\frac{\Omega _{l}}{2}(\cos(\phi_{l}),\sin(\phi_{l}),0)\) is the Projection Vector defined in Eq. (18). Consequently, substituting into Eq. (87), the amplitude toggling Hamiltonian is reexpressed
where, for compactness, we have defined the timedomain Amplitude Control Vector
1.4 Firstorder error vector
To summarize of the previous sections, the error propagator is now written
The firstorder error vector consequently takes the form
where we define components
1.5 Firstorder infidelity
The timedomain representation of the firstorder infidelity \(\langle a_{1}^{2}\rangle= \langle \mathbf {a}_{1}\mathbf {a}_{1}^{T}\rangle\) now follows directly from Eq. (96). For filtering timedependent noise, however, it is more useful to transform to a spectral representation in which case \(\langle a_{1}^{2}\rangle\) separates into dephasing and amplitude noise terms, each appearing as an overlap integral between the noise PSD and a frequencydomain filtertransfer function. In this section we summarize this derivation, and define the filtertransfer functions. In the following section we present the final forms for these filtertransfer functions.
The modulus square of the firstorder error vector, using Eq. (96), is given by
Substituting Eqs. (98) and (99) and taking the ensemble average over time, the firstorder infidelity \(\langle a_{1}^{2}\rangle= \langle \mathbf {a}_{1}\mathbf {a}_{1}^{T}\rangle\) takes the form
Here the time average only operates on the noise fields, not on the control vectors since these are deterministic. Assuming, as in Section 2, \(\beta_{{\Omega}}(t)\) and \(\beta_{z} (t)\) are uncorrelated, classical random variables with zero mean, the twopoint crosscorrelation functions \(\langle\beta_{{\Omega}}(t_{i})\beta_{z} (t_{j})\rangle= \langle\beta_{z} (t_{k})\beta_{{\Omega}}(t_{l})\rangle=0\). Hence the infidelity reduces to
We further assuming widesensestationary, so the remaining twopoint correlation functions depend only on the time difference, and therefore reduce to autocorrelation functions. In this case we may invoke the WienerKhinchin theorem [77],
which relates the autocorrelation function of a signal \(\beta(t)\) to the Fourier transform of its PSD \(S_{\beta}(\omega)\). Denoting the dephasing and amplitude noise PSDs by \(S_{z} (\omega)\) and \(S_{{\Omega }} (\omega )\), we may therefore reexpress \(\langle a_{1}^{2}\rangle\) in terms of the noise spectral properties, yielding
Defining the frequencydomain control vectors via the integral transforms
it is then straightforward to further reexpress the infidelity in terms the spectral properties of the control, yielding
Defining the frequencydomain filtertransfer functions,
we therefore recover Eq. (4)
Appendix B: Control vectors: computational forms
The dephasing and amplitude filtertransfer functions \(F_{z} (\omega)\) and \(F_{{\Omega }}(\omega)\) are obtained by taking the modulus square respectively of the frequencydomain dephasing and amplitude control vectors \(\mathbf{R}^{(z)}(\omega)\) and \(\mathbf{R}^{(\Omega )}(\omega)\), defined by Eq. (111) in terms of a Fouriertype transform. In this section we derive the computationally useful forms of \(\mathbf{R}^{(z)}(\omega)\) and \(\mathbf{R}^{(\Omega)}(\omega)\).
2.1 Total Control Matrix \(\mathbf{R}(t)\) computational form
The timedomain Total Control Matrix \(\mathbf{R}(t)\) is defined by Eq. (78) with elements \(R_{ij}(t):=\frac{1}{2}\operatorname{Tr} [U_{c}^{\dagger}(t)\hat {\sigma }_{i} U_{c} (t)\hat {\sigma }_{j} ]\). Substituting in Eq. (10) we then obtain
where we have used Eq. (76) to reexpress \(U^{\dagger}_{c}(t,t_{l1})\hat {\sigma }_{i} U_{c}(t,t_{l1})\) in terms of the \(R^{P_{l}}_{ij}\). Using the linearity of the trace operation and recalling the definition of the of the Control History Matrix elements \(\Lambda ^{l1}_{ij}\) from Eq. (80), we then obtain
Hence, by definition of matrix multiplication, the time domain total control matrix takes the form
We move to the frequency domain by performing the integral transform on \(\mathbf{R}(t)\) defined by
In the last line we have performed a change of variables using \(t' = tt_{l1}\), \(\forall l\in\{1,\ldots, n\}\). The frequencydomain Total Control Matrix thus takes the computational form
where we have defined the frequencydomain Local Control Matrix by
The matrix elements of \(\mathbf{R}^{P_{l}}(\omega)\) are derived as functions of the control sequence in the section bellow.
2.2 Local Control Matrix elements
As defined in Eq. (79), the matrix elements of the timedomain Local Control Matrix are given by \(R_{ij}^{P_{l}}(tt_{l1}) = \frac{1}{2}\operatorname{Tr} [U_{c}^{\dagger}(t,t_{l1})\hat {\sigma }_{i} U_{c}(t,t_{l1})\hat {\sigma }_{j} ]\), where \(U_{c} (t,t_{l1}) \equiv\exp[i\frac{\Omega_{l}}{2}\hat {\sigma }_{\phi _{l}}(tt_{l1})]\). The frequency domain representation \(\mathbf{R}^{P_{l}}(\omega)\) then follows from the integral transform defined by Eq. (128), with matrix elements expressed as functions of the control parameters \(\{\Omega_{l},\tau_{l},\phi_{l}\}\). These matrix elements take the form
where we have defined
2.3 Amplitude Control Vector
The computational form for the frequencydomain Amplitude Control Vector \(\mathbf{R}^{(\Omega)}(\omega)\) follows from substituting Eq. (90) into Eq. (111), yielding
Appendix C: Walsh Rotary Spin Echo derivations
The \(\mathrm{WRSE}_{k}\) sequence is defined by the phase modulation \(\phi(t) = \phi_{0}+\frac{\pi}{2}(1y(t))\), where \(y(t)\in\{\pm1\}\). Referring to Eq. (6), however, the spin operator \(\hat {\sigma }_{\phi(t)}\) satisfies
Consequently the signinversion may be absorbed into a modulated Rabirate defined by \(\Omega_{y}(t) := y(t)\Omega_{0}\). The sequence is then conveniently recast as amplitude modulation with constant phase \(\phi_{0}\). Defining \(y(t):= \operatorname {PAL}_{k}(t/\tau)\) we therefore obtain the Walsh synthesis \(\Omega_{k}(t) = \Omega _{0}\operatorname {PAL}_{k}(t/\tau)\) consisting of a single Walsh function. Referring to Eq. (31) the associated amplitude modulation is thus given by
where \(\tilde {X}_{i(k)} = \Omega _{0}\) is the only nonzero element of \(\tilde{\mathbf{X}}\) and, as in Section 5.1, \(\mathbf{P}^{(k)}_{\mathcal {M}}:=(P^{(k)}_{1},P^{(k)}_{2},\ldots ,P^{(k)}_{\mathcal {M}})^{T}\) defines the \(i(k)\)th column of \(H_{\mathcal {M}}\). Eq. (46) is then more conveniently reexpressed
In the next section we use this form to analyze the amplitude noise filtering properties. The subsequent section treats the filtering properties in the dephasing quadrature.
3.1 \(\mathrm{WRSE}_{k}\) as amplitude noise filters
Referring to Eq. (147), the rotation operator \(\hat {\sigma }_{\phi_{0}}\) for \(\mathrm{WRSE}_{k}\) is treated as fixed across all pulses. Thus it commutes with \(P_{l}\) and, consequently, with \(Q_{l} = P_{l}P_{l1}\cdots P_{0}\) \(\forall l\in\{1,\ldots, \mathcal {M}(k)\}\). It follows \(Q^{\dagger}_{l1}\hat {\sigma }_{\phi_{0}}Q_{l1}= \hat {\sigma }_{\phi_{0}}\) which, postmultiplying by \(\hat {\sigma }_{k}\) and taking the trace of both sides, yields the identity
The LHS expands to \(\delta_{xk}\cos(\phi_{0})+\delta_{yk}\sin(\phi _{0})\) (where \(\delta_{lk}\) is the Kronecker delta), and the RHS expands to \(\cos(\phi_{0})\Lambda^{(l1)}_{xk}+\sin(\phi_{0})\Lambda ^{(l1)}_{yk}\) (using the definition of the Pulse History Matrix in Eq. (80)). We thus obtain the following three identities \(\forall\phi_{0}\):
Now, setting \(\Omega_{l} \equiv P^{(k)}_{l}\Omega _{0}\) the Projection Vector defined in Eq. (18) becomes \(\vec{ {\mathbb{T}}}^{(l)} = (\Omega _{0}P^{(k)}_{l}/ 2) [\cos(\phi_{0}), \sin(\phi _{0}),0 ]\), in which case
where in the last equality we have used the identities derived above in Eqs. (149), (150) and (151). Using Eq. (16) we therefore obtain
where \(t_{l} = l\tau/\mathcal {M}(k)\). From Eq. (14) the amplitude filtertransfer function therefore becomes
where, on taking the modulus square, the \(\phi_{0}\) dependence amounts to \(\cos(\phi_{0})^{2}+\sin(\phi_{0})^{2} = 1\) and hence vanishes.
3.2 \(\mathrm{WRSE}_{k}\) as dephasing noise filters
For a general \(\mathrm{WRSE}_{k}\) sequence, one can show the firstorder Taylor coefficient for \(F_{z} (\omega)\) takes the analytic form
yielding the family of zeros \(Z^{(k)}_{2} = \{2^{\kappa(k)}\pi q q\in \mathbb{N}\}\). Hence it is always possible to produce a firstorder filter with \((p1) = 1\) by setting \(\Omega _{0}\in Z^{(k)}_{2}\). Higherorder filters for dephasing noise  that is, such that \((p1)>1\)  then correspond to some η satisfying Eq. (49) such that \(\eta\in Z^{(k)}_{2}\). Although a general analytical form for these higherorder coefficients is not easy to express^{Footnote 14} we may still make progress, however, by simply substituting in the candidate values \(\Omega _{0}= 2^{\kappa(k)}\pi q\) and determining which \(q\in\mathbb{N}\) produce concurrent zeros of the \(C^{(z)}_{2j}(\Omega _{0})\). As a representative example we study the particular case for \(\mathrm{WRSE}_{3}\), deriving the coefficients
From above, the choice \(k = 3\) implies \(\kappa(k) = 2\) and consequently the candidate zeros take the form \(\Omega _{0}= 4\pi q\). Substituting into the above expressions yields
Thus q must be even to ensure \(C^{(z)}_{4} = 0\). However this choice implies \(C^{(z)}_{6}>0\) (in fact \(C^{(z)}_{6}>0\) for any choice of q) and it follows \(\mathrm{WRSE}_{3}\) is at maximum a secondorder filter. In Figure 6(a) we plot \(C^{(z)}_{2j}(\Omega_{0};3)\), \(j\in\{1,2,3\} \) showing the existence of concurrent zeros only for \(j\in\{1,2\}\). The inset shows, as a representative case, the behaviour near \(\Omega _{0} = 8\pi\). In Figure 6(b) we plot \(F_{z} (\omega)\) setting \(\Omega_{0} = 2\pi q\), \(q\in\{1,\ldots,8\}\), showing values for which first and secondorder filtering is achieved. Repeating this general procedure for other values of k we find similar results and conclude the \(\mathrm{WRSE}_{k}\) family are capable of up to secondorder filtering against dephasing noise.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Ball, H., Biercuk, M.J. Walshsynthesized noise filters for quantum logic. EPJ Quantum Technol. 2, 11 (2015). https://doi.org/10.1140/epjqt/s4050701500224
Received:
Accepted:
Published:
DOI: https://doi.org/10.1140/epjqt/s4050701500224
Keywords
 decoherence suppression
 error correction
 openloop control
 dynamic error suppression
 quantum control
 quantum logic
 qubit
 Walsh function
 functional analysis