Quantum computers have made extraordinary progress over the past decade, and
significant milestones have been achieved along the path of pursuing universal fault-tolerant …

Quantum algorithms offer significant speed-ups over their classical counterparts for a variety
of problems. The strongest arguments for this advantage are borne by algorithms for …

Electron spin qubits formed by atoms in silicon have large (tens of millielectronvolts) orbital
energies and weak spin–orbit coupling, giving rise to isolated electron spin ground states …

Spin qubits are considered to be among the most promising candidates for building a
quantum processor. Group IV hole spin qubits are particularly interesting owing to their ease …

Quantum computation provides great speedup over its classical counterpart for certain
problems. One of the key challenges for quantum computation is to realize precise control of …

Quantum information technologies demand highly accurate control over quantum systems.
Achieving this requires control techniques that perform well despite the presence of …

Electron spins in silicon have long coherence times and are a promising qubit platform.
However, electric field noise in semiconductors poses a challenge for most single-and …

Nonadiabatic holonomic quantum computation (NHQC) has been developed to shorten the
construction times of geometric quantum gates. However, previous NHQC gates require the …

Considering the problem of the control of a two-state quantum system by an external field,
we establish a general and versatile method allowing the derivation of smooth pulses which …

We present a comprehensive theoretical treatment of supcode, a method for generating
dynamically corrected quantum gate operations, which are immune to random noise in the …