Error in resonance

Quantum technologies that utilise quantum states, such as quantum computing^1,2,3 and metrology^4,5,6, require precise control of the states. However, the quantum systems that we are attempting to control basically experience unavoidable environmental noise and systematic errors caused by experimental apparatuses. They prevent us from precise control of quantum states.

To suppress the effects of systematic errors, a composite pulse (CP) has been investigated^7,8,9 particularly in the field of nuclear magnetic resonance (NMR), which can be utilised to implement toy quantum computers^10,11,12. In CPs, a single operation is replaced by a sequence of operations, and the error in each operation cancels each other up to a certain order with respect to the error magnitude. In this paper, we focus on first-order CPs, which compensate for first-order effects of error magnitude. The effectiveness of CPs has been exhibited in NMR¹³, ion traps¹⁴, and superconducting circuits¹⁵.

In NMR, two types of errors, Pulse Length Error (PLE) and Off Resonance Error (ORE), in one-qubit operations have been intensively studied. If we adopt the Bloch sphere representation, in which a state of a qubit is represented by a point in a three-dimensional sphere (Bloch sphere) while an operation by a rotation, PLE corresponds to the error of the rotational angle of an operation, and ORE corresponds to the error of the rotation axis. Many CPs that are robust against PLE, such as BB1¹⁶, SCROFULOUS¹⁷ and SK1¹⁸, have been found. Similarly, we have many construction methods for CPs that are robust against ORE^{8,19,20,21,22,23}. When we perform a specific target operation, such as (pi)— and (pi /2)-rotations in the Bloch sphere representation, these methods work well and can provide simple and explicit formulae for determining ORE robust operations. The CORPSE family is one of the simplest and most tractable ORE robust CPs for implementing an arbitrary (theta)-rotation²⁴; all of its parameters are explicitly determined as a simple function of the parameters of the target operation. This family is often used when ORE robust arbitrary (theta)-rotations are required^25,26,27,28.

Recently, it was revealed that PLE robust CPs have a geometric property related to the concept of the geometric quantum gates²⁹. Additionally, a geometric meaning of robustness against any type of noise is discussed in Ref.³⁰; however, it is associated with the geometry of Lie algebras and abstract. A concrete geometric property of ORE robust CPs has not yet been addressed.

In this study, we investigated a geometric property of ORE robust CPs via geometry on the Bloch sphere. We obtained the relation between the ORE robustness of a CP and its trajectory. This geometric property will provide a deeper understanding of the ORE robustness and increase its tractability. Further, we illustrated this property using two ORE robust CPs, CORPSE and another CP, which we have newly invented. For some simple cases, this property will help us to obtain new ORE robust CPs intuitively.

The remainder of this paper is organised as follows. We briefly review basic concepts of CPs in “Review of composite pulses”. In “Geometric property of ORE robust CP”, we explain our result on the geometric property of ORE robust gates. “Two examples of ORE robust composite pulses” introduces two ORE robust CPs, CORPSE and our proposed CP, and we examine how the geometric picture of ORE robust CPs works. “Conclusions and discussions” presents the conclusions and discussions. We use the natural unit (hbar =1) throughout the paper.

General framework

Here, we introduce a general theory of CPs, which is applicable to any quantum systems although we will focus on two-level systems from the next subsection. The Schrödinger equation with a time-dependent Hamiltonian H(t) is

The formal solution from (t=0) to (t=T) in the Schrödinger picture is given by

where we introduce the symbol of the time-ordered product:

Its extension to cases of multiple operators is trivial. If the Hamiltonian is piecewise constant, the time-ordered exponential can also be rewritten as

where we set (t_{0}=0) and (t_{k}=T) and the Hamiltonian is

k is the number of periods in which the Hamiltonian is constant. We refer to an operation during the Hamiltonian is constant as an elementary operation. Then, k represents the number of elementary operations.

Let us assume that the Hamiltonian is decomposed into two parts:

