Geometric quantum computation offers a potential route to fault-tolerant quantum information processing by exploiting the global nature of geometric phases. However, achieving controlled high-order suppression of multiple error sources remains a long-standing limitation, particularly in realistic large-scale circuits with complex noise environments. This limitation is largely due to the absence of a general framework that directly characterizes error accumulation and enables systematic improvement. Here we establish such a framework for universal doubly geometric gates by embedding target operations into a hierarchy of level-n identity constructions. This approach enables direct quantification of error accumulation while removing structural constraints inherent in previous schemes. We analytically show that the defining conditions lead to simultaneous fourth-order suppression of control errors, with a systematic extension to sixth-order suppression via higher-level constructions. Our results establish doubly geometric control as a general and scalable route toward high-order robust quantum gates, with potential implications for fault-tolerant quantum information processing.
Composite pulse sequences designed for nuclear magnetic resonance experiments are currently being applied in many quantum information processing technologies. We present an analysis of a family of composite pulse sequences used to address systematic pulse-length errors in the execution of quantum gates. It has been demonstrated by Cummins et al. [Phys. Rev. A 67, 042308 (2003)] that for this family of composite pulse sequences, the fidelity of the resulting unitary operation compared with the ideal unitary operation is $1\ensuremath{-}C{ϵ}^{6}$, where
ϵ is the fractional error in the length of the pulse. We derive an exact expression for the sixth-order coefficient
C and from this deduce conditions under which this sixth-order dependence is observed. We also present pulse sequences which achieve the same fidelity.