Security Evaluation of Quantum Circuit Split Compilation under an Oracle-Guided Attack

• URL: http://arxiv.org/abs/2511.04842v1
• Date: Thu, 06 Nov 2025 22:06:51 GMT
• Title: Security Evaluation of Quantum Circuit Split Compilation under an Oracle-Guided Attack
• Authors: Hongyu Zhang, Yuntao Liu,
• Abstract summary: Split compilation is one of the most studied QCO techniques, where the circuit to be compiled is split into two disjoint partitions.<n>We propose an oracle-guided security evaluation framework in which candidate connections are systematically tested against input-output observations.<n> Experimental evaluation in the RevLib benchmark suite shows that only a small number of I/O pairs are sufficient to recover the correct inter-split connections and reconstruct the entire circuits.
• Score: 12.356632680373691
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum circuits are the fundamental representation of quantum algorithms and constitute valuable intellectual property (IP). Multiple quantum circuit obfuscation (QCO) techniques have been proposed in prior research to protect quantum circuit IP against malicious compilers. However, there has not been a thorough security evaluation of these schemes. In this work, we investigate the resilience of split compilation against an oracle-guided attack. Split compilation is one of the most studied QCO techniques, where the circuit to be compiled is split into two disjoint partitions. Each split circuit is known to the compiler, but the interconnections between them are hidden. We propose an oracle-guided security evaluation framework in which candidate connections are systematically tested against input-output observations, with iteratively pruned inconsistent mappings. This hierarchical matching process exploits the reversibility of quantum gates and reduces the search space compared to brute-force enumeration. Experimental evaluation in the RevLib benchmark suite shows that only a small number of I/O pairs are sufficient to recover the correct inter-split connections and reconstruct the entire circuits. Our study marks the first thorough security evaluations in quantum IP protection and highlights the necessity of such evaluations in the development of new protection schemes.

Related papers

• Q-Tag: Watermarking Quantum Circuit Generative Models [31.69513813467356]
  Digital watermarking has been explored as a promising mechanism for protecting quantum circuits.<n>We present the first watermarking framework for QCGMs, which embeds ownership signals into the generation process.<n>Our method achieves high-fidelity circuit generation and robust watermark detection across a range of perturbations.
  arXiv  Detail & Related papers  (2026-02-26T15:08:59Z)
• Optimized Compilation of Logical Clifford Circuits [41.67570087491999]
  Gate-by-gate compilation often yields deep circuits.<n>We focus on the compilation of primitives from quantum simulation as single blocks.<n>We introduce a methodology that lifts these primitives into size-invariant, depth-efficient compilation strategies.
  arXiv  Detail & Related papers  (2026-02-13T11:35:11Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [41.99844472131922]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Encrypted-state quantum compilation scheme based on quantum circuit obfuscation for quantum cloud platforms [3.2716496782041555]
  We propose an encrypted-state quantum compilation scheme based on quantum circuit obfuscation (ECQCO)<n>It applies quantum homomorphic encryption to conceal output states and instantiates a structure obfuscation mechanism based on quantum indistinguishability obfuscation.<n>ECQCO achieves a total variation distance (TVD) of up to 0.7 and a normalized graph edit distance (GED) of 0.88, enhancing compilation-stage security.
  arXiv  Detail & Related papers  (2025-07-23T15:23:18Z)
• Quantum Opacity, Classical Clarity: A Hybrid Approach to Quantum Circuit Obfuscation [0.0]
  We propose a novel obfuscation technique that protects proprietary quantum circuits by inserting additional quantum gates prior to compilation.<n>These gates corrupt the measurement outcomes, which are later corrected through a lightweight classical post-processing step.<n>This shows that our method is a practical and effective solution for the security of quantum circuit designs in untrusted compilation flows.
  arXiv  Detail & Related papers  (2025-05-20T02:42:47Z)
• TetrisLock: Quantum Circuit Split Compilation with Interlocking Patterns [7.041881854531399]
  In quantum computing, quantum circuits are fundamental representations of quantum algorithms.<n>In this paper, we propose TetrisLock, a split compilation method for quantum circuit obfuscation.
  arXiv  Detail & Related papers  (2025-03-15T03:41:24Z)
• Quantum Rewinding for IOP-Based Succinct Arguments [42.12045681000549]
  We prove that an interactive variant of the BCS transformation is secure in the standard model against quantum adversaries when the vector commitment scheme is collapsing.<n>As a consequence of our results, we obtain standard-model post-quantum secure succinct arguments with the best complexity known.
  arXiv  Detail & Related papers  (2024-11-08T06:33:08Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• 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)
• Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow [7.619626059034881]
  We propose an efficient scheme for quantum circuit equivalence checking. The proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less.
  arXiv  Detail & Related papers  (2020-09-04T19:58:53Z)
• Post-Quantum Multi-Party Computation [32.75732860329838]
  We study multi-party computation for classical functionalities (in the plain model) with security against malicious-time quantum adversaries. We assume superpolynomial quantum hardness of learning with errors (LWE), and quantum hardness of an LWE-based circular security assumption. Along the way, we develop cryptographic primitives that may be of independent interest.
  arXiv  Detail & Related papers  (2020-05-23T00:42:52Z)

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.