Securing HHL Quantum Algorithm against Quantum Computer Attacks

• URL: http://arxiv.org/abs/2410.08010v2
• Date: Mon, 14 Apr 2025 22:51:15 GMT
• Title: Securing HHL Quantum Algorithm against Quantum Computer Attacks
• Authors: Yizhuo Tan, Hrvoje Kukina, Jakub Szefer,
• Abstract summary: This work focuses on securing the HHL quantum algorithm against attacks while it executes on a quantum computer.<n>To protect the HHL algorithm from IIA and HEA, this work proposes first-of-a-kind defense strategies.<n>The circuits have been tested and validated in both simulation, and also on real IBM quantum computer hardware.
• Score: 9.21246966564845
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As the quantum research community expands and new quantum algorithms are created and implemented, it is essential to consider the security implications and potential threats that could lead to the compromise the information processed by them. This work focuses on securing the HHL quantum algorithm against attacks while it executes on a quantum computer. Specifically, two types of potential attacks could be deployed on a cloud-based quantum computer by an attacker circuit attempting to interfere with the victim HHL circuit: the Improper Initialization Attack (IIA) and the Higher Energy Attack (HEA). To protect the HHL algorithm from IIA and HEA, this work proposes first-of-a-kind defense strategies against these attacks on the HHL quantum algorithm. Next, this work demonstrates an implementation of a new quantum circuit for the HHL quantum algorithm that incorporates these defenses. The redesigned quantum circuit is necessary to successfully apply and realize all proposed defense strategies. Finally, this work illustrates how these defense strategies function in practice in the redesigned circuit, specifically how they can protect the HHL quantum algorithm from both IIA and HEA across multiple qubits involving all three types of qubits used in the HHL algorithms: ancilla, clock, and b. The defense requires minimal modification to the circuit, and has only a very small effect on the fidelity of the circuits. The circuits have been tested and validated in both simulation, and also on real IBM quantum computer hardware. The work further analyzes how the modified HHL circuit with the defenses is affected by noise during quantum computation. This work in the end demonstrates that it is practical to add protections to quantum circuits so that they not only perform correct computation, but also self-detect if an attack has occured during the execution.

Related papers

• TetrisLock: Quantum Circuit Split Compilation with Interlocking Patterns [7.041881854531399]
  In quantum computing, quantum circuits are fundamental representations of quantum algorithms. In this paper, we propose TetrisLock, a split compilation method for quantum circuit obfuscation.
  arXiv  Detail & Related papers  (2025-03-15T03:41:24Z)
• SWAP Attack: Stealthy Side-Channel Attack on Multi-Tenant Quantum Cloud System [3.4804333771236875]
  Crosstalk on shared quantum devices allows adversaries to interfere with victim circuits within a neighborhood. We show that SWAP-based side-channel attack operates in both active and passive modes, as verified on real IBM quantum devices. Our work highlights the urgent need for robust security measures to safeguard quantum computations against emerging threats.
  arXiv  Detail & Related papers  (2025-02-14T12:25:08Z)
• E-LoQ: Enhanced Locking for Quantum Circuit IP Protection [7.692750040732365]
  We propose an enhanced locking technique for quantum circuits (E-LoQ) Compared to previous work that used one qubit for each key bit, our approach achieves higher security levels. Our results demonstrate that E-LoQ effectively conceals the function of the original quantum circuit, with an average fidelity degradation of less than 1%.
  arXiv  Detail & Related papers  (2024-12-22T17:29:24Z)
• Defending crosstalk-mediated quantum attacks using dynamical decoupling [0.276240219662896]
  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.
  arXiv  Detail & Related papers  (2024-09-22T21:22:05Z)
• 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)
• Quantum Circuit Reconstruction from Power Side-Channel Attacks on Quantum Computer Controllers [11.148634764855407]
  A novel type of threat to quantum circuits that dedicated attackers could launch are power trace attacks. This paper presents first formalization and demonstration of using power traces to unlock and steal quantum circuit secrets.
  arXiv  Detail & Related papers  (2024-01-29T03:56:21Z)
• Carry Your Fault: A Fault Propagation Attack on Side-Channel Protected LWE-based KEM [12.164927192334748]
  We propose a new fault attack on side-channel secure masked implementation of LWE-based key-encapsulation mechanisms. We exploit the data dependency of the adder carry chain in A2B and extract sensitive information. We show key recovery attacks of Kyber, although the leakage also exists for other schemes like Saber.
  arXiv  Detail & Related papers  (2024-01-25T11:18:43Z)
• 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)
• 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)
• Versatile Weight Attack via Flipping Limited Bits [68.45224286690932]
  We study a novel attack paradigm, which modifies model parameters in the deployment stage. Considering the effectiveness and stealthiness goals, we provide a general formulation to perform the bit-flip based weight attack. We present two cases of the general formulation with different malicious purposes, i.e., single sample attack (SSA) and triggered samples attack (TSA)
  arXiv  Detail & Related papers  (2022-07-25T03:24:58Z)
• Quantum clustering and jet reconstruction at the LHC [0.0]
  Jet clustering at the CERN's Large Hadron Collider is computationally expensive. We consider two novel quantum algorithms which may speed up the classical jet clustering algorithms.
  arXiv  Detail & Related papers  (2022-04-13T16:27:04Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Online Adversarial Attacks [57.448101834579624]
  We formalize the online adversarial attack problem, emphasizing two key elements found in real-world use-cases. We first rigorously analyze a deterministic variant of the online threat model. We then propose algoname, a simple yet practical algorithm yielding a provably better competitive ratio for $k=2$ over the current best single threshold algorithm.
  arXiv  Detail & Related papers  (2021-03-02T20:36:04Z)
• Attack Agnostic Adversarial Defense via Visual Imperceptible Bound [70.72413095698961]
  This research aims to design a defense model that is robust within a certain bound against both seen and unseen adversarial attacks. The proposed defense model is evaluated on the MNIST, CIFAR-10, and Tiny ImageNet databases. The proposed algorithm is attack agnostic, i.e. it does not require any knowledge of the attack algorithm.
  arXiv  Detail & Related papers  (2020-10-25T23:14:26Z)
• MixNet for Generalized Face Presentation Attack Detection [63.35297510471997]
  We have proposed a deep learning-based network termed as textitMixNet to detect presentation attacks. The proposed algorithm utilizes state-of-the-art convolutional neural network architectures and learns the feature mapping for each attack category.
  arXiv  Detail & Related papers  (2020-10-25T23:01:13Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• A black-box adversarial attack for poisoning clustering [78.19784577498031]
  We propose a black-box adversarial attack for crafting adversarial samples to test the robustness of clustering algorithms. We show that our attacks are transferable even against supervised algorithms such as SVMs, random forests, and neural networks.
  arXiv  Detail & Related papers  (2020-09-09T18:19:31Z)

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.