Composable Verification in the Circuit-Model via Magic-Blindness

Harold Ollivier; Sami Abdul Sater

arxiv: 2601.07111 · v3 · pith:N6RLLTEWnew · submitted 2026-01-12 · 🪐 quant-ph

Composable Verification in the Circuit-Model via Magic-Blindness

Sami Abdul Sater , Harold Ollivier This is my paper

Pith reviewed 2026-05-25 07:31 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum verificationmagic-blindnesscircuit modelmagic state injectioncomposable securitytrap-based verificationClifford circuitsMBQC

0 comments

The pith

Magic-blindness enables noise-robust composable verification for Clifford plus magic-state-injection circuits.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a family of verification protocols tailored to the circuit model that achieve security against arbitrary malicious behavior while remaining robust to noise and composable with other protocols. The central technique is a refined blindness notion that conceals only the locations and values of injected magic states, the sole source of non-Clifford power. This permits random interleaving of actual computation rounds with classically simulable, magic-free test rounds that act as traps. The resulting framework matches the security level previously available only in the measurement-based model, includes and strengthens the Broadbent 2018 protocol, and lowers quantum communication overhead by requiring transmitted qubits solely at injection sites.

Core claim

The paper establishes that a trap-based verification framework for the circuit model follows from magic-blindness: by hiding only the injected magic states, the verifier can interleave computation rounds with magic-free test rounds that remain classically simulable, thereby detecting arbitrary malicious deviations with composable and noise-robust guarantees while reducing communication cost to the injection locations only.

What carries the argument

Magic-blindness, a blindness notion that hides solely the injected magic states to enable trap-based verification via interleaved test rounds.

If this is right

The protocols achieve composable security against arbitrary malicious behavior.
Quantum communication cost drops because qubits need be sent only at magic-state injection sites.
The family contains the Broadbent 2018 protocol and extends its security guarantees.
Circuit-model verification attains the same modularity and security level previously known only for MBQC.
The approach opens the prospect of rapid implementation on near-term devices without full MBQC compilation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Direct circuit-model verification may eliminate the need to translate computations into MBQC form, avoiding associated overhead.
The interleaving technique could extend to verification of other non-Clifford resources if analogous blindness notions are defined.
Combining these protocols with quantum error correction may yield practical verification for early fault-tolerant devices.

Load-bearing premise

Randomly interleaving computation rounds with magic-free classically simulable test rounds suffices to detect arbitrary malicious deviations when only the magic states are hidden.

What would settle it

Existence of a malicious server strategy that alters the computation outcome yet passes all test rounds with probability bounded away from zero.

read the original 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 are expressed in the Measurement-Based Quantum Computation (MBQC) model and benefit from a modular framework of verification protocols. 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 which leads 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 (2018, ToC), extends its security guarantees while also bridging the modularity gap between protocols for MBQC and those for the circuit-model, and reducing quantum communication costs. As a result, it opens the prospect of rapid implementation tailored to 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 circuit verification. As a result, circuit-based quantum verification attains the same level of security and robustness previously known only in MBQC. It also reduces the quantum communication cost as transmitted qubits are required only at the locations of state injection.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Magic-blindness lets them run trap-based verification directly on Clifford+MSI circuits without MBQC conversion, cutting communication while keeping the composable security claims from the 2018 protocol.

read the letter

The new piece is magic-blindness: it blinds only the magic states rather than the whole computation, so test rounds stay magic-free and classically simulable. That lets them interleave those tests with real rounds inside the circuit model itself. The protocol family contains Broadbent 2018 as a special case, claims the same noise-robust composable security against malicious servers, and drops the quantum communication cost because qubits only need to be sent at injection points. That directly addresses the modularity gap the abstract flags for near-term MSI hardware. The approach looks coherent on paper and the reduction in overhead is a concrete practical gain if the security reduction holds. The central assumption is that hiding just the magic states plus random interleaving of simulable tests is enough to catch arbitrary deviations; the stress-test note sees no immediate contradiction in that setup. Still, the full proofs would need checking for any circuit-model-specific leaks that MBQC avoided, and the noise model details matter for the robustness claim. This is aimed at people building delegated verification for circuit-based devices who already know the MBQC literature. It is worth sending to referees because the technique is new, the target problem is real, and the claims are stated sharply enough to be tested.

Referee Report

0 major / 2 minor

Summary. The manuscript introduces a family of verification protocols for Clifford + Magic State Injection (MSI) circuits in the circuit model. The central technique is a refined blindness notion called magic-blindness, which conceals only the injected magic states (the source of non-Clifford power). This enables a trap-based verification framework by randomly interleaving computation rounds with magic-free, classically simulable test rounds. The resulting protocols are claimed to be noise-robust and composably secure against arbitrary malicious behavior, with security strengthening exponentially in the number of test rounds. The family contains and extends the Broadbent 2018 protocol, bridges the modularity gap with MBQC verification, and reduces quantum communication costs by transmitting qubits only at injection locations.

Significance. If the security reductions and composability arguments hold, the work is significant because it supplies a modular, trap-based verification framework directly in the circuit model without requiring compilation to MBQC. This matches the noise-robust, composable guarantees previously available only in MBQC while lowering communication overhead for architectures that natively use MSI. The introduction of magic-blindness as a targeted primitive and the explicit containment of the Broadbent protocol are concrete strengths; the paper also supplies a falsifiable prediction that security scales exponentially with test-round resources.

minor comments (2)

[§3] §3 (Definition of magic-blindness): the formal definition of the ideal functionality should explicitly state the leakage to the verifier when test rounds are used, to make the composability claim with arbitrary protocols fully precise.
[Figure 2] Figure 2 (protocol diagram): the caption should clarify whether the classical communication for test-round outcomes is authenticated, as this affects the malicious security argument.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, recognition of the significance of the work, and recommendation for minor revision. The report correctly identifies the core contributions of magic-blindness, the containment of Broadbent 2018, the bridging of MBQC-circuit modularity, and the communication-cost reduction. No major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper defines magic-blindness as a new primitive that hides only magic states and uses it to enable interleaving of computation rounds with classically simulable test rounds for trap-based verification in the circuit model. This construction extends Broadbent 2018 but does not reduce any central security claim to a self-citation chain, a fitted parameter renamed as prediction, or a definitional equivalence. The derivation is self-contained against external benchmarks and introduces independent content via the refined blindness notion and modularity bridge, consistent with a normal non-circular outcome.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

Only the abstract is available, so the ledger is necessarily incomplete. The central new concept introduced is magic-blindness; no free parameters or standard axioms are mentioned.

invented entities (1)

magic-blindness no independent evidence
purpose: Refined blindness notion that conceals only injected magic states while permitting classically simulable test rounds
Presented as the key technical innovation enabling trap-based verification in the circuit model.

pith-pipeline@v0.9.0 · 5832 in / 1057 out tokens · 22567 ms · 2026-05-25T07:31:29.930953+00:00 · methodology

Composable Verification in the Circuit-Model via Magic-Blindness

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)