The part (H_{0}(t)) represents the ideal Hamiltonian, whose corresponding dynamics (U_{0}(T,0):=mathcal{T}exp (-i int ^{T}_{0}d t H_{0}(t))) will be implemented herein. We can control this part of the Hamiltonian. Meanwhile, (H_{mathrm{err}}(t)) describes the effect of undesired systematic errors during the operation. The magnitude of (H_{mathrm{err}}(t)) is assumed to be sufficiently small compared to that of (H_{0}(t)) for the entire time region. (Mathematically, all the matrix components of (H_{mathrm{err}}(t)) are small compared to that of (H_{0}(t)).) Either part (H_{0}(t)) or (H_{mathrm{err}}(t)) can have (piecewise) time dependence. We define the state in the interaction picture with respect to (H_{0}(t)) as

where (|Psi (t)rangle) is a solution to the Schrödinger equation (1). The state (|Psi _{I}(t)rangle) satisfies the following equation:

where ({tilde{H}}_{mathrm{err}}(t):=U^{dagger }_{0}(t,0)H_{mathrm{err}}(t)U_{0}(t,0)). A formal solution of Eq. (8) is

By comparing the above Eq. (9) and the definition of the interaction picture (7), the solution of the Schrödinger equation with the Hamiltonian (6) is written as

We intend to implement the ideal unitary operation (U_{0}(T,0)) as accurately as possible under the effect of the error term (H_{mathrm{err}}). As the magnitude of (H_{mathrm{err}}) is assumed to be small enough, we can ignore its higher-order terms in ({tilde{U}}_{mathrm{err}}(T,0)), and then

When the condition

is satisfied, the operation (10) equals the ideal operation (U_{0}(T,0)) for any initial state (|Psi (0)rangle) up to the first order with respect to ({tilde{H}}_{mathrm{err}}(t)). If better accuracy is required, we obtain more conditions from higher-order terms. Note that to implement a unitary evolution U as the target operation, there are many choices of (H_{0}(t)) that satisfy (U=U_{0}(T,0)). If we know the error model (H_{mathrm{err}}(t)), we can take (H_{0}(t)) to satisfy (U=U_{0}(T,0)) and Eq. (12) using the degrees of freedom of this choice of (H_{0}(t)). Thus, the operation caused by such a Hamiltonian (H_{0}(t)) traces the unitary operation U in a robust manner against the specific error model (H_{mathrm{err}}(t)). This is called a CP, one of several methods compensating for the effect of specific errors, such as adiabatic pulses, shortcuts to adiabaticity, and optimal control.

Qubit control

The most fundamental quantum system in quantum information processing is a two-level system, called a qubit. Hereinafter, we focus on the control of one qubit. The control Hamiltonian of a qubit is given as

where the vector (vec {n}(t)=(n_{x},n_{y},n_{z})) is a time-dependent unit vector, and (vec {sigma }:=(sigma _{x},sigma _{y},sigma _{z})) are the Pauli matrices:

We implement an arbitrary control of a qubit by adjusting (omega (t)) and (vec {n}(t)). The time dependence of these controllable parameters is often piecewise constant, as shown in Eq. (5), which corresponds to a sequence of pulses. Note that any state of a qubit can be mapped to a point on a sphere (called the Bloch sphere). In this representation, we map the eigenvectors of (sigma _{z}), (|uparrow rangle :=(1,0)^{t}) and (|downarrow rangle :=(0,1)^{t}) to the north pole (vec {z}=(0,0,1)^{t}) and the south pole (-vec {z}=(0,0,-1)^{t}) on the Bloch sphere, respectively. The superscript t means the matrix transposition. Accordingly, the operation of the qubit by the Hamiltonian (13) with constant (omega) and (vec {n}) corresponds to the rotation with the rotation angle (theta :=omega tau) and the axis (vec {n}), where (tau) is a period during which (omega) and (vec {n}) are applied. Hereinafter, we consider the case where the Hamiltonian is piecewise constant.

When we consider the control of one qubit, there are two types of systematic errors: PLE and ORE.

PLE case

PLE is described by the change in (omega (t)) in the control Hamiltonian, (omega (t) rightarrow omega (t)(1+epsilon )), where (epsilon) is a small parameter representing the magnitude of PLE. We should comment that the name of PLE might not be appropriate. This error has two origins: imperfection of the pulse (control field) amplitude and pulse duration. Because pulse duration has less imperfection in NMR, the error in the amplitude is the dominant origin of PLE. As the name of pulse length error rather sounds to be caused by the pulse duration error, we may be ought to call it pulse amplitude error. However, in this paper, we call this error PLE following the fashion in NMR.

