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

• URL: http://arxiv.org/abs/2108.01054v1
• Date: Mon, 2 Aug 2021 17:19:59 GMT
• Title: Shuttle-Exploiting Attacks and Their Defenses in Trapped-Ion Quantum Computers
• Authors: Abdullah Ash Saki, Rasit Onur Topaloglu, Swaroop Ghosh
• Abstract summary: This paper presents one such vulnerability in shared TI systems that require shuttle operations for communication among traps. 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 2X to 63X.
• Score: 5.510992382274774
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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 2X to 63X. Finally, we present several countermeasures such as adopting a hybrid initial mapping policy, padding victim programs with dummy qubits, and capping maximum shuttles.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Stealthy SWAPs: Adversarial SWAP Injection in Multi-Tenant Quantum Computing [2.77390041716769]
  Multi-tenant computing (MTC) has emerged as a potential solution for efficient hardware utilization. This paper proposes one such threat for MTC in superconducting quantum hardware i.e., adversarial SWAP gate injection in victims program during compilation for MTC. We report a max of approximately 55 percent and a median increase of approximately 25 percent in SWAP overhead.
  arXiv  Detail & Related papers  (2023-10-26T14:31:21Z)
• A Primer on Security of Quantum Computing [5.510992382274774]
  Quantum computing can potentially transform several application areas by solving intractable problems from classical domain. Quantum computing stack may contain sensitive Intellectual Properties (IP) that requires protection. Quantum computers suffer from crosstalk that couples two programs in a multi-tenant setting to facilitate traditionally known fault injection attacks.
  arXiv  Detail & Related papers  (2023-05-04T02:30:27Z)
• InQuIR: Intermediate Representation for Interconnected Quantum Computers [0.0]
  InQuIR is a representation that can express communication and computation on distributed quantum systems. We give examples written in InQuIR to illustrate the problems arising in distributed programs, such as deadlock. We also provide software tools for InQuIR and evaluate the computational costs of quantum circuits.
  arXiv  Detail & Related papers  (2023-02-01T06:19:23Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• A Shuttle-Efficient Qubit Mapper for Trapped-Ion Quantum Computers [4.903455321543022]
  We propose a new policy for quantum computer programs with considerable depth and high number of qubits. Our policy is program adaptive and prioritizes the gates re-occurring at the initial stages of the program over late occurring gates. Our technique achieves an average reduction of 9% shuttles/program (with 21.3% at best) for 120 random circuits.
  arXiv  Detail & Related papers  (2022-04-07T18:57:57Z)
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds [0.0]
  Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks. We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
  arXiv  Detail & Related papers  (2021-02-25T15:58:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.