E-LoQ: Enhanced Locking for Quantum Circuit IP Protection

• URL: http://arxiv.org/abs/2412.17101v2
• Date: Fri, 03 Jan 2025 00:37:29 GMT
• Title: E-LoQ: Enhanced Locking for Quantum Circuit IP Protection
• Authors: Yuntao Liu, Jayden John, Qian Wang,
• Abstract summary: 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%.
• Score: 7.692750040732365
• License:
• Abstract: In recent years, quantum computing has started to demonstrate superior efficiency to classical computing. In quantum computing, quantum circuits that implement specific quantum algorithms are usually not directly executable on quantum computer hardware. Quantum circuit compilers decompose high-level quantum gates into the hardware's native gates and optimize the circuits for accuracy and performance. However, untrusted quantum compilers risk stealing original quantum designs (quantum circuits), leading to the theft of sensitive intellectual property (IP). In classical computing, logic locking is a family of techniques to secure integrated circuit (ICs) designs against reverse engineering and IP piracy. This technique involves inserting a keyed value into the circuit, ensuring the correct output is achieved only with the correct key. To address similar issues in quantum circuit protection, we propose an enhanced locking technique for quantum circuits (E-LoQ) where multiple key bits can be condensed into one key qubit. Compared to previous work that used one qubit for each key bit, our approach achieves higher security levels. We have demonstrated the practicality of our method through experiments on a set of benchmark quantum circuits. The effectiveness of E-LoQ was measured by assessing the divergence distance from the original circuit. Our results demonstrate that E-LoQ effectively conceals the function of the original quantum circuit, with an average fidelity degradation of less than 1%.

Related papers

• Quantum Trojan Insertion: Controlled Activation for Covert Circuit Manipulation [6.354800179065428]
  Quantum circuits are essential for implementing functions and achieving correct computational outcomes. Hackers can introduce malicious hardware Trojans into quantum circuits, altering their functionality and leading to incorrect results. We propose a novel advanced quantum Trojan that is controllable, allowing it to be activated or deactivated under different circumstances.
  arXiv  Detail & Related papers  (2025-02-13T01:39:20Z)
• Quantum Indistinguishable Obfuscation via Quantum Circuit Equivalence [6.769315201275599]
  Quantum computing solutions are increasingly deployed in commercial environments through delegated computing. One of the most critical issues is to guarantee the confidentiality and proprietary of quantum implementations. Since the proposal of general-purpose indistinguishability obfuscation (iO) and functional encryption schemes, iO has emerged as a seemingly versatile cryptography primitive.
  arXiv  Detail & Related papers  (2024-11-19T07:37:24Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• 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)
• Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer [1.2019888796331233]
  We introduce a new circuit called AQCEL, which aims to remove redundant controlled operations from controlled gates. As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics. We have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates.
  arXiv  Detail & Related papers  (2022-09-06T09:19:07Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• An Optimized Quantum Implementation of ISD on Scalable Quantum Resources [2.274915755738124]
  We show that Prange's ISD algorithm can be implemented rather efficiently on a quantum computer. We leverage the idea of classical co-processors to design hybrid classical-quantum trade-offs.
  arXiv  Detail & Related papers  (2021-12-12T06:01:10Z)
• 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)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Forging quantum data: classically defeating an IQP-based quantum test [0.0]
  We describe a classical algorithm that can convince the verifier that the (classical) prover is quantum. We show that the key extraction algorithm is efficient in practice for problem sizes of hundreds of qubits.
  arXiv  Detail & Related papers  (2019-12-11T19:00:00Z)

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.