The control Hamiltonian (H_{0}(t)) and the error Hamiltonian (H_{mathrm{err}}(t)) are given by

Here, we assume that (epsilon) is constant at (0<t<T) because it represents a systematic error. In this case, (U_{0}(t,0)) and ({tilde{H}}_{mathrm{err}}) are given as

where (V_{i}) denotes (exp (-i theta _{i}vec {n}_{i}cdot vec {sigma }/2)) while (V_{0}) is the identity matrix and (theta _{i}:=omega _{i}(t_{i}-t_{i-1})). (V_{0}) is inserted in the last line just for ensuring the consistency with the range of (i=1sim k). The condition of error robustness (12) for PLE is

In Ref.²⁹, it was shown that Eq. (17) means a vanishing total dynamic phase, and then it leads to a geometric quantum gate^31,32,33 based on the concept of holonomy^34,35,36,37. Many PLE robust CPs, such as BB1¹⁶, SCROFULOUS¹⁷, and SK1¹⁸, have been found to date.

ORE case

ORE is typically caused by the miscalibration of the resonance frequency of a qubit. When the quantisation axis is the z-axis of the Bloch sphere, the (piecewise constant) control Hamiltonian (H_{0}(t)) and the error Hamiltonian (H_{mathrm{err}}(t)) are given by

where f is a small parameter corresponding to ORE magnitude. Note that the error term for ORE is time independent. The error Hamiltonian in the interaction picture is

where we use the same definition of (V_{i}) as Eq. (16). Note that (e^{-i omega _{i}(t-t_{i-1})vec {n}_{i}cdot vec {sigma }/2}) does not commute with (H_{mathrm{err}}(t)) ((sigma _{z}) in this case) unlike the case of PLE. Then the condition (12) is calculated as

This ORE robustness condition seems to be more complicated than that of PLE (17). However, in this study, we show that this condition has a simple geometric understanding via geometry on the Bloch sphere.

CORPSE, which was proposed in Ref.²⁴, is a well known ORE robust CP. This CP can perform an arbitrary (theta) rotation in an ORE robust manner with considerably simple operations. Each parameter in the CORPSE sequence is explicitly determined as a function of the parameters of the target operation.

General case

Here, we explain a geometric property of Eq. (20). First, note that for any 3-dimensional unit vector (vec {n}) and (vec {m}),

where ({{varvec{R}}}(theta ,vec {m})) is a (3 times 3) rotation matrix with rotational axis (vec {m}) and angle (theta). Using this equality, the right hand side of Eq. (20) can be rewritten as

Thus, we obtain the following condition from Eq. (20),

This condition is also equivalent to the following for any vector (vec {p}in {{mathbb {R}}}^{3}):

where (vec {p}_{i}:={{varvec{R}}}(theta _{i},vec {n}_{i}){cdotcdotcdot} {{varvec{R}}}(theta _{1},vec {n}_{1}) vec {p}) with (vec {p}_{0}:=vec {p}). In the second line, we transpose the equation and use ({{varvec{R}}}^{t}(theta ,vec {m})={{varvec{R}}}^{-1}(theta ,vec {m})). As the above equation is linear, we can normalise the length of (vec {p}) without loss of generality, and then we identify (vec {p}) with a position vector (quantum state) on the Bloch sphere. Let ({{mathbb {R}}}^{3}_{n}) denote the space of the position vectors on the Bloch sphere.

(vec {p}_{i}) represents the point after the sequence of rotations ({{varvec{R}}}(theta _{i},vec {n}_{i}){{varvec{R}}}(theta _{i-1},vec {n}_{i-1}){cdotcdotcdot} {{varvec{R}}}(theta _{1},vec {n}_{1})). By introducing (vec {p}(t):= {{varvec{R}}}(omega _{i}(t-t_{i-1}),vec {n}_{i}) p_{i-1}~(t_{i-1}le t < t_{i})), we further summarise Eq. (24) as

The integration in the above equation is the sum of all position vectors on the trajectory,

