Fast design and scaling of multi-qubit gates in large-scale trapped-ion quantum computers
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914273707425792 |
|---|---|
| author | Peleg, Lee Schwerdt, David Nemirovsky, Jonathan Shapira, Yotam Akerman, Nitzan Stern, Ady Kish, Amit Ben Ozeri, Roee |
| author_facet | Peleg, Lee Schwerdt, David Nemirovsky, Jonathan Shapira, Yotam Akerman, Nitzan Stern, Ady Kish, Amit Ben Ozeri, Roee |
| contents | Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, $N$, in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as $N^2$, the gate duration scales as $N$, leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path towards scaling up quantum computers based on ion-crystals with hundreds of qubits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_09566 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Fast design and scaling of multi-qubit gates in large-scale trapped-ion quantum computers Peleg, Lee Schwerdt, David Nemirovsky, Jonathan Shapira, Yotam Akerman, Nitzan Stern, Ady Kish, Amit Ben Ozeri, Roee Quantum Physics Quantum computers based on crystals of trapped ions are a prominent technology for quantum computation. A unique feature of trapped ions is their long-range Coulomb interactions, which can be exploited to realize large-scale multiqubit entanglement gates. However, scaling up the number of qubits, $N$, in these systems, while retaining high-fidelity and high-speed operations, is challenging. Specifically, designing multiqubit entanglement gates in long ion crystals of hundreds of ions involves an NP-hard optimization problem, rendering scale-up not only a technological challenge, but also a conceptual challenge. Here we introduce a method that mitigates this challenge, effectively allowing for a polynomial-time design of fast, robust, and programmable entanglement gates, acting on the entire ion-crystal. We show that while the number of simultaneous entanglement operations scales as $N^2$, the gate duration scales as $N$, leading to a scaling advantage. We use our methods to investigate the drive-power requirements and susceptibility to noise and errors of these multiqubit gates. Our method delineates a path towards scaling up quantum computers based on ion-crystals with hundreds of qubits. |
| title | Fast design and scaling of multi-qubit gates in large-scale trapped-ion quantum computers |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2307.09566 |