R L Taylor

Fast entangling gates have been proposed for trapped ions that are orders of magnitude faster than current implementations. We present here a detailed analysis of the challenges involved in performing a successful fast gate. We show that the RWA is a stable approximation with respect to pulse numbers: the timescale on which we can neglect terms rotating at the atomic frequency is negligibly affected by the number of pulses in the fast gate. In contrast, we show that the laser pulse instability does give rise to a pulse-number dependent effect; the fast gate infidelity is compounded with the number of applied imperfect pulses. Using a dimensional reduction method presented here, we find bounds on the pulse stability required to achieve two-qubit gate fidelity thresholds.

Large-scale digital quantum simulations require thousands of fundamental entangling gates to construct the simulated dynamics. Despite success in a variety of small-scale simulations, quantum information processing platforms have hitherto failed to demonstrate the combination of precise control and scalability required to systematically outmatch classical simulators. We analyse how fast gates could enable trapped-ion quantum processors to achieve the requisite scalability to outperform classical computers without error correction. We analyze the performance of a large-scale digital simulator, and find that fidelity of around 70% is realizable for pi-pulse infidelities below $10^{-5}$ in traps subject to realistic rates of heating and dephasing. This scalability relies on fast gates: entangling gates faster than the trap period.