See Fig. 1. This sequence of rotations corresponds to the action of the errorless unitary operation (V_{k}{cdotcdotcdot} V_{1}) in the Bloch sphere representation. Accordingly, (vec {p}(t)~(0<t<T)) represents the trajectory of the initial state (vec {p}) by the action of this unitary operation. This leads to the following geometrical expression of the ORE robustness condition: a CP is ORE robust if and only if, for any initial state (vec {p}),the time integral of all position vectors on the trajectory by this CP in the Bloch sphere representation exists on the xy plane. Thus, we now express the ORE robustness condition of a CP via the geometric concept associated with the trajectory by the CP. Note that this geometric property is also valid when the Hamiltonian is not piecewise constant but continuously time-dependent; intuitively, the continuous case corresponds to the limit, (krightarrow infty) and (t_{i}-t_{i-1}rightarrow 0), while keeping (T=sum ^{k}_{i=1} (t_{i}-t_{i-1})) constant.

Schematic picture of the trajectory of (vec {p}) by ({{varvec{R}}}(theta _{k},vec {n}_{k}){cdotcdotcdot} {{varvec{R}}}(theta _{1},vec {n}_{1})) on the Bloch sphere. The thick curve represents the trajectory of the i-th operation from (vec {p}_{i-1}) to (vec {p}_{i}). The i-th part of the summation in Eq. (24) is the integration of all position vectors along this trajectory.

Full size image

Constant-(omega) case

Here, we consider the case where (omega _{i}), the magnitude of the control field (H_{0}), is constant throughout the operation: (omega _{i}=omega ~(0<t<T)), which is a common assumption in quantum information processing. In the Bloch sphere representation, a constant (omega) means a constant angular velocity of the motion of the position vector representing a quantum state. We can set (omega =1) without loss of generality. Under this assumption, the above definition (25) of the ORE robustness condition can further be interpreted in a purely geometric way.

First, we focus on each part of the sum in Eq. (24):

which represents the integral of all the position vectors on the trajectory from the time (t_{i-1}) to (t_{i}). The position vector p(t) during this time interval sweeps the trajectory from (p_{i-1}) to (p_{i}) with a constant speed because both the angular velocity and the rotation radius are constant. The constant rotation radius follows from the constant Hamiltonian during (t_{i-1}) and (t_{i}): The dynamics in the Bloch sphere by the Hamiltonian during this period is a simple rotation with a constant radius. Note that the sweeping speed can differ for different time intervals, e.g., (t_{1}rightarrow t_{2}) and (t_{2}rightarrow t_{3}) because the rotation radii are not necessarily the same.

Equation (27) is rewritten as

Here we use (omega =1) and (omega (t_{i}-t_{i-1})=theta _{i}), and (vec {M}^{i}_{vec {p}}) can be identified as the geometric centre of all the position vectors (vec {p}(t)) during the interval from (t_{i-1}) to (t_{i}) because of the constant speed of (vec {p}(t)). More physically, this geometric centre corresponds to the mass centre of this arc on the trajectory when we assign a constant mass density to each point on the arc. We define (theta _{i}) as the mass of this arc. Thus, Eq. (28) can be regarded as (mass of this arc) (times) (mass centre of this arc).

The sum in Eq. (24) is correspondingly rewritten as

To further consider this sum of the vector, we recall the mass centre for a composite system that consists of k subsystems. When i-th subsystem has the mass (m_{i}) and the mass centre (vec {M}_{i}), the mass centre (vec {M}) of the entire composite system is calculated as (vec {M}=sum ^{k}_{i=1}m_{i}vec {M}_{i}/m), where m is the total mass (sum ^{k}_{i=1}m_{i}). Thus, we define the mass centre of all the position vectors on the trajectory as

Note that the mass (sum ^{k}_{i=1}theta _{i}) equals to the operation time T. Substituting this definition and Eq. (29) into Eq. (24), we obtain the following simple equation:

where we use the fact that (sum ^{k}_{i=1}theta _{i}=T) is non-zero. This immediately implies that a CP is ORE robust if and only if the mass centre of the errorless trajectory by this CP on the Bloch sphere exists on the xy plane for any initial state (vec {p}). This is the geometric property of ORE robust CPs when we assume that (omega) is constant. In this case, all the information for calculating the ORE robustness is extracted purely graphically from the trajectories on the Bloch sphere.

