English

Full programmable quantum computing with trapped-ions using semi-global fields

Quantum Physics 2025-09-19 v1

Abstract

Trapped-ion quantum computing can utilize all motional modes of the ion-crystal, to entangle multiple qubits simultaneously, enabling universal computation with multi-qubit gates supplemented by single-qubit rotations. Using multiple tones to drive each ion individually induces Ising-type interactions, forming a multi-qubit gate, where the coupling matrix of all ion pairs is fully controllable. This reduces the total gate count while maintaining high fidelity, as opposed to traditional methods that rely on a single type of two-qubit gate, such as the well-known M{\o}lmer-S{\o}rensen gate. However, scaling to large ion chains, individual addressing can be technically challenging in terms of optical delivery and signal generation. We explore global and semi-global drives combined with single-qubit flips and show that these can reproduce the full set of multi-qubit gates. Although optimizing the combination of single-qubit flips is a computationally hard problem, we propose an efficient scheme to implement any desired couplings in large ion chains, yielding a concatenation scheme that uses at most N/2N/2 multi-qubit gates, with NN being the number of ions. In addition, we show that by using B<NB<N independent semi-global fields, each driving a set of N/BN/B ions, the number of maximal multi-qubit gates is reduced to approximately N2B2(N1)\frac{N^2}{B^2 (N-1)}. We show how to design the driving fields that support these schemes and investigate their properties. Our results pave the way for efficient implementations of quantum algorithms in large-scale trapped-ion quantum systems.

Keywords

Cite

@article{arxiv.2509.14331,
  title  = {Full programmable quantum computing with trapped-ions using semi-global fields},
  author = {Yakov Solomons and Yotam Kadish and Lee Peleg and Jonathan Nemirovsky and Amit Ben Kish and Yotam Shapira},
  journal= {arXiv preprint arXiv:2509.14331},
  year   = {2025}
}