{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YTGXDI2MT3X37X6WLMZGB7LSNE","short_pith_number":"pith:YTGXDI2M","schema_version":"1.0","canonical_sha256":"c4cd71a34c9eefbfdfd65b3260fd72693fa4d3a27ec06ae1f9b2bff7beeaa965","source":{"kind":"arxiv","id":"2506.11355","version":2},"attestation_state":"computed","paper":{"title":"Few Single-Qubit Measurements Suffice to Certify Any Quantum State","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Meghal Gupta, Ryan O'Donnell, William He","submitted_at":"2025-06-12T23:08:09Z","abstract_excerpt":"A fundamental task in quantum information science is state certification: testing whether a lab-prepared $n$-qubit state is close to a given hypothesis state. In this work, we show that every pure hypothesis state can be certified using only $O(n^2)$ single-qubit measurements applied to $O(n)$ copies of the lab state. Prior to our work, it was not known whether even subexponentially many single-qubit measurements could suffice to certify arbitrary states. This resolves the main open question of Huang, Preskill, and Soleimanifar (FOCS 2024, QIP 2024).\n  Our algorithm also showcases the power of"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.11355","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-12T23:08:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3b15a54148d037a7ad800b32a797ea9fd577eff0f9af0bf6b41c0c648c92c63c","abstract_canon_sha256":"485c72b3d702c47cc5d272239c0fb697c2ee843acbfa29020f907f025ebdf8b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:23.460786Z","signature_b64":"6A0nrKcIb+oiaHYCY5Npm7AFWhJFFrMQ/KI0gHRR1Ptq7V8bS//ypa+CX5RiTT4nmzF81i/fRhyuttvJZz71Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4cd71a34c9eefbfdfd65b3260fd72693fa4d3a27ec06ae1f9b2bff7beeaa965","last_reissued_at":"2026-07-05T11:37:23.460267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:23.460267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Few Single-Qubit Measurements Suffice to Certify Any Quantum State","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Meghal Gupta, Ryan O'Donnell, William He","submitted_at":"2025-06-12T23:08:09Z","abstract_excerpt":"A fundamental task in quantum information science is state certification: testing whether a lab-prepared $n$-qubit state is close to a given hypothesis state. In this work, we show that every pure hypothesis state can be certified using only $O(n^2)$ single-qubit measurements applied to $O(n)$ copies of the lab state. Prior to our work, it was not known whether even subexponentially many single-qubit measurements could suffice to certify arbitrary states. This resolves the main open question of Huang, Preskill, and Soleimanifar (FOCS 2024, QIP 2024).\n  Our algorithm also showcases the power of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11355","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.11355/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2506.11355","created_at":"2026-07-05T11:37:23.460336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.11355v2","created_at":"2026-07-05T11:37:23.460336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11355","created_at":"2026-07-05T11:37:23.460336+00:00"},{"alias_kind":"pith_short_12","alias_value":"YTGXDI2MT3X3","created_at":"2026-07-05T11:37:23.460336+00:00"},{"alias_kind":"pith_short_16","alias_value":"YTGXDI2MT3X37X6W","created_at":"2026-07-05T11:37:23.460336+00:00"},{"alias_kind":"pith_short_8","alias_value":"YTGXDI2M","created_at":"2026-07-05T11:37:23.460336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.17580","citing_title":"Certifying localizable quantum properties with constant sample complexity","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07460","citing_title":"Optimal Quantum State Testing Even with Limited Entanglement","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16578","citing_title":"Verifying random matrix product states with autoregressive local measurements","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE","json":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE.json","graph_json":"https://pith.science/api/pith-number/YTGXDI2MT3X37X6WLMZGB7LSNE/graph.json","events_json":"https://pith.science/api/pith-number/YTGXDI2MT3X37X6WLMZGB7LSNE/events.json","paper":"https://pith.science/paper/YTGXDI2M"},"agent_actions":{"view_html":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE","download_json":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE.json","view_paper":"https://pith.science/paper/YTGXDI2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.11355&json=true","fetch_graph":"https://pith.science/api/pith-number/YTGXDI2MT3X37X6WLMZGB7LSNE/graph.json","fetch_events":"https://pith.science/api/pith-number/YTGXDI2MT3X37X6WLMZGB7LSNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE/action/storage_attestation","attest_author":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE/action/author_attestation","sign_citation":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE/action/citation_signature","submit_replication":"https://pith.science/pith/YTGXDI2MT3X37X6WLMZGB7LSNE/action/replication_record"}},"created_at":"2026-07-05T11:37:23.460336+00:00","updated_at":"2026-07-05T11:37:23.460336+00:00"}