In this section, we verify that the mass centre of the trajectory lies on the xy plane for two ORE robust CPs: CORPSE and our newly proposed CP. First, we explain the notation. We assume that the unit vector (vec {n}) for each operation (e^{-i theta vec {n}cdot vec {sigma }/2}) is directed into the xy plane. Without loss of generality, we can represent (vec {n}) by (vec {n}_{phi }:=(cos phi ,sin phi ,0)). We parametrise an operation by (theta) and (phi), and thus define ((theta )_{phi }:=e^{-i theta vec {n}_{phi }cdot vec {sigma }/2}). Accordingly, a CP is written as a sequence ((theta _{k})_{phi _{k}}(theta _{k-1})_{phi _{k-1}}{cdotcdotcdot} (theta _{1})_{phi _{1}}). Also, we assume that (omega =1) during the entire operation. Hence, the discussion below is understood using the mass centre of trajectories, which is a purely geometric concept.

CORPSE

A well-known ORE robust CP, CORPSE, can implement ((theta )_{phi }) as the target operation for any (theta) and (phi). The CORPSE sequence of implementing ((theta )_{phi }) comprises three elementary operations ((k=3)) given by the following parameters:

where (kappa =arcsin (sin (theta /2)/2)) and (n_{i}) ((i=1,2,3)) are integers that satisfy (n_{1},n_{3} ge 0), and (n_{2}ge 1). Simple algebraic calculations show that the CORPSE sequence ((theta _{3})_{phi _{3}}(theta _{2})_{phi _{2}}(theta _{1})_{phi _{1}}) satisfies ((theta )_{phi }=(theta _{3})_{phi _{3}}(theta _{2})_{phi _{2}}(theta _{1})_{phi _{1}}) and is ORE robust.

Errorless trajectories on the yz plane by CORPSE ((frac{pi }{3})_{0}(frac{5pi }{3})_{pi }(frac{pi }{3})_{0}), which performs ((pi )_{0}). The left (right) panel has (vec {z}) ((vec {y})) as the initial state. The initial (final) states are represented by the blue (red) points. The blue, green, and red curves represent the first, second, and third pulse trajectories, respectively. The left (right) panel has (vec {z}) ((vec {y})) as the initial state.

Full size image

We show the ORE robustness of CORPSE from a geometric viewpoint. For simplicity, we consider the case in which CORPSE implement ((pi )_{0}), that is, the (pi) rotation with the direction (vec {x}:=(1,0,0)). Also, we take (n_{1}=n_{3}=0) and (n_{2}=1). The parameters for this case are (theta _{1}=theta _{3}=pi /3), (theta _{2}=5 pi /3), (phi _{1}=phi _{3}=0), and (phi _{2}=pi). First, we note that it is only necessary to consider three linear independent unit vectors as (vec {p}) to examine the condition (31) owing to the linearity. We take (vec {x}=(1,0,0)^{t}), (vec {y}=(0,1,0)^{t}), (vec {z}=(0,0,1)^{t}) as (vec {p}). The vector (vec {x}) is a fixed point during the entire operation, and thus, the mass centre of the trajectory starting from (vec {x}) is on the xy plane. We then examine the trajectory from the staring points (vec {y}) and (vec {z}). It is convenient to show the yz plane to consider the mass centre of these trajectory (Fig. 2). Note that the information of the x direction is redundant when we consider these trajectories by CORPSE. The mass centre of the trajectory from (vec {z}) is calculated as follows.

Thus (vec {z}^{~t}cdot vec {M}_{vec {z}}=vec {z}^{~t}cdot vec {0}=0). It is also shown that (vec {M}_{vec {y}}=vec {0}) because the trajectories from (vec {y}) and (vec {z}) (and these mass centres) are related by (frac{pi }{2})-rotation. Refer to Fig. 2. Thus, the condition (31) is satisfied for CORPSE.

CORP(^{2})SE (Compensation for Off Resonance with a Perpendicularly combined Pulse SEquence)

CORPSE is a (k=3) symmetric CP satisfying (phi _{1}+pi =phi _{2}) ((vec {n}_{1}cdot vec {n}_{2}=-1)). It is a natural question whether there exists a symmetric (k=3) CP with the condition (phi _{1}+pi /2=phi _{2}) ((vec {n}_{1}cdot vec {n}_{2}=0)). Under the assumption that (vec {n}_{1}cdot vec {n}_{2}=0), we find the following symmetric (k=3) CP that implements ((theta )_{phi }):

