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

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 neighbors, and we examine the generalization to a two-dimensional geometry. We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighboring 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 make this geometry well suited for large-scale computation.