Post-Cut Metadata Inference Attacks on Quantum Circuit Cutting Pipelines

• URL: http://arxiv.org/abs/2604.10592v1
• Date: Sun, 12 Apr 2026 11:51:05 GMT
• Title: Post-Cut Metadata Inference Attacks on Quantum Circuit Cutting Pipelines
• Abstract summary: Quantum circuit cutting enables near-term quantum devices to execute workloads exceeding their qubit capacity by decomposing circuits into runnable fragments.<n>This creates a previously unexplored confidentiality surface: the fragment-level execution transcript observable by a semi-honest cloud provider.<n>We formalise this surface and demonstrate that post-cut transcripts constitute a practical metadata side channel.
• Score: 3.9890357781493595
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum circuit cutting enables near-term quantum devices to execute workloads exceeding their qubit capacity by decomposing circuits into independently runnable fragments. While this extends computational reach, it creates a previously unexplored confidentiality surface: the fragment-level execution transcript observable by a semi-honest cloud provider. We formalise this surface and demonstrate that post-cut transcripts constitute a practical metadata side channel. Operating solely on provider-visible compiled circuit metadata (fragment width, depth, and two-qubit gate count), we evaluate a structured inference attack across six classification objectives spanning algorithm identity, cut mechanism, and coarse Hamiltonian structure. Our corpus comprises 1,200 circuit fragments across eight algorithm families transpiled against three hardware topologies, validated on a 156-qubit production quantum computer confirming that QPU execution time remains invariant across a 25x variation in compiled depth. Under strict instance-disjoint generalisation, our attack recovers algorithm family with 0.960 accuracy (AUC 0.999), cut mechanism with 0.847 accuracy (AUC 0.924), and Hamiltonian k-locality with 0.960 accuracy (AUC 0.998). Connectivity and geometry inference achieve AUC of 0.986 and 0.942 with strong stability under size-holdout. Topology inference remains above chance (AUC 0.666). A matched-footprint control and ablation study confirm leakage is structure-dominated and not explained by scale artefacts. These results demonstrate that circuit cutting is not confidentiality-neutral and that metadata leakage should be treated as a first-class security concern in quantum cloud systems.

Related papers

• SILK: Closing the Time-of-Check-to-Time-of-Use Gap in RoT-Protected AI Systems [1.082233332885939]
  SILK (Streaming Inline Lightweight Keying) is an in-place integrity mechanism that verifies the weight stream at the final pre-compute boundary.<n>A lightweight streaming checker recomputes these checks without separate authentication tags and uses commit gating to prevent unverified weights from reaching computation engine.
  arXiv  Detail & Related papers  (2026-08-26T21:06:34Z)
• What Accuracy and Gradient Cosine Miss: Evaluating Feedback Alignment via Scale Stability, Reference Validity, and Depth Utility [48.10132234701036]
  We propose a diagnostic evaluation protocol based on three checks -- scale stability, reference validity, and depth utility -- together with per-layer rather than aggregate cosine reporting.<n>Across multiple architectures and methods, our protocol identifies all failures with wide calibration margins.
  arXiv  Detail & Related papers  (2026-06-19T06:04:17Z)
• Automating the Expert Eye: A System-Agnostic Deep Learning Framework for Rare Event Discovery in Imbalanced Force Spectroscopy [0.0]
  We present a system-agnostic, interpretable deep learning framework tailored to overcome extreme class imbalance in automated SMFS triage.<n>We evaluated this framework on the complex mechanical unfolding pathways of the R. champanellensis cellulosome.<n>By implementing an empirically dual-weighted triage system, the pipeline automatically discarded 880 background noise traces.
  arXiv  Detail & Related papers  (2026-06-08T14:24:58Z)
• Alignment Collapse Under KV Cache Quantization: Diagnosis and Mitigation [6.129872931808218]
  Key-value ( KV) cache quantization is widely used to reduce Large Language Model (LLM) inference memory.<n>In this study, we explore alignment preservation under KV cache quantization.<n>We find that low-bit quantization can silently destroy safety alignment.
  arXiv  Detail & Related papers  (2026-06-01T02:02:20Z)
• SPATE: Spiking-Phase Adaptive Temporal Encoding for Quantum Machine Learning [3.1061484260786014]
  This paper uses spike-based data representation as an effective encoding mechanism that incorporates temporal structure into quantum feature preparation.<n>A novel spike-driven temporal encoding method is proposed that converts real-valued tabular features into leaky-and-fire spike trains and maps spike statistics to quantum rotations.<n>Under stratified cross-validation, SPATE yields stronger representations across multiple datasets.
  arXiv  Detail & Related papers  (2026-04-13T05:41:03Z)
• Enhancing Kerr-Cat Qubit Coherence with Controlled Dissipation [64.05054054401175]
  Kerr-cat qubit (KCQ) is a bosonic quantum processor.<n>KCQs are experimentally compatible with on-chip architectures and high-fidelity operations.<n>We present direct evidence that the bit-flip time in a KCQ is limited by leakage out of the qubit manifold.
  arXiv  Detail & Related papers  (2025-11-02T17:58:36Z)
• 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)
• Universal gates for a metastable qubit in strontium-88 [0.0]
  We characterize a universal gate set for the metastable fine-structure qubit in bosonic strontium-88.<n>We find single-qubit gate fidelities of 0.993 and two-qubit fidelities of 0.9945(6) after correcting for losses.<n>Our results establish the strontium fine-structure qubit as a promising candidate for near-term error-corrected quantum computers.
  arXiv  Detail & Related papers  (2025-06-12T14:03:37Z)
• Hybrid-Segmentor: A Hybrid Approach to Automated Fine-Grained Crack Segmentation in Civil Infrastructure [52.2025114590481]
  We introduce Hybrid-Segmentor, an encoder-decoder based approach that is capable of extracting both fine-grained local and global crack features. This allows the model to improve its generalization capabilities in distinguish various type of shapes, surfaces and sizes of cracks. The proposed model outperforms existing benchmark models across 5 quantitative metrics (accuracy 0.971, precision 0.804, recall 0.744, F1-score 0.770, and IoU score 0.630), achieving state-of-the-art status.
  arXiv  Detail & Related papers  (2024-09-04T16:47:16Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Second-Order Provable Defenses against Adversarial Attacks [63.34032156196848]
  We show that if the eigenvalues of the network are bounded, we can compute a certificate in the $l$ norm efficiently using convex optimization. We achieve certified accuracy of 5.78%, and 44.96%, and 43.19% on 2,59% and 4BP-based methods respectively.
  arXiv  Detail & Related papers  (2020-06-01T05:55:18Z)

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.