where (alpha =cos (theta /2)). We named this sequence CORP(^{2})SE (Compensation for Off Resonance with a Perpendicularly constructed Pulse SEquence). CORPSE has the same rotation axis for all elementary operations whereas CORP(^{2})SE has one orthogonal rotation axis at the middle operation. In Materials, we evaluate the performance of CORP(^{2})SE comparing with CORPSE.

Errorless trajectories by CORP(^{2})SE. The left, middle, and right panels show (vec {n}_{-pi /4}), (vec {n}_{pi /4}), and (vec {z}) as the initial state. The initial (final) states are represented by the blue (red) points. The blue, green, and red lines represent the first, second, and third pulse trajectories, respectively. The black arrows show the action of pulses when the state remains at a fixed point of the pulse.

Full size image

We consider the case in which CORP(^{2})SE (34) performs ((pi )_{0}). The parameters are taken to be (theta _{1}=theta _{3}=frac{3 pi }{2}), (theta _{2}=pi /2), (phi _{1}=phi _{3}=-frac{3pi }{4}), and (phi _{2}=-frac{pi }{4}). In Fig. 3, we show the errorless trajectories from (vec {z}), (vec {n}_{-pi /4}=frac{1}{sqrt{2}}(1,-1,0)), and (vec {n}_{pi /4}=frac{1}{sqrt{2}}(1,1,0)), which are convenient to evaluate the mass centres of trajectories. Each trajectory has the same length on the northern and southern hemispheres. For instance, the trajectory from (vec {z}) (right panel) has a length of (3times pi /2) for each hemisphere. As trajectories from all three initial states are always on great circles, or equivalently the rotation radius is always 1, the length is simply translated to the mass. That is, the northern and southern parts of the trajectory has the same mass. Also, one can graphically find that the mass centres of the northern and southern part have the same absolute value of the z component for all cases. These two facts implies that the mass centre of the trajectory is directed onto the xy plane for all initial states. Thus, for (pi)-rotation, we graphically confirm that this CORP(^{2})SE is ORE robust.

Performance comparison between CORPSE and CORP(^{2})SE

We evaluate the performance of CORP(^{2})SE and compare it with that of CORPSE. Figure 4 (a) shows the trajectories targeting the ((pi )_{0}) operation by them with ORE from the initial state (vec {z}). We can observe that both CPs compensate ORE, compared with the elementary ((pi )_{0}) operation.

The performance of the ORE robust CPs. In (a), the trajectories with ORE for two CPs targeting the ((pi )_{0}) operation are drawn. The red, green, and blue lines represent the elementary (pi) operation, CORPSE, and CORP(^{2})SE, respectively. The ORE rate is set to be (f=0.1). The initial state is (vec {z}). In (b), we plot the accuracy of these operations defined by the great-circular distance as a function of the ORE rate f. The colours of the curves represent the same operations as those in (a).

Full size image

To examine the performance of the CPs more precisely, we consider the great-circular distance on the Bloch sphere. For the ((pi )_{0}) operation on the state corresponding to (vec {z}) (north pole), the ideal operation maps the initial state (vec {z}) to (-vec {z}). The great-circular distance between (-vec {z}) and the end point of the operation with ORE from (vec {z}) has a positive value as a function of f. We characterise the accuracy of the (pi) rotation using the great-circular distance from (-vec {z}). The smaller the distance, the better the accuracy. Figure 4 (b) plots the great-circular distance between (-vec {z}) and the end point of the elementary (pi) operation, CORPSE, and CORP(^{2})SE initiated from (vec {z}). While the absolute value of the error rate f increases, the distance increases for any case, and the accuracy of the (pi) operation decreases. The distance for CORPSE and CORP(^{2})SE behaves as (propto f^{2}) around (f=0), whereas the distance for the elementary (pi) operation behaves as (propto |f|). These behaviours are due to the definition of the ORE robustness. CORP(^{2})SE provides slightly worse accuracy than CORPSE in the entire region of f, and the total CORP(^{2})SE operation (non-dimensionalised) time is longer than that of CORPSE: (7 pi /3) for CORPSE and (7 pi /2) for CORP(^{2})SE.

