{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:F62AHYO3RIPU4Q2GG7CZ4KCJUR","short_pith_number":"pith:F62AHYO3","schema_version":"1.0","canonical_sha256":"2fb403e1db8a1f4e434637c59e2849a474bdff32dec7d7cdc056981af533efc2","source":{"kind":"arxiv","id":"quant-ph/0606131","version":1},"attestation_state":"computed","paper":{"title":"How many copies are needed for state discrimination?","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Aram W. Harrow","submitted_at":"2006-06-15T11:33:53Z","abstract_excerpt":"Given a collection of states (rho_1, ..., rho_N) with pairwise fidelities F(rho_i, rho_j) <= F < 1, we show the existence of a POVM that, given rho_i^{otimes n}, will identify i with probability >= 1-epsilon, as long as n>=2(log N/eps)/log (1/F). This improves on previous results which were either dimension-dependent or required that i be drawn from a known distribution."},"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":"quant-ph/0606131","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-06-15T11:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"ba8eda5e12a7d4c9e6af37faa5f8635954d111df6f49c9c70dc9f28d3111fe53","abstract_canon_sha256":"4edf9b0220dceb614be6863767baabb0a1dd01b2e5fee3591db87bfb94bec6f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:32.886604Z","signature_b64":"cMh4u4Dp2HvfKwE9YEwihyd0d0BzOazzzJsvkUR7GCrt4UEGu3Z7uj22jMoqxZzR/ah2wtmgI8uZD+mTXelXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb403e1db8a1f4e434637c59e2849a474bdff32dec7d7cdc056981af533efc2","last_reissued_at":"2026-05-18T04:03:32.885880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:32.885880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How many copies are needed for state discrimination?","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Aram W. Harrow","submitted_at":"2006-06-15T11:33:53Z","abstract_excerpt":"Given a collection of states (rho_1, ..., rho_N) with pairwise fidelities F(rho_i, rho_j) <= F < 1, we show the existence of a POVM that, given rho_i^{otimes n}, will identify i with probability >= 1-epsilon, as long as n>=2(log N/eps)/log (1/F). This improves on previous results which were either dimension-dependent or required that i be drawn from a known distribution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0606131","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":""},"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":"quant-ph/0606131","created_at":"2026-05-18T04:03:32.885997+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0606131v1","created_at":"2026-05-18T04:03:32.885997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0606131","created_at":"2026-05-18T04:03:32.885997+00:00"},{"alias_kind":"pith_short_12","alias_value":"F62AHYO3RIPU","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"F62AHYO3RIPU4Q2G","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"F62AHYO3","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08312","citing_title":"Pretty simple bounds on quantum state discrimination","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR","json":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR.json","graph_json":"https://pith.science/api/pith-number/F62AHYO3RIPU4Q2GG7CZ4KCJUR/graph.json","events_json":"https://pith.science/api/pith-number/F62AHYO3RIPU4Q2GG7CZ4KCJUR/events.json","paper":"https://pith.science/paper/F62AHYO3"},"agent_actions":{"view_html":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR","download_json":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR.json","view_paper":"https://pith.science/paper/F62AHYO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0606131&json=true","fetch_graph":"https://pith.science/api/pith-number/F62AHYO3RIPU4Q2GG7CZ4KCJUR/graph.json","fetch_events":"https://pith.science/api/pith-number/F62AHYO3RIPU4Q2GG7CZ4KCJUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR/action/storage_attestation","attest_author":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR/action/author_attestation","sign_citation":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR/action/citation_signature","submit_replication":"https://pith.science/pith/F62AHYO3RIPU4Q2GG7CZ4KCJUR/action/replication_record"}},"created_at":"2026-05-18T04:03:32.885997+00:00","updated_at":"2026-05-18T04:03:32.885997+00:00"}