Most attempts to produce a scalable quantum information processing platform based on ion traps have focused on the shuttling of ions in segmented traps. We show that an architecture based on an array of microtraps with fast gates will outperform architectures based on ion shuttling. This system requires higher power lasers but does not require the manipulation of potentials or shuttling of ions. This improves optical access, reduces the complexity of the trap, and reduces the number of conductive surfaces close to the ions. The use of fast gates also removes limitations on the gate time. Error rates of 10^{-5} are shown to be possible with 250 mW laser power and a trap separation of 100 μm. The performance of the gates is shown to be robust to the limitations in the laser repetition rate and the presence of many ions in the trap array.
Most attempts to produce a scalable quantum information processing platform based on ion traps have focused on the shuttling of ions in segmented traps. We show that an architecture based on an array of microtraps with fast gates will outperform architectures based on ion shuttling. This system requires higher power lasers but does not require the manipulation of potentials or shuttling of ions. This improves optical access, reduces the complexity of the trap, and reduces the number of conductive surfaces close to the ions. The use of fast gates also removes limitations on the gate time. Error rates of 10^{-5} are shown to be possible with 250 mW laser power and a trap separation of 100 μm. The performance of the gates is shown to be robust to the limitations in the laser repetition rate and the presence of many ions in the trap array.
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.
Realising large-scale quantum computation in the near future will require increasing the number of low-error two-qubit gates that can be implemented on a quantum computer before decoherence. One of the biggest challenges facing current trapped ion quantum computers is implementing high-speed two-qubit operations, whilst increasing the number of qubits. One of the most promising proposals for overcoming current limitations is the use of ultra-fast pulses to implement fast two-qubit gates between nearest-neighbour pairs of ions. In this thesis, I investigate these ‘fast gates’ in two-dimensional arrays of microtraps, each containing a single ion. I argue that two-dimensional architectures allow for a significant reduction in the number of two-qubit gates required for a particular computation, as compared to one-dimensional ion chains. I demonstrate this reduction for a quantum simulation of a 40-mode Fermi-Hubbard Hamiltonian. I develop an efficient scheme that allows fast gates to be numerically optimised for two-dimensional geometries. I find that this optimisation scheme is capable of designing gates that are faster, higher fidelity, and require lower laser repetition rates. Using this scheme, I find that high-speed two-qubit gates can be optimised for two-dimensional architectures, with fidelities well above thresholds required for fault tolerant error correction, around 99.99%. Furthermore, I find that fast gates in these architectures are robust to the presence of large numbers of surrounding ions. Following previous studies [1, 2] which have identified pulse imperfections as a dominant source of error in fast gates, I perform a worst-case error analysis. I find the fast gates presented in this thesis to require very small errors in single-qubit rotations, and I present recommendations for achieving those requirements. I also investigate other experimental considerations, and make recommendations for overcoming other technical challenges in realising fast gates.
We present an efficient approach to optimizing pulse sequences for implementing fast entangling two-qubit gates on trapped ion quantum information processors. We employ a two-phase procedure for optimizing gate fidelity, which we demonstrate for multi-ion systems in linear Paul trap and microtrap architectures. The first phase involves a global optimization over a computationally inexpensive cost function constructed under strong approximations of the gate dynamics. The second phase involves local optimizations that utilize a more precise ordinary differential equation description of the gate dynamics, which captures the nonlinearity of the Coulomb interaction and the effects of finite laser repetition rate. We propose two gate schemes that are compatible with this approach, and we demonstrate that they outperform existing schemes in terms of achievable gate speed and fidelity for feasible laser repetition rates. In optimizing sub-microsecond gates in microtrap architectures, the proposed schemes achieve orders-of-magnitude-higher fidelities than previous proposals. Finally, we investigate the impact of pulse imperfections on gate fidelity and evaluate error bounds for a range of gate speeds.
Abstract 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 π -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.
With all the key elements of quantum computing in ion traps demonstrated by the research community, the focus is now placed on building more sophisticated traps with larger numbers of ions to allow practical scale information processing. One promising avenue is to store ions in and shuttle them between many independent traps which serve as potential interaction sites. The core of the work described in this thesis is the experimental evaluation of a microfabricated segmented ion trap, built by Sandia National Laboratories ("Sandia trap"). These experiments required construction of a wholly new optical setup including laser and detection systems, a vacuum system and control electronics. Among our experimental achievements were: successful loading of single and pairs of ions in the microscale trap, measurement of ion storage lifetime, measurement of the motional heating rate with a time-resolved Doppler-cooling method — which showed above than average heating, and implemented a single-ion shuttling method — which reliably transferred the ion through a distance of 360 μm (two DC electrode widths away) and back. These results have been used to improve the next version of the Sandia trap design. We also used computer modelling to study several aspects of ion traps: a mesoscopic ion trap designed for fast ion separation, simulated ion loading to quantify requirements for successful trapping in small and shallow traps, and analyzed a precise shuttling method — where the time dependence of the trapping potential is engineered such that there is minimal motional heating. The results show that ion trap arrays at the 100 μm distance scale are feasible and suggests that such multiple trap designs merit further study.
We propose the use of two-dimensional Penning trap arrays as a scalable platform for quantum simulation and quantum computing with trapped atomic ions.This approach involves placing arrays of microstructured electrodes defining static electric quadrupole sites in a magnetic field, with single ions trapped at each site and coupled to neighbors via the Coulomb interaction.We solve for the normal modes of ion motion in such arrays and derive a generalized multi-ion invariance theorem for stable motion even in the presence of trap imperfections.We use these techniques to investigate the feasibility of quantum simulation and quantum computation in fixed ion lattices.In homogeneous arrays, we show that sufficiently dense arrays are achievable, with axial, magnetron, and cyclotron motions exhibiting interion dipolar coupling with rates significantly higher than expected decoherence.With the addition of laser fields, these can realize tunable-range interacting spin Hamiltonians.We also show how local control of potentials allows isolation of small numbers of ions in a fixed array and can be used to implement highfidelity gates.The use of static trapping fields means that our approach is not limited by power requirements as the system size increases, removing a major challenge for scaling which is present in standard radio-frequency traps.Thus, the architecture and methods provided here appear to open a path for trapped-ion quantum computing to reach fault-tolerant scale devices.