1. Bennett, C. H. & DiVincenzo, D. P. Quantum information and computation. Nature 404, 247–255 (2000).

   Article 
   ADS 
   CAS 

   Google Scholar 

2. Nielsen, M. & Chuang, I. Quantum Computation and Quantum Information. Cambridge Series on Information and the Natural Sciences (Cambridge University Press, 2000). https://books.google.co.jp/books?id=aai-P4V9GJ8C.

3. Nakahara, M. Quantum Computing: From Linear Algebra to Physical Realizations (CRC Press, 2008).

   Book 

   Google Scholar 

4. Helstrom, C. W. Quantum Detection and Estimation Theory Vol. 84 (Academic Press, 1976).

   MATH 

   Google Scholar 

5. Caves, C. M. Quantum-mechanical noise in an interferometer. Phys. Rev. D 23, 1693 (1981).

   Article 
   ADS 

   Google Scholar 

6. Holevo, A. S. Probabilistic and Statistical Aspects of Quantum Theory Vol. 1 (Springer, 2011).

   Book 

   Google Scholar 

7. Counsell, C., Levitt, M. & Ernst, R. Analytical theory of composite pulses. J. Magn. Reson. 1969(63), 133–141 (1985).

   ADS 

   Google Scholar 

8. Levitt, M. H. Composite pulses. Prog. Nucl. Magn. Reson. Spectrosc. 18, 61–122 (1986).

   Article 
   ADS 
   CAS 

   Google Scholar 

9. Claridge, T. D. High-Resolution NMR Techniques in Organic Chemistry Vol. 27 (Elsevier, 2016).

   Google Scholar 

10. Gershenfeld, N. A. & Chuang, I. L. Bulk spin-resonance quantum computation. Science 275, 350–356 (1997).

    Article 
    MathSciNet 
    CAS 

    Google Scholar 

11. Cory, D. G., Fahmy, A. F. & Havel, T. F. Ensemble quantum computing by nmr spectroscopy. Proc. Natl. Acad. Sci. 94, 1634–1639 (1997).

    Article 
    ADS 
    CAS 

    Google Scholar 

12. Vandersypen, L. M. et al. Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance. Nature 414, 883–887 (2001).

    Article 
    ADS 
    CAS 

    Google Scholar 

13. Bando, M. et al. Concatenated composite pulses applied to liquid-state nuclear magnetic resonance spectroscopy. Sci. Rep. 10, 1–10 (2020).

    Article 

    Google Scholar 

14. Gulde, S. et al. Implementation of the deutsch-jozsa algorithm on an ion-trap quantum computer. Nature 421, 48–50 (2003).

    Article 
    ADS 
    CAS 

    Google Scholar 

15. Collin, E. et al. Nmr-like control of a quantum bit superconducting circuit. Phys. Rev. Lett. 93, 157005 (2004).

    Article 
    ADS 
    CAS 

    Google Scholar 

16. Wimperis, S. Broadband, narrowband, and passband composite pulses for use in advanced NMR experiments. J. Magn. Reson. Ser. A 109, 221–231 (1994).

    Article 
    ADS 
    CAS 

    Google Scholar 

17. Cummins, H. K., Llewellyn, G. & Jones, J. A. Tackling systematic errors in quantum logic gates with composite rotations. Phys. Rev. A 67, 042308 (2003).

    Article 
    ADS 

    Google Scholar 

18. Brown, K. R., Harrow, A. W. & Chuang, I. L. Arbitrarily accurate composite pulse sequences. Phys. Rev. A 70, 052318 (2004).

    Article 
    ADS 

    Google Scholar 

19. Torosov, B. T. & Vitanov, N. V. Smooth composite pulses for high-fidelity quantum information processing. Phys. Rev. A 83, 053420. https://doi.org/10.1103/PhysRevA.83.053420 (2011).

    Article 
    ADS 
    CAS 

    Google Scholar 

20. Torosov, B. T., Guérin, S. & Vitanov, N. V. High-fidelity adiabatic passage by composite sequences of chirped pulses. Phys. Rev. Lett. 106, 233001. https://doi.org/10.1103/PhysRevLett.106.233001 (2011).

    Article 
    ADS 
    CAS 
    PubMed 

    Google Scholar 

