{"id":"44d03a0f-122e-4e87-a99a-d3a2854c59e6","arxiv_id":"2506.11909","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Weighted graph states from power-law Ising interactions can implement universal single- and two-qubit gates with average fidelity above 90% when the fall-off rate exceeds a threshold, and remain robust to unsharp measurements and disorder.","lead":"Long-range interacting spin systems can generate 'weighted graph states' that, after suitable measurements, implement quantum logic gates with high fidelity. This paper identifies the interaction fall-off rates above which single- and two-qubit gates beat classical limits and remain robust to noise and disorder.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The 90% thresholds are read off 5-qubit and 4-qubit graphs; without a size-scaling check, the universal-gate claim is not established for larger WGS.","rationale":"The paper's central quantitative claims are the thresholds above which average fidelities exceed 90% and near-unity saturation values. These numbers come from exact numerics on minimal graphs: a 5-qubit chain for single-qubit gates and a 4-qubit graph for CNOT. The reader's weakest assumption identifies the same limitation: the protocol is verified only on these small systems, and the thresholds may not carry over. I agree with that assessment and regard it as the most load-bearing concern. The paper has genuine independent support: the restricted-fidelity formulas for H, Rz(pi/2), and T are analytic, and the 90% thresholds all lie in the regime where the optimal corrections coincide with the standard pMBQC Pauli corrections, so the threshold claims do not depend on exotic input-dependent corrections. However, the universal-gate framing in the abstract goes beyond the minimal graphs. Power-law interactions with alpha just above threshold still give non-negligible couplings between qubits separated by several sites, and a larger graph would contain many such unwanted edges. Without a size-scaling test, the possibility remains that the reported thresholds are specific to the chosen graph sizes and geometries. This does not invalidate the smaller claim that the studied gate patterns achieve the reported fidelities, but it does mean the general 'universal single- and two-qubit gates' statement is conditional on a scalability check. The classical-limit inconsistency for CNOT (0.4 in the text versus 1/2 in the Fig. 2 caption) is a real but secondary typo, since every reported CNOT fidelity lies above both values. The reader's CONDITIONAL verdict already captures the needed qualification, so I do not propose changing it.","tokens_in":17066,"tokens_out":19610,"duration_ms":348759,"concrete_test":"Re-run the gate-fidelity optimization for H, T, and CNOT using larger graphs (e.g., 7-, 9-, and 11-qubit chains for single-qubit gates; 6- and 8-qubit analogues of the CNOT graph), with the same pMBQC measurement angles and the same exhaustive search over Pauli correction rules. Extract alpha_s and alpha_th for each size. If the fidelities at the Table I thresholds drop below 0.9 or alpha_th shifts by more than about 10%, the thresholds are size-dependent and the universal claim must be qualified; if the values stay stable, the concern is resolved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central numerical claims (Table I, Fig. 2) are obtained from a 5-qubit chain for single-qubit gates and a 4-qubit graph for CNOT. In these small graphs, every qubit is within a few sites of every other, so the weighted edges introduced by the power-law interaction are few and short. In a larger cluster realizing a full MBQC circuit, a power-law Ising evolution with alpha just above the reported thresholds creates long-range edges between distant computational branches; these edges are not present in the benchmark graphs and are not corrected by the Pauli correction rules optimized on the small graphs. The protocol also fixes the measurement bases to the pMBQC values, so there is no mechanism in the analysis that absorbs these extra edges. Consequently, the claimed thresholds alpha_th around 2.8 to 5.3 and the 90% statement could be a small-system artifact rather than a property of the resource-state family. The paper does not report finite-size scaling or an argument that the output fidelity is independent of graph size.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes using weighted graph states (WGS) generated by a power-law Ising Hamiltonian H_α to implement measurement-based quantum computation. For single-qubit gates (H, Rz(π/2), T) realized on a five-qubit chain and the CNOT gate on a four-qubit graph, the authors keep the measurement bases of the original MBQC protocol and optimize the local Pauli corrective unitaries, computing average gate fidelities. They report a threshold fall-off rate α_th above which fidelities exceed 90% (α_th≈2.78–2.89 for single-qubit gates and ≈5.31 for CNOT), near-unit fidelity for α≳4.5 (single-qubit) and α≳8.66 (CNOT), and fidelities above the classical bound for some strongly long-range cases with α<2. They also analyze the effect of unsharp measurements and of quenched Gaussian disorder in the coupling strengths.","tokens_in":17211,"tokens_out":8845,"duration_ms":97010,"significance":"The protocol is conceptually appealing: it treats a naturally present long-range interaction as a resource rather than a nuisance, and it provides quantitative benchmarks (Table I, Fig. 2) that are directly testable in small trapped-ion or cold-atom systems. The analytic restricted-fidelity formulas (Eqs. (11), (12), (B1)) are a useful check on the numerics, and the robustness study covers two realistic imperfections. However, the universal-gate claim is supported only by finite-size numerics on four- and five-qubit graphs, and several specification gaps currently prevent the results from being reproduced or extrapolated.","major_comments":[{"comment":"The headline thresholds (α_th≈2.78–2.89 and ≈5.31, saturation at α≈4.5 and 8.66) are obtained from a five-qubit chain and a four-qubit graph, yet the figure caption describes the five-qubit WGS as 'part of a bigger cluster'. In an actual MBQC resource, the power-law Hamiltonian H_α generates long-range edges not only within the gate block but also between that block and the rest of the cluster. These additional edges are absent from the simulated graphs and are not corrected by the Pauli corrections optimized on the small graphs, because the measurement bases are fixed to the pMBQC values. Without a finite-size scaling analysis or an argument that the extra edges can be absorbed, the claimed thresholds and the statement that WGS is a resilient and effective resource for MBQC are not established beyond the specific small graphs. This is the central claim of the paper, so it needs either a scaling check or a clearly restricted claim.","section":"Sec. III, Fig. 2, Table I"},{"comment":"The classical fidelity threshold for the CNOT gate is stated inconsistently: Fig. 2 says F_c=1/2 for two-qubit gates, while Sec. III B states F_c=0.4. If the correct value for a two-qubit gate is 1/2, the claim that the CNOT fidelity exceeds the classical limit for all α is not supported, because the text only establishes F>0.4. If 0.4 is correct, the figure caption and the abstract should be corrected. The nonclassical-advantage claim in the abstract and in Sec. III B depends on this value, so the discrepancy must be resolved and the chosen definition justified with a citation.","section":"Sec. III B and Fig. 2 caption"},{"comment":"The disorder model is underspecified. The Hamiltonian is defined with g_kl=J/|k-l|^α, but the disordered case refers to 'site-dependent couplings {J_i}' without giving the functional form of g_kl in terms of the J_i (e.g., J_i J_j/|k-l|^α or independent bond disorder). Moreover, the quenched average is computed from 10^3 realizations, but no error bars, standard deviations, or convergence checks are reported. Since the robustness claim is a main result of the paper, the model and the statistical uncertainty of the plotted curves should be specified.","section":"Sec. V, Eq. (14)"},{"comment":"The optimization over corrective unitaries U^{α,s}_{c,G} is not fully described. It is not stated whether the maximum in Eq. (6) is taken by exhaustive search over the affine Pauli family (5), how many outcome branches are optimized jointly, or which algorithm was used. The statement that 'other local measurements do not help' (Sec. III A) is asserted without supporting data. Because the plotted fidelities are the output of this optimization, the numerical results in Fig. 2 and Table I are not reproducible as written, and the claim about measurement optimality should either be documented in an appendix or removed.","section":"Sec. III, Eq. (6)"}],"minor_comments":[{"comment":"The second M^{λ,n}_{s,G} in the trace is missing a dagger; compare with Eq. (4).","section":"Eq. (3)"},{"comment":"The quantities α_s and α_th_min are used without definitions in the table caption; define them in the caption or in the text near the table.","section":"Table I"},{"comment":"The notation V I(G), V M(G), V O(G) is typeset inconsistently (e.g., V^I versus V I) in the text; please unify the notation.","section":"Sec. II"},{"comment":"The inset showing α∈(0.4,1.8) is not mentioned in the caption; please describe it.","section":"Fig. 5"},{"comment":"The presence of both sine and cosine terms inside a single cosine prefactor makes the expression easy to misread; please check the parentheses and define all variables in one place.","section":"Appendix B, Eq. (B1)"},{"comment":"The classical fidelity limit for two-qubit gates should be defined with a citation in the text, not only in the figure caption.","section":"Sec. III B"}],"recommendation":"major_revision","confidential_remarks":"The paper is a numerical study with a clear idea, but the universal-gate claim overreaches the demonstrated system sizes. The classical-threshold inconsistency and the underspecified disorder model are fixable. I would be willing to review a revised version that either adds a scaling analysis or explicitly limits the claims to the small graphs studied."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a credible numerical study with a genuinely new angle—using power-law weighted graph states as MBQC resources, optimizing corrective unitaries, and mapping out fidelity as a function of the fall-off exponent. The analytic expressions for restricted fidelities (Eqs. 11, 12, B1) and the consistency between those and the numerical curves give me confidence the small-system results are correct. The robustness checks against unsharp measurements and disorder are useful, even if the disorder averages lack error bars and no code/data are provided.\n\nThe main soft spot is the size scaling. The 90% thresholds and saturation values come from a 5-qubit chain and a 4-qubit graph. In a full MBQC circuit, many such gates are connected into a larger cluster, and the power-law interaction would create extra edges between distant branches. Those edges aren't present in the benchmark graphs, and the Pauli correction rules were optimized on those small graphs. The paper doesn't report any finite-size scaling or an argument that the fidelity is size-independent. That means the 'universal' claim is not yet established for practical MBQC; it's a proof-of-principle for the building blocks. This isn't a fatal flaw—the results are still worth publishing—but the conclusions should be tempered, or a scaling study added.\n\nOther issues: the classical limit for two-qubit gates is given as 0.4 in the text but 1/2 in the Fig. 2 caption; that's inconsistent and should be fixed. The disorder study uses 10^3 realizations but no error bars, so it's hard to judge the spread. The measurement bases are fixed to pMBQC values; the authors say they numerically checked that other bases don't help for the Hadamard, but not for the other gates. That's a minor gap.\n\nWho is this for: experimental groups working with trapped ions or cold atoms interested in whether their natural long-range interactions can produce a usable MBQC resource without engineering NN couplings. They'll get concrete threshold numbers and robustness trends.\n\nMy verdict: send it to peer review. The core results are credible, the analytic support is a plus, and the topic is relevant. But the authors should either demonstrate size scaling or explicitly restrict the claims to the small-gate level, and they should fix the reproducibility issues (code/data, error bars). A serious referee could make the paper much stronger.","headline":"Solid small-graph numerics for MBQC with power-law weighted graph states, but the universal claim needs a size-scaling check before it generalizes.","tokens_in":17751,"tokens_out":3432,"would_cite":true,"duration_ms":40692,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Weighted graph states from power-law Ising interactions can implement universal measurement-based quantum gates, with average fidelity above 90% once the fall-off rate $\\alpha$ passes thresholds near 2.8 for single-qubit gates and 5.3 for…","keywords":["measurement-based quantum computation","weighted graph states","long-range Ising model","power-law interactions","fall-off rate","average gate fidelity","unsharp measurements","disorder"],"falsifier":"A direct numerical simulation of the same protocol on a larger resource, for example a ten-qubit chain at $\\alpha=3$ implementing $H$ followed by $T$, would settle whether the 90% threshold persists: if $\\bar{F}_G$ falls below 0.9, the threshold is an artifact of the small graphs studied rather than a general property. An ion-trap experiment with effective $\\alpha\\approx3$ measuring the $T$-gate process fidelity and comparing with 0.9 would test the same claim.","tokens_in":16857,"feed_emoji":"⚛️","tokens_out":13033,"duration_ms":148824,"temperature":0.7,"pith_summary":"This paper establishes that the entangled states generated by power-law (long-range) Ising interactions can serve as the resource for measurement-based quantum computation (MBQC), not just as a source of error to be suppressed. Evolving a product state under $H_\\alpha=\\sum_{k<l} \\frac{J}{|k-l|^\\alpha}\\left(\\frac{1-\\sigma_z^{(k)}}{2}\\right)\\left(\\frac{1-\\sigma_z^{(l)}}{2}\\right)$ for time $\\pi$ produces a weighted graph state; using the same local measurements as the original one-way quantum computer but re-optimizing the local Pauli corrections, the paper reports average gate fidelities above the classical benchmark for Hadamard, $\\pi/2$-phase, $T$, and CNOT gates over the relevant ranges of $\\alpha$. Above a threshold, $\\alpha \\approx 2.8$ for single-qubit gates and $\\alpha \\approx 5.31$ for CNOT, the average fidelity exceeds 90%, and it saturates near unity for $\\alpha \\gtrsim 4.5$ or $\\alpha \\gtrsim 8.66$, respectively. In the genuinely long-range regime $\\alpha<2$, optimizing corrections still yields nonclassical fidelities, up to 0.84 for the $T$ gate. The protocol is also reported to tolerate noisy (unsharp) measurements and static disorder in the couplings, which matters because both are unavoidable in the trapped-ion and cold-atom platforms where such Hamiltonians arise.","feed_headline":"Long-range spin interactions clear 90% quantum gate fidelity","feed_subtitle":"Weighted graph states from power-law Ising models run Hadamard, T, and CNOT gates once α crosses the threshold.","key_machinery":"The load-bearing object is the weighted graph state $|\\Phi_e(\\alpha)\\rangle$ formed by evolving a product of $|+\\rangle$ states with the power-law Ising Hamiltonian $H_\\alpha$ for time $\\pi$; the exponent $\\alpha$ (the fall-off rate) tunes continuously between genuinely long-range interactions ($\\alpha<2$) and the nearest-neighbor cluster-state limit ($\\alpha\\to\\infty$). The protocol keeps the local projective measurement bases of the original MBQC, with angles $\\eta_k$ fixed by the target gate, and compensates for the deformed state by optimizing over local Pauli corrections $U_{c,G}^{\\alpha,s}=\\sigma_x^{c_0+\\sum c_k s_k}\\sigma_z^{d_0+\\sum d_k s_k}$ on each outcome string $s$. The quality measure is the average gate fidelity $\\bar{F}_G$, evaluated through the Hilbert-Schmidt formula from the measurement map $\\Lambda_{\\alpha}^{\\lambda,n}$; its comparison with the classical benchmarks produces the reported thresholds. Unsharp measurements are modeled by replacing projectors with $\\lambda|\\eta_s^k\\rangle\\langle\\eta_s^k|+(1-\\lambda)I/2$, and disorder by quenched Gaussian couplings $\\{J_i\\}$.","core_discovery":"The paper's central claim is that a weighted graph state produced at time $\\pi$ by a variable-range Ising Hamiltonian is a viable MBQC resource, provided the local corrective unitaries are chosen for the actual fall-off rate $\\alpha$ rather than taken from the nearest-neighbor limit. For single-qubit gates on a five-qubit chain and for CNOT on a four-qubit graph, the average gate fidelity $\\bar{F}_G$, computed from the CPTP map that includes measurements and corrections, exceeds the classical benchmark once the state is not too long-ranged (for Hadamard, $\\alpha\\gtrsim1.82$; for CNOT, for all $\\alpha$). With optimized corrections, the maximum fidelity in the genuinely long-range regime $\\alpha<2$ reaches 0.84 for the $T$ gate and 0.76 for CNOT, and the fidelity crosses 0.9 at $\\alpha_\\mathrm{th}^{\\min}\\approx 2.8$ for single-qubit gates and $\\approx5.31$ for CNOT. For $\\alpha \\gtrsim 4.5$ (single-qubit) and $\\alpha\\gtrsim 8.66$ (CNOT) the fidelities saturate to unity up to $O(10^{-3})$, recovering the ideal cluster-state behavior. The conclusion drawn is that finite-range, non-nearest-neighbor interactions can support universal MBQC.","pith_inferences":["Optimizing the local measurement angles as well as the corrective unitaries, which the paper does systematically only for the Hadamard case, is a natural extension; it could lower the 90% thresholds or raise fidelities in the $\\alpha<2$ regime.","The thresholds are established for one five-qubit chain and one four-qubit graph; whether they survive in larger resource states, other geometries, or multi-gate circuits is an open scaling question that the small-system numerics do not answer.","The robustness claims cover white-noise unsharp measurements and random static disorder drawn from a Gaussian distribution; other realistic errors, such as dephasing during the entangling evolution or correlated measurement noise, are not modeled.","Because finite-$\\alpha$ weighted graph states are non-stabilizer states, the scheme provides MBQC with a non-stabilizer resource from the start; whether this helps or hurts fault tolerance is a question the paper leaves open."],"forward_implications":["Universal single-qubit gates ($H$, $R_z(\\pi/2)$, $T$) and CNOT can be run on weighted graph states from power-law Ising models with average fidelity above the classical benchmark, so perfect nearest-neighbor cluster states are not necessary for MBQC.","Above $\\alpha\\approx2.8$ for single-qubit gates and $\\alpha\\approx5.31$ for CNOT, the average fidelity exceeds 90%, the level currently quoted for single-qubit gates in real architectures; beyond $\\alpha\\approx4.5$ and $8.66$ the fidelities saturate to near unity.","In the truly long-range regime $\\alpha<2$, optimizing corrections yields maximum fidelities of 0.84 for the $T$ gate and 0.76 for CNOT, so long-range interactions can act as a computational resource rather than only a noise source.","Unsharp measurements degrade fidelity only mildly: at $\\lambda=0.85$ the relative fidelity loss saturates around 5--17% for single-qubit gates depending on how many measurements are noisy, and around 6--11% for CNOT.","Gaussian disorder in the coupling strengths leaves the quenched average fidelity close to the ordered value, with relative errors at most about 4.6% for single-qubit gates and 2% for CNOT at disorder strength $\\sigma=0.1$."],"supporting_citations":[{"why":"Defines the one-way quantum computer and the cluster-state measurement protocol that this work adapts to weighted graph states.","marker":"[7]"},{"why":"Supplies the explicit measurement angles and corrective Pauli unitaries for cluster-state MBQC, the baseline (pMBQC) protocol used here.","marker":"[8]"},{"why":"Introduces weighted graph states and their generation from long-range Ising-type interactions, the resource family under study.","marker":"[24]"},{"why":"Characterizes the time-$\\pi$ states of variable-range Ising models and their fall-off-rate transitions, motivating the state $|\\Phi_e(\\alpha)\\rangle$ used for the gates.","marker":"[50]"},{"why":"Gives the classical fidelity benchmarks used to decide when the average gate fidelity is nonclassical.","marker":"[51]"},{"why":"Provides the Hilbert-Schmidt formula used to evaluate average gate fidelity from the implemented CPTP map.","marker":"[81]"},{"why":"Models noisy measurements as unsharp POVMs with the white-noise parameter $\\lambda$ used in the robustness analysis.","marker":"[52–54]"},{"why":"Quotes the roughly 90% single-qubit gate fidelity of current hardware, motivating the 90% accuracy threshold.","marker":"[83]"},{"why":"Supports the claim that site-dependent disordered couplings can be realized in cold-atom optical lattices, grounding the disorder analysis.","marker":"[69–71]"}],"fun_headline_variants":["Power-law Ising states hit 90% gate fidelity","Variable-range Ising models enable universal MBQC","Long-range spin interactions beat classical gate limits","Robust MBQC with long-range Ising interactions","Weighted graph states from power-law Ising models beat classical limits"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the time-$\\pi$ weighted graph state, together with the unchanged local measurement bases and a finite family of optimized local Pauli corrections, is sufficient to realize each gate at the reported fidelity; this has been checked numerically only on a five-qubit chain for single-qubit gates and a four-qubit graph for CNOT.","fun_headline_variants_meta":{"raw":{"variants":["Power-law Ising states hit 90% gate fidelity","Variable-range Ising models enable universal MBQC","Long-range spin interactions beat classical gate limits","Robust MBQC with long-range Ising interactions","Weighted graph states from power-law Ising models beat classical limits"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001145,"raw_usage":{"total_tokens":4783,"prompt_tokens":1010,"completion_tokens":3773,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":626,"completion_tokens_details":{"reasoning_tokens":3696}},"tokens_in":626,"tokens_out":3773,"duration_ms":31554,"temperature":1.0,"reasoning_tokens":3696,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T01:00:44.187490+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct numerical simulation of the same protocol on a larger resource, for example a ten-qubit chain at $\\alpha=3$ implementing $H$ followed by $T$, would settle whether the 90% threshold persists: if $\\bar{F}_G$ falls below 0.9, the threshold is an artifact of the small graphs studied rather than a general property. An ion-trap experiment with effective $\\alpha\\approx3$ measuring the $T$-gate process fidelity and comparing with 0.9 would test the same claim.","supporting_citations":[{"cited_title":"Ohliger and J","cited_arxiv_id":null,"evidence_quote":"Introduces weighted graph states and their generation from long-range Ising-type interactions, the resource family under study."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Characterizes the time-$\\pi$ states of variable-range Ising models and their fall-off-rate transitions, motivating the state $|\\Phi_e(\\alpha)\\rangle$ used for the gates."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the classical fidelity benchmarks used to decide when the average gate fidelity is nonclassical."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the Hilbert-Schmidt formula used to evaluate average gate fidelity from the implemented CPTP map."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Quotes the roughly 90% single-qubit gate fidelity of current hardware, motivating the 90% accuracy threshold."}],"review_version":1}