Fast design and scaling of multi-qubit gates in large-scale trapped-ion quantum computers
Quantum computers based on crystals of electrically trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which come about as an ability to naturally realize large-scale multi-qubit entanglement gates. However, sca...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2023-07 |
---|---|
Hauptverfasser: | , , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Quantum computers based on crystals of electrically trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which come about as an ability to naturally realize large-scale multi-qubit entanglement gates. However, scaling up the number of qubits in these systems, while retaining high-fidelity and high-speed operations is challenging. Specifically, designing multi-qubit entanglement gates in long ion crystals of 100s of ions involves an NP-hard optimization problem, rendering scaling up the number of qubits a conceptual challenge as well. Here we introduce a method that vastly reduces the computational challenge, effectively allowing for a polynomial-time design of fast and programmable entanglement gates, acting on the entire ion crystal. We use this method to investigate the utility, scaling and requirements of such multi-qubit gates. Our method delineates a path towards scaling up quantum computers based on ion-crystals with 100s of qubits. |
---|---|
ISSN: | 2331-8422 |