Randomized Reversible Gate-Based Obfuscation for Secured Compilation of Quantum Circuit

• URL: http://arxiv.org/abs/2305.01133v2
• Date: Thu, 29 Jun 2023 05:39:58 GMT
• Title: Randomized Reversible Gate-Based Obfuscation for Secured Compilation of Quantum Circuit
• Authors: Subrata Das, Swaroop Ghosh
• Abstract summary: We propose an obfuscation technique for quantum circuits using reversible gates to protect them from such attacks during compilation. Our method achieves TVD of up to 1.92 and performs at least 2X better than a previously reported obfuscation method.
• Score: 5.444459446244819
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The success of quantum circuits in providing reliable outcomes for a given problem depends on the gate count and depth in near-term noisy quantum computers. Quantum circuit compilers that decompose high-level gates to native gates of the hardware and optimize the circuit play a key role in quantum computing. However, the quality and time complexity of the optimization process can vary significantly especially for practically relevant large-scale quantum circuits. As a result, third-party (often less-trusted/untrusted) compilers have emerged, claiming to provide better and faster optimization of complex quantum circuits than so-called trusted compilers. However, untrusted compilers can pose severe security risks, such as the theft of sensitive intellectual property (IP) embedded within the quantum circuit. We propose an obfuscation technique for quantum circuits using randomized reversible gates to protect them from such attacks during compilation. The idea is to insert a small random circuit into the original circuit and send it to the untrusted compiler. Since the circuit function is corrupted, the adversary may get incorrect IP. However, the user may also get incorrect output post-compilation. To circumvent this issue, we concatenate the inverse of the random circuit in the compiled circuit to recover the original functionality. We demonstrate the practicality of our method by conducting exhaustive experiments on a set of benchmark circuits and measuring the quality of obfuscation by calculating the Total Variation Distance (TVD) metric. Our method achieves TVD of up to 1.92 and performs at least 2X better than a previously reported obfuscation method. We also propose a novel adversarial reverse engineering (RE) approach and show that the proposed obfuscation is resilient against RE attacks. The proposed technique introduces minimal degradation in fidelity (~1% to ~3% on average).

Related papers

• 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)
• Hardware Trojans in Quantum Circuits, Their Impacts, and Defense [2.089191490381739]
  Circuits with a short depth and lower gate count can yield the correct solution more often than the variant with a higher gate count and depth. Many 3rd party compilers are being developed for lower compilation time, reduced circuit depth, and lower gate count for large quantum circuits.
  arXiv  Detail & Related papers  (2024-02-02T16:44:52Z)
• Obfuscating Quantum Hybrid-Classical Algorithms for Security and Privacy [5.444459446244819]
  Quantum classical algorithms like QAOA encode the graph properties to solve a graph maxcut problem. Usage of untrusted hardware could present the risk of intellectual property (IP) theft. We propose an edge pruning obfuscation method for QAOA along with a split iteration methodology.
  arXiv  Detail & Related papers  (2023-05-03T18:35:14Z)
• Obfuscation of Pseudo-Deterministic Quantum Circuits [14.026980555435841]
  We show how to obfuscate pseudo-deterministic quantum circuits in the classical oracle model. Our obfuscator outputs a quantum state $ketwidetildeQ$ repeatedly on arbitrary inputs.
  arXiv  Detail & Related papers  (2023-02-22T01:14:20Z)
• 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)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• A Quantum Circuit Obfuscation Methodology for Security and Privacy [1.7324358447544175]
  Several 3rd party compilers are evolving to offer improved performance for large quantum circuits. This could lead to an adversary to Reverse Engineer (RE) the quantum circuit for extracting sensitive aspects. We propose obfuscation of quantum circuits to hide the functionality.
  arXiv  Detail & Related papers  (2021-04-13T05:09:45Z)
• Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications [1.6329956884407544]
  We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. Our technique is generic and can be useful for a wide variety of quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-19T16:20:31Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• 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)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.