{"id":"ad296c10-217a-414b-b18e-9abad1bd88a8","arxiv_id":"2508.10107","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":2,"one_line_summary":"Projective measurements restore universality in Majorana-based topological quantum computing, shown by simulations of Bell states, GHZ states, and 5- and 10-qubit random circuits with fidelity above 99%.","lead":"A study proposes using projective measurements to switch between two ways of encoding qubits in Majorana particles, restoring the ability to perform universal quantum gates that braiding alone cannot provide. The authors report simulations that prepare Bell and GHZ states and run random circuits on up to ten qubits with fidelity above 99%.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Abstract claims projective measurements alone restore universality, but the paper's own Section I says hybridization is essential for non-Clifford T gates; the central claim as stated is unsupported pending clarification of whether demonstrations include T gates.","rationale":"The reader's weakest_assumption concerned the reliability of the time-dependent Pfaffian simulations and the idealization of projective measurements. That is a legitimate reproducibility concern, but the more load-bearing issue is the mismatch between the abstract's claim that projective measurements alone restore universality and the manuscript's own statement that hybridization is essential for the non-Clifford T gate. This is a direct conceptual flaw in the central claim as presented, not merely a data-access problem. I recommend CONDITIONAL rather than REJECT because the underlying scheme may still be sound once the claim is revised to 'projective measurements restore the full Clifford group, and hybridization provides the missing non-Clifford gate,' and because the provided full text does not contain the simulation data needed to evaluate the fidelity claims independently. The concrete test of adding a T gate to the random circuit would settle whether the numerical demonstrations actually support universal quantum computation or only Clifford computation. The abstract's 'arbitrary number of qubits' is also an overstatement relative to the ten-qubit demonstration, but it is secondary to the universality issue.","tokens_in":1890,"tokens_out":8263,"duration_ms":106314,"concrete_test":"Inspect the five-qubit random circuit's gate list (in the actual paper or its code). If every gate is a braid or a parity measurement, the circuit is Clifford-only and not universal. Then re-run the reported fidelity simulation after inserting one non-Clifford T gate implemented by a controlled Majorana hybridization pulse, and compare the fidelity; if the T-gate circuit fidelity is not reported or drops below 99%, the abstract's universality claim is not supported by the numerical demonstrations.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim in the abstract is that incorporating projective parity measurements 'restore[s] computational universality.' But the accompanying methodology text (the only full text provided) explicitly states in Section I: 'While braiding yields discrete gate operations (typically Clifford gates), hybridization allows the implementation of continuous single-qubit phase rotations, including T-gates' and 'Hybridization complements the framework by enabling access to non-Clifford gates, which is essential for achieving universality with this approach' (refs. [11,12,14,15]). Thus projective measurements alone—without hybridization—generate at most the Clifford group, not a universal gate set. The abstract overstates the contribution by omitting hybridization. Moreover, the five-qubit and ten-qubit simulation results are described as 'random unitary circuits,' but unless those circuits explicitly include non-Clifford gates (e.g., T gates via hybridization), the reported >99% fidelity is evidence only for Clifford-level operations and says nothing directly about universal quantum computation. This is an internal inconsistency between the abstract's headline claim and the manuscript's own gate-set analysis.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper presents a framework and numerical simulations for topological quantum computing with Majorana zero modes, in which braiding is augmented by projective parity measurements that switch between sparse and dense qubit encodings. The authors report preparing Bell and GHZ states for two and five qubits, executing random unitary circuits on five and ten qubits, and claim fidelities above 99% for moderate static disorder. They interpret these results as evidence for scalable, intrinsically fault-tolerant universal quantum computation.","tokens_in":2172,"tokens_out":3377,"duration_ms":39410,"significance":"If the reported fidelities are reproducible, the paper provides a valuable numerical toolbox based on the time-dependent Pfaffian formalism and demonstrates many-body simulation of measurement-assisted braiding for systems up to 40 Majorana modes. This would be a useful contribution to the TQC simulation literature. However, the central claim that projective measurements alone restore computational universality conflicts with the manuscript's own gate-set discussion and exceeds the evidence presented.","major_comments":[{"comment":"The abstract claims that incorporating projective parity measurements \"restore[s] computational universality,\" but Section I states that braiding yields Clifford gates, that hybridization provides the non-Clifford T gates, and that hybridization is \"essential for achieving universality with this approach.\" The measurement-induced sparse/dense switching described in Section I supplies Clifford operations only. The headline claim is therefore internally inconsistent with the manuscript's gate-set analysis. Please revise the abstract and title to attribute universality to projective measurements plus hybridization, and specify whether the reported random circuits include non-Clifford gates or are Clifford-only. This is load-bearing because the relevance of the demonstrations to universal quantum computation depends on it.","section":"Abstract; Section I"},{"comment":"The title promises topological quantum computing with \"an arbitrary number of qubits,\" but the evidence provided is limited to five- and ten-qubit systems. Unless a formal complexity or scaling argument is given, such as polynomial simulation cost and a protocol that extends to any N, the title and abstract overclaim. Please qualify the scalability statement and report the complexity scaling of the simulation method.","section":"Title; Abstract"},{"comment":"The abstract's fidelity numbers (>99%) cannot be assessed from the text provided: there is no definition of fidelity (state fidelity, output probability, or process fidelity), no specification of the disorder model (type, amplitude, spatial correlation), and no statistical uncertainty or error bars. Please provide these details, and where possible show fidelity as a function of braid duration and disorder strength with error estimates.","section":"Abstract; Simulation claims"}],"minor_comments":[{"comment":"The phrase \"naive extension of braiding based gates\" should be made precise: sparse encoding supports single-qubit Clifford gates but no entangling gates, while dense encoding supports entangling gates but not all single-qubit Cliffords. A one-sentence clarification would remove ambiguity.","section":"Abstract"},{"comment":"The term \"hybridization\" is introduced without a quantitative definition. Please define it as the energy splitting between overlapping Majorana modes and explain how this splitting is used to realize continuous phase rotations and T gates.","section":"Section I"},{"comment":"The abstract says \"random unitary circuit\" but does not describe how the circuit is compiled into braids, measurements, and (if applicable) hybridization. A brief statement would help the reader determine whether the reported circuits contain non-Clifford gates.","section":"Abstract; Section I"}],"recommendation":"major_revision","confidential_remarks":"The paper appears promising as a numerical methods contribution, but the central framing overstates what projective measurements alone achieve. Please ensure the authors address the inconsistency between the abstract and Section I, and clarify whether the simulated random circuits include non-Clifford gates. The paper may be more accurately framed as a demonstration of Clifford-level operations with measurement-based encoding switching, with universality requiring hybridization as a separate ingredient."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First, the thing you should know: the abstract's claim that projective measurements alone restore universality is not supported by the companion methods paper you'll be reading. That paper (2508.10106) is explicit that hybridization is essential for T gates. So either the abstract is sloppy or the demonstrations in 10107 include hybridization. This needs fixing before anyone cites the headline.\n\nWhat's genuinely new: the numerical scale. Simulating braiding with measurement-based switching for 5 and 10 qubits (20 and 40 MZMs) with >99% fidelity under moderate disorder is a solid step forward for the TQC simulation toolkit. Bell and GHZ state prep and random circuits are concrete benchmarks. The time-dependent Pfaffian method looks like a useful tool for realistic device architectures. Credit where due.\n\nSoft spots: First, the universality claim. If the 'random unitary circuits' are only Clifford circuits, then >99% fidelity is not evidence of universal quantum computation. The abstract doesn't say whether T gates are included. The companion paper says hybridization is needed for T gates, so the simulations must include it to back the claim. Second, the title's 'arbitrary number of qubits' overstates a ten-qubit demonstration. Third, the projective measurements are modeled as ideal instantaneous parity projections. That's a standard approximation but it's an optimistic one; the paper should say how robust the scheme is to finite measurement times. The reader's concern about this is legitimate.\n\nThe mismatch between the abstract and the full text I was given is a genuine problem. I couldn't verify the methods because the actual paper wasn't provided. But the companion paper is coherent and the numerical results are plausible. This is a good paper for the TQC simulation community, but the authors need to clarify the gate set used in the random circuits and soften the universality language.\n\nRecommendation: send to peer review. The numerical work deserves a serious referee, but the abstract and the title need revision, and the referee should check whether the random circuits include non-Clifford gates.","headline":"A useful numerical study of measurement-assisted Majorana braiding, but the abstract oversells projective measurements as sufficient for universality when the companion paper says hybridization is required.","tokens_in":2590,"tokens_out":2805,"would_cite":true,"duration_ms":30964,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Adding projective parity measurements to Majorana braiding restores universal quantum computing for any number of qubits.","keywords":["topological quantum computation","Majorana zero modes","braiding","projective measurements","Clifford group","sparse and dense encodings","quantum fidelity","nanowire networks"],"falsifier":"A concrete check would be to benchmark the time-dependent Pfaffian simulation against exact diagonalization for a small system (e.g., four Majoranas) with a single projective measurement, and look for discrepancies in the post-measurement state. If the simulated parity outcomes or post-selected states disagree with exact evolution, or if an experimental nanowire device shows that a parity measurement takes long enough to decohere the qubits, the claimed universal fault-tolerant behavior would not hold.","tokens_in":1823,"feed_emoji":"⚛️","tokens_out":4764,"duration_ms":42271,"temperature":0.7,"pith_summary":"This paper claims that braiding Majorana zero modes by itself cannot supply the full Clifford group once more than two logical qubits are involved, and that projective parity measurements close the gap by moving qubits between sparse and dense encodings. The authors simulate this hybrid scheme on systems of two, five, and ten qubits, preparing Bell and GHZ states and running random circuits. They report circuit fidelities above 99 percent, and show the fidelity stays above that level for moderate static disorder. If correct, this gives a concrete route to universal, fault-tolerant topological quantum computers that can scale beyond a handful of qubits.","feed_headline":"Adding measurements makes Majorana quantum computing universal","feed_subtitle":"Simulations on up to ten qubits keep circuit fidelity above 99 percent under moderate disorder.","key_machinery":"The central object is the projective parity measurement, a joint projection onto the fermion parity of a subset of Majorana modes, used as a switch between the sparse encoding (one ancillary Majorana pair per logical qubit, fixing local parity) and the dense encoding (minimal Majorana count with only a global parity constraint). These measurements, combined with braiding and Majorana hybridization for continuous single-qubit rotations, form the universal gate set.","core_discovery":"The central claim is that measurement-assisted braiding is universal for any number of qubits. In the sparse encoding, each logical qubit uses an ancillary Majorana pair to pin the local parity, so braiding alone can perform all single-qubit Clifford gates but no entangling gates. In the dense encoding, multiple logical qubits share a global parity constraint, allowing entangling braids but losing some single-qubit Clifford gates. Projective parity measurements—joint projections, for example onto the parity of four Majoranas—switch the system between these encodings without leaving the computational subspace, so one can apply single-qubit gates in the sparse form, move to the dense form for","pith_inferences":["The hybrid protocol may be implementable with existing nanowire platforms that already demonstrate Majorana parity readout, since it requires only projective parity measurements of the kind already used in detection experiments.","The fidelity-versus-disorder curves could be used to extract an effective error rate per measurement, which would let experimenters compare this architecture against other candidate qubit platforms.","If projective measurements are not instantaneous but take a finite time, the protocol's error budget will depend on the ratio of measurement time to braid time; the simulation framework in the companion methods paper could be extended to model this directly."],"forward_implications":["Universal gate sets become available in Majorana-based architectures without needing braiding alone to cover the full Clifford group.","The sparse-to-dense switching protocol gives a concrete compilation strategy: do single-qubit Clifford gates in sparse form, entangling gates in dense form, and measure to transition.","The simulation method tracks time-dependent Majorana dynamics under braids, measurements, and disorder, so device parameters can be tested classically before experimental implementation.","Fidelity above 99 percent at moderate disorder suggests the topological protection survives realistic static noise in networks of up to ten qubits."],"supporting_citations":[],"fun_headline_variants":["Measurements unlock universal topological quantum computing for any qubit count","Measurement-assisted braiding hits 99% fidelity on 10-qubit simulations","Switching encodings via projective measurements makes braiding universal","Braiding plus measurements: universal quantum gates with >99% fidelity"],"cache_read_input_tokens":2816,"weakest_assumption_plain":"The fidelity results assume that projective parity measurements act as ideal, instantaneous projections onto parity subspaces and that the time-dependent Pfaffian simulation accurately captures the Majorana dynamics under braiding, measurement, and static disorder.","fun_headline_variants_meta":{"raw":{"variants":["Measurements unlock universal topological quantum computing for any qubit count","Measurement-assisted braiding hits 99% fidelity on 10-qubit simulations","Switching encodings via projective measurements makes braiding universal","Braiding plus measurements: universal quantum gates with >99% fidelity"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000247,"raw_usage":{"total_tokens":1361,"prompt_tokens":710,"completion_tokens":651,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":454,"completion_tokens_details":{"reasoning_tokens":576}},"tokens_in":454,"tokens_out":651,"duration_ms":7095,"temperature":1.0,"reasoning_tokens":576,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T20:38:02.843992+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete check would be to benchmark the time-dependent Pfaffian simulation against exact diagonalization for a small system (e.g., four Majoranas) with a single projective measurement, and look for discrepancies in the post-measurement state. If the simulated parity outcomes or post-selected states disagree with exact evolution, or if an experimental nanowire device shows that a parity measurement takes long enough to decohere the qubits, the claimed universal fault-tolerant behavior would not hold.","supporting_citations":[],"review_version":1}