{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:U4B5HC6AV4D3TF6JPFJJMBKBHA","short_pith_number":"pith:U4B5HC6A","schema_version":"1.0","canonical_sha256":"a703d38bc0af07b997c97952960541380a471a86c86a3cf12f1125106033fbeb","source":{"kind":"arxiv","id":"2605.15106","version":1},"attestation_state":"computed","paper":{"title":"Scalable self-testing of generic multipartite quantum states","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A protocol self-tests almost all n-qubit states robustly with only polynomial sample complexity.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elias X. Huber, Jinchang Liu, Xingjian Zhang, Xiongfeng Ma, Zhenyu Du","submitted_at":"2026-05-14T17:23:40Z","abstract_excerpt":"Characterizing large quantum systems with minimal assumptions is a central challenge in quantum information science. Self-testing provides the strongest form of certification by identifying the underlying quantum state solely from observed measurement statistics. However, existing self-testing methods for generic $n$-partite states face a scalability barrier, requiring exponentially many samples in the system size. In this work, we overcome this barrier by introducing a protocol that robustly self-tests almost all $n$-qubit states with only polynomial sample complexity. The key ingredient is a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15106","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-14T17:23:40Z","cross_cats_sorted":[],"title_canon_sha256":"b5f647b1d43eb65aebc2d24119df686f264d490968fa8b981c76a783cf285209","abstract_canon_sha256":"8e35e653018ceba6642ea05c1393b97bbac6aeac929995152a6f135065168a35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"a703d38bc0af07b997c97952960541380a471a86c86a3cf12f1125106033fbeb","last_reissued_at":"2026-05-17T21:57:19.118901Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:25.787074Z"},"graph_snapshot":{"paper":{"title":"Scalable self-testing of generic multipartite quantum states","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A protocol self-tests almost all n-qubit states robustly with only polynomial sample complexity.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elias X. Huber, Jinchang Liu, Xingjian Zhang, Xiongfeng Ma, Zhenyu Du","submitted_at":"2026-05-14T17:23:40Z","abstract_excerpt":"Characterizing large quantum systems with minimal assumptions is a central challenge in quantum information science. Self-testing provides the strongest form of certification by identifying the underlying quantum state solely from observed measurement statistics. However, existing self-testing methods for generic $n$-partite states face a scalability barrier, requiring exponentially many samples in the system size. In this work, we overcome this barrier by introducing a protocol that robustly self-tests almost all $n$-qubit states with only polynomial sample complexity. The key ingredient is a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we overcome this barrier by introducing a protocol that robustly self-tests almost all n-qubit states with only polynomial sample complexity","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A protocol self-tests generic n-qubit states with polynomial sample complexity via device-independent multipartite Pauli measurements implemented with linear Bell pairs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A protocol self-tests almost all n-qubit states robustly with only polynomial sample complexity.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d2582459fa2a22b50d6110b9a8334aa5d31596c6370651218f9fea89555a3817"},"source":{"id":"2605.15106","kind":"arxiv","version":1},"verdict":{"id":"229f6bcb-2d87-4459-9732-8f7d50f63a65","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:01:05.677121Z","strongest_claim":"we overcome this barrier by introducing a protocol that robustly self-tests almost all n-qubit states with only polynomial sample complexity","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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"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","pith_extraction_headline":"A protocol self-tests almost all n-qubit states robustly with only polynomial sample complexity."},"references":{"count":36,"sample":[{"doi":"","year":null,"title":"Self-testing up toglobaltranspose We now remove the undesirable partial transpose terms in Lemma S3, thereby yielding a robust DI protocol that implements multipartite Pauli measurements up to only an","work_id":"a9b0e432-07db-42ce-9f3b-3f51888f80dd","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The robust analysis is formalized in the following lemma","work_id":"deceb9f2-d543-441c-8fcf-e4ef1b35af31","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Therefore, tr     X ι∈{0,1}2 LTι B′ 0B′ 1 ⊗ |ι⟩ ⟨ι|B′′ 0 B′′ 1   Γ(ψ)   ≥ 2 3 tr (|01⟩ ⟨01|+|10⟩ ⟨10|)B′′ 0 B′′ 1 Γ(ψ) (D23) S16 Combining the above two equations gives tr (|01⟩ ⟨01|+|10⟩ ⟨10|","work_id":"3012dcdf-426e-4938-a78b-eb6b30e9ea8b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The definition of the functionfis given in (D2)","work_id":"011af501-069e-4cad-963c-7c1ff474ad8e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"This is because Γ l requires classical communication betweenA l andB l for the Pauli correction","work_id":"e5380b73-5637-4972-85bc-ce73c7af57f2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":36,"snapshot_sha256":"87c872da882b3e066bbdc840780075368b6a156659bd545bbeb4ebfaf01e71b8","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a9157df8cf1c88aefe703f1befc14ef479aa133017e1849829bb1e6bd54cf010"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.15106","created_at":"2026-05-17T21:18:33.348893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15106v1","created_at":"2026-05-17T21:18:33.348893+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4B5HC6AV4D3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4B5HC6AV4D3TF6J","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4B5HC6A","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA","json":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA.json","graph_json":"https://pith.science/api/pith-number/U4B5HC6AV4D3TF6JPFJJMBKBHA/graph.json","events_json":"https://pith.science/api/pith-number/U4B5HC6AV4D3TF6JPFJJMBKBHA/events.json","paper":"https://pith.science/paper/U4B5HC6A"},"agent_actions":{"view_html":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA","download_json":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA.json","view_paper":"https://pith.science/paper/U4B5HC6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15106&json=true","fetch_graph":"https://pith.science/api/pith-number/U4B5HC6AV4D3TF6JPFJJMBKBHA/graph.json","fetch_events":"https://pith.science/api/pith-number/U4B5HC6AV4D3TF6JPFJJMBKBHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA/action/storage_attestation","attest_author":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA/action/author_attestation","sign_citation":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA/action/citation_signature","submit_replication":"https://pith.science/pith/U4B5HC6AV4D3TF6JPFJJMBKBHA/action/replication_record"}},"created_at":"2026-05-17T21:18:33.348893+00:00","updated_at":"2026-05-17T21:57:19.118994+00:00"}