Watermarking of Quantum Circuits

• URL: http://arxiv.org/abs/2409.01484v1
• Date: Mon, 2 Sep 2024 22:37:47 GMT
• Title: Watermarking of Quantum Circuits
• Authors: Rupshali Roy, Swaroop Ghosh,
• Abstract summary: Quantum circuits constitute Intellectual Property (IP) of the quantum developers and users. We present two such lightweight watermarking techniques to prove ownership in the event of an adversary cloning the circuit design.
• Score: 2.348041867134616
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum circuits constitute Intellectual Property (IP) of the quantum developers and users, which needs to be protected from theft by adversarial agents, e.g., the quantum cloud provider or a rogue adversary present in the cloud. This necessitates the exploration of low-overhead techniques applicable to near-term quantum devices, to trace the quantum circuits/algorithms\textquotesingle{} IP and their output. We present two such lightweight watermarking techniques to prove ownership in the event of an adversary cloning the circuit design. For the first technique, a rotation gate is placed on ancilla qubits combined with other gate(s) at the output of the circuit. For the second method, a set of random gates are inserted in the middle of the circuit followed by its inverse, separated from the circuit by a barrier. These models are combined and applied on benchmark circuits, and the circuit depth, 2-qubit gate count, probability of successful trials (PST), and probabilistic proof of authorship (PPA) are compared against the state-of-the-art. The PST is reduced by a minuscule 0.53\% against the non-watermarked benchmarks and is up to 22.69\% higher compared to existing techniques. The circuit depth has been reduced by up to 27.7\% as against the state-of-the-art. The PPA is astronomically smaller than existing watermarks.

Related papers

• Multi-Stage Watermarking for Quantum Circuits [15.592314567937159]
  Quantum circuits tailored to address specific problems have emerged as critical intellectual properties (IPs) for quantum computing companies. In this paper, we propose an innovative multi-stage watermarking scheme for quantum circuits.
  arXiv  Detail & Related papers  (2024-04-28T00:52:38Z)
• REPQC: Reverse Engineering and Backdooring Hardware Accelerators for Post-quantum Cryptography [5.458904989691539]
  We show that PQC hardware accelerators can be backdoored by two different adversaries located in the chip supply chain. We propose REPQC, a sophisticated reverse engineering algorithm that can be employed to confidently identify hashing operations. An adversary proceeds to insert malicious logic in the form of a stealthy Hardware Trojan Horse (HTH)
  arXiv  Detail & Related papers  (2024-03-14T12:57:59Z)
• 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)
• Instantaneous nonlocal quantum computation and circuit depth reduction [7.148511452018054]
  Two-party quantum computation is a computation process with bipartite input and output, in which there are initial shared entanglement. In the first part, we show that a particular simplified subprocedure, known as a garden-hose gadget, cannot significantly reduce the entanglement cost. In the second part, we show that any unitary circuit consisting of layers of Clifford gates and T gates can be implemented using a circuit with measurements of depth proportional to the T-depth of the original circuit.
  arXiv  Detail & Related papers  (2023-06-15T17:57:50Z)
• 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)
• Randomized Reversible Gate-Based Obfuscation for Secured Compilation of Quantum Circuit [5.444459446244819]
  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.
  arXiv  Detail & Related papers  (2023-05-02T00:24:34Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• 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)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.