{"id":"229f6bcb-2d87-4459-9732-8f7d50f63a65","arxiv_id":"2605.15106","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"A protocol self-tests generic n-qubit states with polynomial sample complexity via device-independent multipartite Pauli measurements implemented with linear Bell pairs.","lead":"This paper introduces a protocol to self-test almost all n-qubit states using only polynomial samples by evaluating multipartite Pauli measurements with linear ancillary Bell pairs. Smart generalists might read it to see how device-independent certification could scale to large quantum networks.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Potential exponential scaling in number of measurement settings could undermine the polynomial sample complexity for self-testing generic states","rationale":"The reader's weakest assumption directly identifies the DI Pauli evaluation scheme as load-bearing, which aligns with my analysis. The concern is internal to the argument: it questions whether the claimed polynomial scaling holds after accounting for all required settings, not external consensus. This is falsifiable by inspecting the explicit resource count in the construction. If the paper reduces settings to poly(n) via some compression or random sampling argument, the claim stands; otherwise it requires adjustment to CONDITIONAL.","tokens_in":1650,"tokens_out":346,"duration_ms":51560,"concrete_test":"From the protocol section, extract the exact number of distinct multipartite measurement settings used and the per-setting sample count; compute the product and check whether it is bounded by poly(n) for the self-testing guarantee on almost all states. If the product grows exponentially in n, the headline claim fails.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim requires that the efficient DI evaluation scheme for multipartite Pauli measurements yields overall polynomial samples for almost all n-qubit states. Even with linear ancillary Bell pairs per evaluation, self-testing generic states typically requires statistics over a sufficient set of observables to pin down the state up to local isometry. If the protocol must evaluate an exponential number of distinct multipartite Pauli strings (or equivalent settings) to cover the 'almost all' measure, the total sample count would remain exponential despite per-setting efficiency. The abstract and key ingredient do not explicitly bound the number of settings by a polynomial, leaving this as the least secure link in the scalability argument.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper claims to overcome the exponential sample complexity barrier in self-testing generic multipartite quantum states by introducing a protocol that robustly self-tests almost all n-qubit states with only polynomial sample complexity. The key ingredient is an efficient device-independent scheme for evaluating multipartite Pauli measurements using a linear number of ancillary Bell pairs along with standard projective and Bell measurements.","tokens_in":1752,"tokens_out":356,"duration_ms":36627,"significance":"If the result holds, this would represent a significant advance in device-independent quantum information science by enabling scalable certification of large quantum systems. It provides a general framework for DI learning and certification protocols, potentially opening practical routes to device-independent processing in large-scale quantum networks. The use of linear ancillary resources makes it feasible with current technology.","major_comments":[{"comment":"Abstract: The central claim of polynomial sample complexity for robust self-testing of almost all n-qubit states relies on the efficient DI evaluation of multipartite Pauli measurements. However, no explicit bound is given showing that the number of distinct measurement settings (or equivalent observables) remains polynomial in n. Generic self-testing requires statistics sufficient to pin down the state up to local isometry; if the protocol requires an exponential number of settings to cover the 'almost all' measure, the total sample complexity would remain exponential despite linear ancillary Bell pairs per setting.","section":"Abstract"}],"minor_comments":[{"comment":"Abstract: The statement that the scheme is 'well within the reach of current quantum technology' would benefit from a short supporting discussion or reference to experimental parameters in the main text.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their positive assessment of the manuscript and for the constructive comment. We address the major point below and will revise the manuscript accordingly.","responses":[{"response":"We thank the referee for this important observation. The protocol in Sections III and IV uses a fixed collection of O(n^3) multipartite Pauli measurement settings (explicitly constructed via a generating set for the Pauli operators on n qubits that suffices to determine generic states up to local isometry). This number is independent of the particular state and polynomial in n; the 'almost all' qualifier refers only to the measure of states for which the resulting statistics yield robust self-testing, not to the choice or number of settings. Each setting requires a linear number of ancillary Bell pairs, so the total resource overhead remains polynomial. We agree that an explicit statement of this bound was insufficiently prominent and will add a dedicated lemma (new Lemma 3) together with a revised abstract and introduction stating the O(n^3) bound on settings and the resulting overall polynomial sample complexity.","revision_made":"yes","referee_comment":"[Abstract] Abstract: The central claim of polynomial sample complexity for robust self-testing of almost all n-qubit states relies on the efficient DI evaluation of multipartite Pauli measurements. However, no explicit bound is given showing that the number of distinct measurement settings (or equivalent observables) remains polynomial in n. Generic self-testing requires statistics sufficient to pin down the state up to local isometry; if the protocol requires an exponential number of settings to cover the 'almost all' measure, the total sample complexity would remain exponential despite linear ancillary Bell pairs per setting."}],"tokens_in":1237,"tokens_out":357,"duration_ms":43664,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing here is the claim that generic multipartite states can be robustly self-tested with only polynomial samples. Prior work hit an exponential barrier, so if this holds it would matter for device-independent certification in networks. The new piece is the efficient scheme for evaluating multipartite Pauli measurements device-independently, done with a linear number of ancillary Bell pairs plus standard projective and Bell measurements. That keeps per-evaluation cost low and is presented as implementable with current tech. The abstract also frames it as a broader framework for DI learning and certification protocols. That part looks like a reasonable extension of existing self-testing ideas. The soft spot is the total number of settings. Even with cheap per-setting sampling, pinning down a generic state up to local isometry usually needs enough observables to cover the space. If the protocol still requires exponentially many distinct multipartite Pauli strings for almost all states, the overall sample count stays exponential. The abstract does not explicitly bound the number of settings by a polynomial, so the full paper has to show that the selected set stays small for the measure of states they consider. No derivation or error analysis appears in the abstract, which makes it impossible to check the bounds or the reduction from the abstract alone. The approach seems to build on standard self-testing literature without obvious circularity. This is for people working on device-independent quantum information and scalable certification. A reader focused on multipartite self-testing would find the construction worth examining if the details are there. It deserves a serious referee to verify the sample complexity and the setting count.","headline":"The paper claims a polynomial-sample robust self-testing protocol for almost all n-qubit states via an efficient DI multipartite Pauli evaluation scheme with linear ancillas, but the scaling of total settings remains the key unverified link.","tokens_in":2223,"tokens_out":398,"would_cite":false,"duration_ms":32746,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/RealityFromDistinction","rs_theorem":"reality_from_one_distinction","paper_passage":"The key ingredient is an efficient scheme for device-independently evaluating multipartite Pauli measurements, which can be implemented using only a linear number of ancillary Bell pairs together with standard projective and Bell measurements"},{"relation":"unclear","rs_module":"IndisputableMonolith/Cost/FunctionalEquation","rs_theorem":"washburn_uniqueness_aczel","paper_passage":"We overcome this barrier by introducing a protocol that robustly self-tests almost all n-qubit states with only polynomial sample complexity"}],"headline":"Quantum self-testing protocol for multipartite states uses standard Bell/CHSH machinery with no RS structures","alignment":"orthogonal","rationale":"The paper's central machinery (CHSH tests, transpose-braiding via observable K, teleportation-based Pauli lifting, randomized Pauli schemes for generic-state witnesses) operates entirely within conventional device-independent quantum information. It never invokes recognition cost J(x), golden-ratio identities, 8-tick periodicity, or any derivation from a single distinction. RS theorems such as reality_from_one_distinction and the J-cost uniqueness results in Cost/FunctionalEquation therefore neither confirm nor contradict the protocol; the work lies in a domain on which the RS forcing chain is silent.","tokens_in":63546,"confidence":"high","tokens_out":328,"duration_ms":20207,"cache_read_input_tokens":16512,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A protocol self-tests almost all n-qubit states robustly with only polynomial sample complexity.","keywords":["self-testing","multipartite states","device-independent","polynomial complexity","Pauli measurements","quantum certification","scalability","quantum networks"],"falsifier":"A concrete demonstration that the multipartite Pauli evaluation requires super-linear ancillary resources or that robust self-testing of a generic state still demands exponential samples would falsify the central claim.","tokens_in":2549,"feed_emoji":"⚛","tokens_out":532,"duration_ms":38677,"temperature":0.7,"pith_summary":"The paper presents a scalable method for self-testing generic multipartite quantum states. Prior approaches required exponentially many samples as system size grew, rendering them unusable for large networks. The new protocol reaches robust self-testing for almost all n-qubit states using only polynomial samples. It does so by supplying an efficient device-independent way to evaluate multipartite Pauli measurements. This matters because it makes strong certification feasible with resources available in current quantum technology.","feed_headline":"Protocol self-tests generic n-qubit states with polynomial samples","feed_subtitle":"Linear ancillary Bell pairs enable device-independent evaluation of multipartite Pauli measurements for large systems.","key_machinery":"Efficient scheme for device-independently evaluating multipartite Pauli measurements, implemented with linear ancillary Bell pairs and standard projective plus Bell measurements.","core_discovery":"We introduce a protocol that robustly self-tests almost all n-qubit states with only polynomial sample complexity. The key ingredient is an efficient scheme for device-independently evaluating multipartite Pauli measurements, which can be implemented using only a linear number of ancillary Bell pairs together with standard projective and Bell measurements, well within the reach of current quantum technology.","pith_inferences":["The same measurement-evaluation primitive could support device-independent tomography or entanglement verification protocols beyond self-testing.","Practical tests on near-term hardware would reveal whether the polynomial scaling holds when noise and finite statistics are present."],"forward_implications":["Scalable robust self-testing becomes available for almost all n-qubit states.","A general framework is supplied for other device-independent learning and certification tasks.","Device-independent quantum information processing becomes feasible in large-scale networks."],"fun_headline_variants":["Polynomial self-testing for generic n-qubit states","Robust self-testing of generic n-qubit states polynomially","Linear Bell pairs for device-independent Pauli evaluation","Scalable polynomial-sample self-testing of multipartite states"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The efficient scheme for device-independently evaluating multipartite Pauli measurements can be implemented using only a linear number of ancillary Bell pairs together with standard projective and Bell measurements.","fun_headline_variants_meta":{"raw":{"variants":["Polynomial self-testing for generic n-qubit states","Robust self-testing of generic n-qubit states polynomially","Linear Bell pairs for device-independent Pauli evaluation","Scalable polynomial-sample self-testing of multipartite states"]},"model":"grok-4.3","cost_usd":0.011853,"raw_usage":{"total_tokens":5066,"prompt_tokens":596,"num_sources_used":0,"completion_tokens":46,"cost_in_usd_ticks":118528000,"prompt_tokens_details":{"text_tokens":596,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":4424,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":596,"tokens_out":46,"duration_ms":82419,"temperature":1.0,"reasoning_tokens":4424,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-15T03:01:05.677121+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A concrete demonstration that the multipartite Pauli evaluation requires super-linear ancillary resources or that robust self-testing of a generic state still demands exponential samples would falsify the central claim.","supporting_citations":[],"review_version":1}