Scalable quantum computation with fast gates in two-dimensional microtrap arrays of trapped ions

Abstract

We theoretically investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture. In one dimension, such fast gates are optimal when employed between nearest neighbours, and we examine the generalisation to a two-dimensional geometry. We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighbouring traps faster than the trapping period, with experimentally demonstrated laser repetition rates. Notably, we find that without increasing the gate duration, high-fidelity gates are achievable even in large arrays with hundreds of ions. To demonstrate the usefulness of this proposal, we investigate the application of these gates to the digital simulation of a 40-mode Fermi-Hubbard model. This also demonstrates why shorter chains of gates required to connect arbitrary pairs of ions makes this geometry well suited for large-scale computation.

References in corpus (9)

• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• Fast and robust two-qubit gates for scalable ion trap quantum computing
• Subsystem fault tolerance with the Bacon-Shor code
• Ultrafast Gates for Single Atomic Qubits
• Demonstration of two-atom entanglement with ultrafast optical pulses
• Dynamics and control of fast ion crystal splitting in segmented Paul traps
• Fast gates for ion traps by splitting laser pulses
• Ultrafast coherent excitation of a Ca${}^{+}$ ion
• Ultrafast, high repetition rate, ultraviolet, fiber based laser source: application towards Yb+ fast quantum-logic