Defending crosstalk-mediated quantum attacks using dynamical decoupling

• URL: http://arxiv.org/abs/2409.14598v1
• Date: Sun, 22 Sep 2024 21:22:05 GMT
• Title: Defending crosstalk-mediated quantum attacks using dynamical decoupling
• Authors: Devika Mehra, Amir Kalev,
• Abstract summary: In the past few years, the field of quantum computing is reaching new heights with significant advancements in algorithm development. Companies and research labs are actively working to build fault-tolerant quantum computers.
• Score: 0.276240219662896
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the past few years, the field of quantum computing is reaching new heights with significant advancements in algorithm development. In parallel to rising research areas, companies and research labs are actively working to build fault-tolerant quantum computers which can help provide accurate and speedy results for the various experiments. The increasing demand for quantum computers necessitates the sharing of hardware to enable multi-tenancy for a broad user base. While this approach optimizes the utilization of limited quantum resources, it also introduces potential security vulnerabilities. In this paper we examine dynamical decoupling (DD) as a countermeasure to protect the legitimate circuit from such threats. We focus on crosstalk-mediated attacks on Grover's search algorithm. We find that, when compared to other countermeasures, DD successfully mitigates the attack and in some cases is able to improve the performance of the circuit beyond the level of no-attack. Thus our results emphasis the importance of incorporating DD into algorithm executions on multi-tenancy quantum hardware.

Related papers

• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• Quantum-Error-Mitigated Detectable Byzantine Agreement with Dynamical Decoupling for Distributed Quantum Computing [0.40792653193642503]
  We introduce an enhancement to the Quantum Byzantine Agreement protocol, incorporating advanced error mitigation techniques. Extensive tests on both simulated and real-world quantum devices, notably IBM's quantum computer, provide compelling evidence of the effectiveness of our T-REx and DD adaptations. Our empirical findings underscore the enhanced resilience and effectiveness of the protocol in diverse scenarios.
  arXiv  Detail & Related papers  (2023-11-06T13:39:26Z)
• Designing Hash and Encryption Engines using Quantum Computing [2.348041867134616]
  We explore quantum-based hash functions and encryption to fortify data security. The integration of quantum and classical methods demonstrates potential in securing data in the era of quantum computing.
  arXiv  Detail & Related papers  (2023-10-26T14:49:51Z)
• 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)
• 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)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Effects of Dynamical Decoupling and Pulse-level Optimizations on IBM Quantum Computers [0.0]
  Dynamical decoupling (DD) is generally used to suppress the decoherence error. pulse-level optimization can be improved by creating hardware-native pulse-efficient gates. This paper implements all the popular DD sequences and evaluates their performances on IBM quantum chips.
  arXiv  Detail & Related papers  (2022-04-04T13:37:24Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.