{"id":"88195f56-488c-4e01-9711-4eecca726023","arxiv_id":"2607.08508","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"MGT protocols encode the input into a measurement-heralded stabilizer code then apply a logical non-Clifford gate; useful resource states are Clifford-equivalent to diagonal states, and feedforward can often be Pauli.","lead":"The paper characterizes magic gate teleportation (MGT) protocols that apply non-Clifford gates without leaking the input state, showing they secretly encode into a heralded stabilizer code then apply a logical gate. It constructs protocols for commuting Pauli-rotation resources, proves useful states must be Clifford-equivalent to diagonal ones, and finds when feedforward collapses to Paulis.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The reader's weakest-assumption note correctly identifies the only genuine scope limitation (commuting resource-side Paulis in Theorem 3). That limitation is already explicit in the manuscript and does not create an internal contradiction or threaten the single-qubit result or the constructive half of the paper. The no-leakage requirement plus free Clifford+Z-measurement operations force the resource state into the Clifford-diagonal form once the A_j commute; the proofs are short, elementary, and checkable by hand. Algorithm 1 and the Pauli-feedforward criteria supply independent positive content that does not rest on the open multi-qubit case. Consequently the ACCEPT / high-confidence verdict stands; no adjustment is warranted.","tokens_in":17801,"tokens_out":390,"duration_ms":4648,"concrete_test":"Independently re-derive the single-qubit case of Theorem 2 from the zero-expectation condition alone (without invoking the multi-qubit Lemma 2): confirm that any pure state with all three Pauli expectations nonzero cannot admit a nontrivial back-propagated measurement A⊗B that leaves an arbitrary input recoverable. If the derivation holds, the characterization is secure.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central converse claims (Theorem 2 fully, Theorem 3 under the commuting-A_j restriction) are internally consistent with the no-leakage condition (Eq. 5) and the free-operation set. The multi-qubit gap noted by the reader is already flagged by the authors (Section IV.B) and does not undermine the theorems as stated; all known MGT protocols fall inside the covered class, and the constructive direction (Theorem 1 + Algorithm 1) is self-contained. No hidden inconsistency, free parameter, or unstated assumption appears load-bearing for the strongest claim.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper develops a theory of magic gate teleportation (MGT): gate-teleportation protocols that implement non-Clifford unitaries on arbitrary input states without leaking information about those states, using free operations consisting of computational-basis preparation, Cliffords, and Pauli-Z measurements. After back-propagating the final measurements, MGT is shown (Lemma 1) to encode the input into a measurement-heralded stabilizer code and then apply a logical non-Clifford gate. Theorem 1 and Algorithm 1 construct explicit MGT protocols (and deterministic feed-forward) for any resource state obtained by commuting Pauli rotations applied to a stabilizer state. The converse direction (Theorems 2–3, via Lemma 2) proves that useful resource states must be Clifford-equivalent to diagonal states (single-qubit case exhaustive; multi-qubit case under commuting resource-side Paulis), so that the |F\rangle state from the [[5,1,3]] distillation protocol is not useful for MGT. Theorems 4 and Corollaries 2–3 give conditions under which feed-forward reduces to Pauli (or simpler unitary) operators, with applications to algorithmic fault tolerance and distillation circuits.","tokens_in":17944,"tokens_out":794,"duration_ms":7451,"significance":"If the results hold, the paper supplies a clean structural characterization of a practically important class of gate-teleportation protocols and a sharp necessary condition on useful resource states. The constructive half (Theorem 1 + Algorithm 1) is immediately usable for circuit synthesis; the converse half cleanly separates “non-stabilizer” from “useful for information-preserving gate teleportation,” explaining why |F\rangle cannot be used directly. The feed-forward criteria give a transparent stabilizer-based account of why certain logical measurements in algorithmic fault tolerance can be replaced by coin tosses and absorbed into the Pauli frame, and they reduce the number of non-Pauli corrections needed in distillation factories. The derivations rely only on standard stabilizer and Clifford-hierarchy arguments, with no free parameters.","major_comments":[],"minor_comments":[{"comment":"Section IV.B / Theorem 3: the commuting-A_j hypothesis is already flagged by the authors as covering all known protocols; a short explicit remark that the unrestricted multi-qubit converse remains open would make the scope even clearer for non-specialist readers.","section":null},{"comment":"Figure 1 caption and surrounding text: the three great circles on the Bloch sphere are described but not labelled with the corresponding Clifford conjugations of Z(θ)|+⟩; a one-line legend would improve readability.","section":null},{"comment":"Appendix A, Algorithm 2: the encoding-circuit construction is standard but the notation for the standard-form blocks (A1,A2,B0,C,D,E) is introduced without a brief pointer to Gottesman’s original presentation; a single reference sentence would help.","section":null},{"comment":"Examples 2–4 and Figure 2: the logical-operator choices after measurement are correct but the intermediate tableau updates are left implicit; a short parenthetical note that they follow the usual Aaronson–Gottesman update rule would remove any residual ambiguity.","section":null},{"comment":"Typographical: occasional missing spaces around math operators (e.g., “P(θ)|s⟩”) and inconsistent use of “feedforward” vs “feed-forward”; pure presentation polish.","section":null}],"recommendation":"accept","confidential_remarks":"The manuscript is self-contained, the proofs are elementary and correct, and the multi-qubit gap is already acknowledged. I see no reason for major revision; the work is ready for acceptance with only light copy-editing."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The core result is solid: under the no-leakage constraint that matters for long fault-tolerant computations, useful resource states for magic gate teleportation must be Clifford-equivalent to diagonal states. Single-qubit case is exhaustive (Theorem 2); the multi-qubit version (Theorem 3) needs commuting resource-side Paulis but covers every known protocol and is already flagged by the authors. They also give an explicit constructive direction (Theorem 1 + Algorithm 1) and a clean criterion for replacing feedforward by Paulis (Theorem 4), which immediately explains and simplifies pieces of algorithmic fault tolerance.\n\nWhat is new is the stabilizer-code view after back-propagating the measurements (Lemma 1), the necessity proof that rules out the five-qubit |F\rangle state, the circuit-synthesis algorithm, and the Pauli-feedforward conditions. The proofs are direct stabilizer and Clifford-hierarchy arguments; no free parameters, no circular citations. The examples (T-gate, XX rotations, multi-angle diagonal gates, 15-to-1 distillation) make the claims concrete and checkable.\n\nSoft spots are minor and already owned. The multi-qubit converse is restricted to commuting A_j; non-commuting cases remain open, but that does not break the theorems as stated. The paper is pure theory, so there is no numerical validation, but the math is self-contained and the algorithm is efficient enough to implement. Citation pattern is appropriate; they correctly situate themselves relative to Bravyi-Kitaev, Gottesman-Chuang, and the recent algorithmic-FT literature.\n\nThis is for people working on QLDPC architectures, magic-state factories, or feedforward simplification. Anyone who has to decide which exotic states are actually usable under no-leakage will get value. It deserves a serious referee; I would accept it for peer review and would cite the characterization and the feedforward criteria myself.","headline":"Clean theory paper that pins down which magic states actually work for no-leakage gate teleportation and gives a usable synthesis algorithm plus a practical feedforward simplification.","tokens_in":18521,"tokens_out":473,"would_cite":true,"duration_ms":6016,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"Useful magic states for gate teleportation must be Clifford-equivalent to diagonal states; the five-qubit distilled state is not among them.","keywords":["magic gate teleportation","resource states","stabilizer codes","Clifford hierarchy","feedforward operators","algorithmic fault tolerance","magic-state distillation"],"falsifier":"Exhibit a multi-qubit pure state that is not Clifford-equivalent to any diagonal state, yet still supports an MGT protocol whose back-propagated measurements have non-commuting resource-side Pauli factors, and verify that the protocol implements a non-Clifford gate on every input without revealing information.","tokens_in":18714,"feed_emoji":"⚛️","tokens_out":1003,"duration_ms":9439,"temperature":0.7,"pith_summary":"Fault-tolerant quantum computers need non-Clifford gates, which are usually implemented by teleporting them from carefully prepared resource states. The paper studies magic gate teleportation (MGT): protocols that apply a non-Clifford gate to an arbitrary unknown input while revealing nothing about that input. After the final measurements are pushed backward, every such protocol is revealed to be an encoding of the input into a stabilizer code (chosen by the measurement outcomes) followed by a logical non-Clifford gate. From this structure the authors give an explicit construction that works for every resource state obtained by commuting Pauli rotations on a stabilizer state, together with an efficient circuit-synthesis algorithm. The same structure yields a converse: any resource state that can power an MGT protocol must itself be Clifford-equivalent to a diagonal state. In particular the single-qubit state produced by the classic five-qubit distillation protocol lies outside this class and cannot be used for MGT. The paper also characterises when the usual Clifford feed-forward can be replaced by a Pauli operator, which both simplifies certain distillation circuits and clarifies why algorithmic fault-tolerance schemes can treat some logical measurement outcomes as random coin flips.","feed_headline":"Magic states for gate teleport must be diagonal","feed_subtitle":"Five-qubit distilled state cannot power information-preserving non-Clifford teleportation","key_machinery":"The back-propagated view of an MGT protocol: after the Pauli-Z measurements are pushed to the beginning, the protocol encodes the input into a stabilizer code heralded by the outcomes and then applies a logical non-Clifford gate. This identity both supplies the constructive protocols (Theorem 1) and forces the resource-state constraints (Theorems 2–3).","core_discovery":"A pure state can serve as a resource for magic gate teleportation (a protocol that realises a non-Clifford gate on an arbitrary input without leaking information about that input) only if it is Clifford-equivalent to a diagonal state. For single-qubit resources this means the useful states lie on three great circles of the Bloch sphere; the five-qubit distilled state |F\rangle is therefore useless for MGT. The same characterisation holds for multi-qubit resources whenever the resource-side factors of the back-propagated measurements commute.","pith_inferences":["Magic-state factories that currently output |F\rangle-type states may need an extra conversion stage if their consumers insist on information-preserving teleportation.","Allowing controlled leakage of partial information about the input could enlarge the set of usable resource states beyond the diagonal class, at the cost of intermediate classical processing.","The same back-propagation identity may organise other resource theories of non-Clifford gates once the free operations are fixed to Clifford plus Z measurements."],"forward_implications":["Any resource state obtained by commuting Pauli rotations of a stabilizer state can be turned into an explicit MGT circuit by the given synthesis algorithm.","Feed-forward operators become ordinary Pauli operators whenever the input is stabilised by a matching set of anti-commuting Paulis, allowing them to be absorbed into the Pauli frame.","In algorithmic fault-tolerance schemes, logical measurement outcomes that are 50/50 random can safely be replaced by coin flips because the corresponding feed-forward reduces to a Pauli update.","The five-qubit distilled |F\rangle state must be further converted (e.g., by parity measurement of two copies) before it can be used for gate teleportation under the no-leakage requirement."],"fun_headline_variants":["Useful MGT resources must be Clifford-diagonal","Five-qubit distilled state fails as MGT resource","MGT states are Clifford-equivalent to diagonal only","Non-Clifford teleport needs diagonal-Clifford resources","Backpropagated MGT encodes input into stabilizer codes"],"cache_read_input_tokens":128,"weakest_assumption_plain":"The multi-qubit converse assumes that the resource-side factors of the back-propagated measurements all commute with one another; the paper notes this covers every known protocol but leaves open whether non-commuting factors could allow non-diagonal useful states.","fun_headline_variants_meta":{"raw":{"variants":["Useful MGT resources must be Clifford-diagonal","Five-qubit distilled state fails as MGT resource","MGT states are Clifford-equivalent to diagonal only","Non-Clifford teleport needs diagonal-Clifford resources","Backpropagated MGT encodes input into stabilizer codes"]},"model":"grok-4.5","effort":"low","cost_usd":0.004266,"raw_usage":{"total_tokens":1253,"prompt_tokens":813,"num_sources_used":0,"completion_tokens":59,"cost_in_usd_ticks":42660000,"prompt_tokens_details":{"text_tokens":813,"audio_tokens":0,"image_tokens":0,"cached_tokens":0},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":381,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":813,"tokens_out":59,"duration_ms":6205,"temperature":1.0,"reasoning_tokens":381,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T06:15:13.440215+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Exhibit a multi-qubit pure state that is not Clifford-equivalent to any diagonal state, yet still supports an MGT protocol whose back-propagated measurements have non-commuting resource-side Pauli factors, and verify that the protocol implements a non-Clifford gate on every input without revealing information.","supporting_citations":[],"review_version":1}