دسته بندی:

محاسبات کوانتومی - Quantum-Computing

---

سال انتشار:

2022

---

عنوان انگلیسی مقاله:

Shuttle-Exploiting Attacks and Their Defenses in Trapped-Ion Quantum Computers

---

ترجمه فارسی عنوان مقاله:

حملات بهره برداری شاتل و دفاع آنها در کامپیوترهای کوانتومی یونی به دام افتاده

---

منبع:

ieee - ieee Access;2022;10; ;10:1109/ACCESS:2021:3139085

---

نویسنده:

ABDULLAH ASH SAKI 1, (Graduate Student Member, IEEE), RASIT ONUR TOPALOGLU2, (Senior Member, IEEE), AND SWAROOP GHOSH 1, (Senior Member, IEEE)

---

چکیده انگلیسی:

Trapped-ion (TI) quantum bits are a front-runner technology for quantum computing. TI systems with multiple interconnected traps can overcome the hardware connectivity issue inherent in superconducting qubits and can solve practical problems at scale. With a sufficient number of qubits on the horizon, the multi-programming model for Quantum Computers (QC) has been proposed where multiple users share the same QC for their computing. Multi-programming is enticing for quantum cloud providers as it can maximize device utilization, throughput, and profit for clouds. Users can also benefit from the short wait queue. However, shared access to quantum computers can create new security issues. This paper presents one such vulnerability in shared TI systems that require shuttle operations for communication among traps. Repeated shuttle operations increase quantum bit energy and degrade the reliability of computations (fidelity). We show adversarial program design approaches requiring numerous shuttles. We propose a random and systematic methodology for adversary program generation. Our analysis shows shuttle-exploiting attacks can substantially degrade the fidelities of victim programs by ≈2× to ≈63×. Finally, we present several countermeasures such as adopting a hybrid initial mapping policy, padding victim programs with dummy qubits, and capping maximum shuttles.
INDEX TERMS: Trapped-ion | qubit | quantum computing | shuttle | security | fidelity.

---

---

قیمت: رایگان

---

توضیحات اضافی:

---

---

---