Composable Verification in the Circuit-Model via Magic-Blindness

• URL: http://arxiv.org/abs/2601.07111v1
• Date: Mon, 12 Jan 2026 00:30:24 GMT
• Title: Composable Verification in the Circuit-Model via Magic-Blindness
• Authors: Sami Abdul Sater, Harold Ollivier,
• Abstract summary: We introduce a family of noise robust, composable and efficient verification protocols for Clifford + MSI circuits.<n>Our technique is based on a refined notion of blindness, called magic-blindness, which hides only the injected magic states.<n>As a result, circuit-based quantum verification attains the same level of security and robustness previously known only in MBQC.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As quantum computing machines move towards the utility regime, it is essential that users are able to verify their delegated quantum computations with security guarantees that are (i) robust to noise, (ii) composable with other secure protocols, and (iii) exponentially stronger as the number of resources dedicated to security increases. Previous works that achieve these guarantees and provide modularity necessary to optimization of protocols to real-world hardware are most often expressed in the Measurement-Based Quantum Computation (MBQC) model. This leaves architectures based on the circuit model -- in particular those using the Magic State Injection (MSI) -- with fewer options to verify their computations or with the need to compile their circuits in MBQC leading to overheads. This paper introduces a family of noise robust, composable and efficient verification protocols for Clifford + MSI circuits that are secure against arbitrary malicious behavior. This family contains the verification protocol of Broadbent (ToC, 2018), extends its security guarantees while also bridging the modularity gap between MBQC and circuit-based protocols, and reducing quantum communication costs. As a result, it opens the prospect of rapid implementation for near-term quantum devices. Our technique is based on a refined notion of blindness, called magic-blindness, which hides only the injected magic states -- the sole source of non-Clifford computational power. This enables verification by randomly interleaving computation rounds with classically simulable, magic-free test rounds, leading to a trap-based framework for verification. As a result, circuit-based quantum verification attains the same level of security and robustness previously known only in MBQC. It also optimizes the quantum communication cost as transmitted qubits are required only at the locations of state injection.

Related papers

• Partial Blind Quantum Computation: A Framework for Selective Circuit Protection [0.5755004576310334]
  Universal Blind Quantum Computation protocols enable clients with limited quantum resources to delegate computations while concealing both inputs and circuit details.<n>Applying UBQC uniformly to an entire quantum circuit incurs additional quantum resources and computational overhead.<n>We propose a selective application of UBQC that targets only the critical components of quantum circuits.
  arXiv  Detail & Related papers  (2025-03-13T03:31:12Z)
• Composably Secure Delegated Quantum Computation with Weak Coherent Pulses [0.0]
  Secure Delegated Quantum Computation protocols allow a client to delegate a quantum computation to a powerful remote server.<n>This paper shows how to alleviate the necessity for the client to have a single-photon source.<n>It proposes a protocol that ensures that among a sufficiently large block of transmitted weak coherent pulses, at least one of them was emitted as a single photon.
  arXiv  Detail & Related papers  (2025-03-11T15:47:52Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• 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)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing.<n>We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Practical quantum secure direct communication with squeezed states [37.69303106863453]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.<n>This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Single-photon-memory measurement-device-independent quantum secure direct communication [63.75763893884079]
  Quantum secure direct communication (QSDC) uses the quantum channel to transmit information reliably and securely. In order to eliminate the security loopholes resulting from practical detectors, the measurement-device-independent (MDI) QSDC protocol has been proposed. We propose a single-photon-memory MDI QSDC protocol (SPMQC) for dispensing with high-performance quantum memory.
  arXiv  Detail & Related papers  (2022-12-12T02:23:57Z)
• Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations [0.5825410941577593]
  Cloud-based quantum computing has become vital to provide strong guarantees that computations delegated by clients to quantum service providers have been executed faithfully. Current protocols lack at least one of the following three ingredients: composability, noise-robustness and modularity. This paper lays out the fundamental structure of SDQC protocols, namely mixing two components: the Cryptography which the client would like the server to perform and tests that are designed to detect a server's malicious behaviour. Changing the types of tests and how they are mixed with the client's computation automatically yields new SDQC protocols with different security and noise-
  arXiv  Detail & Related papers  (2022-06-01T17:03:07Z)
• Modulation leakage-free continuous-variable quantum key distribution [1.8268488712787332]
  Continuous-variable (CV) QKD based on coherent states is an attractive scheme for secure communication. This work is a step towards protecting CVQKD systems against practical imperfections of physical devices and operational limitations without performance degradation.
  arXiv  Detail & Related papers  (2022-05-15T10:07:19Z)
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds [0.0]
  Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks. We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
  arXiv  Detail & Related papers  (2021-02-25T15:58:09Z)

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.