{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VHEAO3LXHUPK26JMBC3ZJC7LNG","short_pith_number":"pith:VHEAO3LX","schema_version":"1.0","canonical_sha256":"a9c8076d773d1ead792c08b7948beb698b2a20cf5e3fba5cc3fd7b748006926a","source":{"kind":"arxiv","id":"2004.07869","version":1},"attestation_state":"computed","paper":{"title":"Entanglement is Necessary for Optimal Quantum Property Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Jerry Li, Sebastien Bubeck, Sitan Chen","submitted_at":"2020-04-16T18:28:39Z","abstract_excerpt":"There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of the underlying state and thus remain outside the realm of what is currently experimentally feasible. A natural question is whether one can match the copy complexity of such algorithms using only independent---but possibly adaptively chosen---measurements on individual copies.\n  We answer this in the negative for arguably the most basic quantum testing problem:"},"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":"2004.07869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-16T18:28:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f1b4dc5e425d889494e9572185d1b8849f7d9243aad9a71655311d33e29da70c","abstract_canon_sha256":"91fe709540a95b79e0d06ac0491761ac513254b28d6df518dafa0051eb4c205e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:37.358703Z","signature_b64":"IyOjwom59M7L6KyTIhs2e1xrqRgusE8FUsEWX82dxXOA8t59FWZUEAJVW5eBUK8EZdNoAmtkBqFASrHjRkwfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9c8076d773d1ead792c08b7948beb698b2a20cf5e3fba5cc3fd7b748006926a","last_reissued_at":"2026-07-05T00:55:37.358223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:37.358223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement is Necessary for Optimal Quantum Property Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Jerry Li, Sebastien Bubeck, Sitan Chen","submitted_at":"2020-04-16T18:28:39Z","abstract_excerpt":"There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of the underlying state and thus remain outside the realm of what is currently experimentally feasible. A natural question is whether one can match the copy complexity of such algorithms using only independent---but possibly adaptively chosen---measurements on individual copies.\n  We answer this in the negative for arguably the most basic quantum testing problem:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07869","kind":"arxiv","version":1},"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/2004.07869/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":"2004.07869","created_at":"2026-07-05T00:55:37.358280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.07869v1","created_at":"2026-07-05T00:55:37.358280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07869","created_at":"2026-07-05T00:55:37.358280+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHEAO3LXHUPK","created_at":"2026-07-05T00:55:37.358280+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHEAO3LXHUPK26JM","created_at":"2026-07-05T00:55:37.358280+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHEAO3LX","created_at":"2026-07-05T00:55:37.358280+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG","json":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG.json","graph_json":"https://pith.science/api/pith-number/VHEAO3LXHUPK26JMBC3ZJC7LNG/graph.json","events_json":"https://pith.science/api/pith-number/VHEAO3LXHUPK26JMBC3ZJC7LNG/events.json","paper":"https://pith.science/paper/VHEAO3LX"},"agent_actions":{"view_html":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG","download_json":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG.json","view_paper":"https://pith.science/paper/VHEAO3LX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.07869&json=true","fetch_graph":"https://pith.science/api/pith-number/VHEAO3LXHUPK26JMBC3ZJC7LNG/graph.json","fetch_events":"https://pith.science/api/pith-number/VHEAO3LXHUPK26JMBC3ZJC7LNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG/action/storage_attestation","attest_author":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG/action/author_attestation","sign_citation":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG/action/citation_signature","submit_replication":"https://pith.science/pith/VHEAO3LXHUPK26JMBC3ZJC7LNG/action/replication_record"}},"created_at":"2026-07-05T00:55:37.358280+00:00","updated_at":"2026-07-05T00:55:37.358280+00:00"}