.png){kind=icon}
Return
Full programmable quantum computing with trapped-ions using semi-global fields
.png){kind=icon}
PRE
AI
DOI：10.1088/2058-9565/ae573c.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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ølmer–Sø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 multi-qubit gates, with N being the number of ions. In addition, we show that by using B < N independent semi-global fields, each driving a set of ions, the number of maximal multi-qubit gates is reduced to approximately . 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:
trapped-ion quantum computing
multi-qubit gates
semi-global fields
Ising-type interactions
quantum algorithm implementation
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
N
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more