21. Jones, J. A. Designing short robust not gates for quantum computation. Phys. Rev. A 87, 052317 (2013).

    Article 
    ADS 

    Google Scholar 

22. Genov, G. T., Schraft, D., Halfmann, T. & Vitanov, N. V. Correction of arbitrary field errors in population inversion of quantum systems by universal composite pulses. Phys. Rev. Lett. 113, 043001. https://doi.org/10.1103/PhysRevLett.113.043001 (2014).

    Article 
    ADS 
    CAS 
    PubMed 

    Google Scholar 

23. Kyoseva, E., Greener, H. & Suchowski, H. Detuning-modulated composite pulses for high-fidelity robust quantum control. Phys. Rev. A 100, 032333. https://doi.org/10.1103/PhysRevA.100.032333 (2019).

    Article 
    ADS 
    CAS 

    Google Scholar 

24. Cummins, H. & Jones, J. Use of composite rotations to correct systematic errors in NMR quantum computation. New J. Phys. 2, 6 (2000).

    Article 
    ADS 

    Google Scholar 

25. Möttönen, M., de Sousa, R., Zhang, J. & Whaley, K. B. High-fidelity one-qubit operations under random telegraph noise. Phys. Rev. A 73, 022332 (2006).

    Article 
    ADS 

    Google Scholar 

26. Said, R. & Twamley, J. Robust control of entanglement in a nitrogen-vacancy center coupled to a c 13 nuclear spin in diamond. Phys. Rev. A 80, 032303 (2009).

    Article 
    ADS 

    Google Scholar 

27. Timoney, N. et al. Error-resistant single-qubit gates with trapped ions. Phys. Rev. A 77, 052334 (2008).

    Article 
    ADS 

    Google Scholar 

28. Bando, M., Ichikawa, T., Kondo, Y. & Nakahara, M. Concatenated composite pulses compensating simultaneous systematic errors. J. Phys. Soc. Jpn. 82, 014004 (2012).

    Article 
    ADS 

    Google Scholar 

29. Kondo, Y. & Bando, M. Geometric quantum gates, composite pulses, and Trotter–Suzuki formulas. J. Phys. Soc. Jpn. 80, 054002 (2011).

    Article 
    ADS 

    Google Scholar 

30. Merrill, J. T. & Brown, K. R. Progress in compensating pulse sequences for quantum computation. Quantum Inf. Comput. Chem. 20, 241–294 (2014).

    MATH 

    Google Scholar 

31. Zanardi, P. & Rasetti, M. Holonomic quantum computation. Phys. Lett. A 264, 94–99 (1999).

    Article 
    ADS 
    MathSciNet 
    CAS 

    Google Scholar 

32. Zhu, S.-L. & Wang, Z. Implementation of universal quantum gates based on nonadiabatic geometric phases. Phys. Rev. Lett. 89, 097902 (2002).

    Article 
    ADS 

    Google Scholar 

33. Ota, Y. & Kondo, Y. Composite pulses in NMR as nonadiabatic geometric quantum gates. Phys. Rev. A 80, 024302 (2009).

    Article 
    ADS 

    Google Scholar 

34. Berry, M. V. Quantal phase factors accompanying adiabatic changes. Proc. R. Soc. Lond. A Math. Phys. Sci. 392, 45–57 (1984).

    ADS 
    MathSciNet 
    MATH 

    Google Scholar 

35. Page, D. N. Geometrical description of berry’s phase. Phys. Rev. A 36, 3479 (1987).

    Article 
    ADS 
    MathSciNet 
    CAS 

    Google Scholar 

36. Aharonov, Y. & Anandan, J. Phase change during a cyclic quantum evolution. Phys. Rev. Lett. 58, 1593 (1987).

    Article 
    ADS 
    MathSciNet 
    CAS 

    Google Scholar 

37. Nakahara, M. Geometry, Topology and Physics (CRC Press, 2018).

    Book 

    Google Scholar 

Download references

Authors and Affiliations

1. Department of Physics, Kindai University, Higashi, Osaka, 577-8502, Japan

   Shingo Kukita, Haruki Kiya & Yasushi Kondo

Contributions

All the authors contributed equally to this work.

Corresponding author

Correspondence to
Shingo Kukita.

Competing interests

The authors declare no competing interests.

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions