{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RLWP27DV72MRDTA4K33MPLZQWL","short_pith_number":"pith:RLWP27DV","schema_version":"1.0","canonical_sha256":"8aecfd7c75fe9911cc1c56f6c7af30b2d516259bf04097e06db5281d1409616d","source":{"kind":"arxiv","id":"1701.06321","version":2},"attestation_state":"computed","paper":{"title":"Quantum entanglement, sum of squares, and the log rank conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Boaz Barak, David Steurer, Pravesh Kothari","submitted_at":"2017-01-23T10:25:42Z","abstract_excerpt":"For every $\\epsilon>0$, we give an $\\exp(\\tilde{O}(\\sqrt{n}/\\epsilon^2))$-time algorithm for the $1$ vs $1-\\epsilon$ \\emph{Best Separable State (BSS)} problem of distinguishing, given an $n^2\\times n^2$ matrix $\\mathcal{M}$ corresponding to a quantum measurement, between the case that there is a separable (i.e., non-entangled) state $\\rho$ that $\\mathcal{M}$ accepts with probability $1$, and the case that every separable state is accepted with probability at most $1-\\epsilon$. Equivalently, our algorithm takes the description of a subspace $\\mathcal{W} \\subseteq \\mathbb{F}^{n^2}$ (where $\\math"},"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":"1701.06321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-01-23T10:25:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7aa4cf3cd066bc54b6a3afe663b1b932863d79713781c52a0fb3f524c31910d7","abstract_canon_sha256":"0a9963a2201e95be25c1bcdba4b73eaf4b38b34e64b4790047bf15b3d9db759a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:40.586544Z","signature_b64":"aA+BciIAqQU6c7DfusYlNQGbX+rF4oojWJiHtukzmVwLFs8sU987fNEe8vCxhxrmpC+mxaN0XdfXy102xnB/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aecfd7c75fe9911cc1c56f6c7af30b2d516259bf04097e06db5281d1409616d","last_reissued_at":"2026-05-18T00:40:40.585711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:40.585711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum entanglement, sum of squares, and the log rank conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Boaz Barak, David Steurer, Pravesh Kothari","submitted_at":"2017-01-23T10:25:42Z","abstract_excerpt":"For every $\\epsilon>0$, we give an $\\exp(\\tilde{O}(\\sqrt{n}/\\epsilon^2))$-time algorithm for the $1$ vs $1-\\epsilon$ \\emph{Best Separable State (BSS)} problem of distinguishing, given an $n^2\\times n^2$ matrix $\\mathcal{M}$ corresponding to a quantum measurement, between the case that there is a separable (i.e., non-entangled) state $\\rho$ that $\\mathcal{M}$ accepts with probability $1$, and the case that every separable state is accepted with probability at most $1-\\epsilon$. Equivalently, our algorithm takes the description of a subspace $\\mathcal{W} \\subseteq \\mathbb{F}^{n^2}$ (where $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06321","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":""},"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":"1701.06321","created_at":"2026-05-18T00:40:40.585828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06321v2","created_at":"2026-05-18T00:40:40.585828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06321","created_at":"2026-05-18T00:40:40.585828+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLWP27DV72MR","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLWP27DV72MRDTA4","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLWP27DV","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL","json":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL.json","graph_json":"https://pith.science/api/pith-number/RLWP27DV72MRDTA4K33MPLZQWL/graph.json","events_json":"https://pith.science/api/pith-number/RLWP27DV72MRDTA4K33MPLZQWL/events.json","paper":"https://pith.science/paper/RLWP27DV"},"agent_actions":{"view_html":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL","download_json":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL.json","view_paper":"https://pith.science/paper/RLWP27DV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06321&json=true","fetch_graph":"https://pith.science/api/pith-number/RLWP27DV72MRDTA4K33MPLZQWL/graph.json","fetch_events":"https://pith.science/api/pith-number/RLWP27DV72MRDTA4K33MPLZQWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL/action/storage_attestation","attest_author":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL/action/author_attestation","sign_citation":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL/action/citation_signature","submit_replication":"https://pith.science/pith/RLWP27DV72MRDTA4K33MPLZQWL/action/replication_record"}},"created_at":"2026-05-18T00:40:40.585828+00:00","updated_at":"2026-05-18T00:40:40.585828+00:00"}