{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5OPKJTXD7XY32U7YOFPDOM4PGF","short_pith_number":"pith:5OPKJTXD","schema_version":"1.0","canonical_sha256":"eb9ea4cee3fdf1bd53f8715e37338f3176979b2a2049134e71d5131b18105339","source":{"kind":"arxiv","id":"2604.26927","version":2},"attestation_state":"computed","paper":{"title":"The most discriminable quantum states in the multicopy regime","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas B. Vieira, Lucas E. A. Porto, Marco T\\'ulio Quintino, Maria Kvashchuk, Polina Chernyshova, Ties-A. Ohst","submitted_at":"2026-04-29T17:41:12Z","abstract_excerpt":"This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form $\\left\\{\\frac{1}{N},\\rho_i^{\\otimes k}\\right\\}_{i=1}^N$, where $N$ states in dimension $d$ are provided in $k$ identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally disc"},"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":"2604.26927","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T17:41:12Z","cross_cats_sorted":[],"title_canon_sha256":"9aa36883cb4d790f7d3eac76c9e11fbc2ace639053fc3c2237c5467a19a164b1","abstract_canon_sha256":"53e30d48e01b8370c833700c916cda7dca4ed25e04fbb7457f27cf397b106b80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:22.949515Z","signature_b64":"b2qr1XuNVplFADT2T0T7VlRGygREC1q8JCRRZKVEuLc5w5JcFzIlW4/wHDJYlGbJiEZWHS3Ia4bh7xSINTHpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb9ea4cee3fdf1bd53f8715e37338f3176979b2a2049134e71d5131b18105339","last_reissued_at":"2026-06-24T00:14:22.949106Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:22.949106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The most discriminable quantum states in the multicopy regime","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lucas B. Vieira, Lucas E. A. Porto, Marco T\\'ulio Quintino, Maria Kvashchuk, Polina Chernyshova, Ties-A. Ohst","submitted_at":"2026-04-29T17:41:12Z","abstract_excerpt":"This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form $\\left\\{\\frac{1}{N},\\rho_i^{\\otimes k}\\right\\}_{i=1}^N$, where $N$ states in dimension $d$ are provided in $k$ identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally disc"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For pure state ensembles, we prove that whenever N is large enough to support a state k-design, these designs will exactly give rise to the maximally discriminable sets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the ensemble is uniformly distributed and that k-designs exist with the required symmetry properties for the given dimension d and copy number k.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1619049d142661892788809358752ea5b23866ef3bef26888b7abf0381222f9a"},"source":{"id":"2604.26927","kind":"arxiv","version":2},"verdict":{"id":"e3a7f136-7918-4cee-917b-21ac04cb31cd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T09:58:03.684083Z","strongest_claim":"For pure state ensembles, we prove that whenever N is large enough to support a state k-design, these designs will exactly give rise to the maximally discriminable sets.","one_line_summary":"k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the ensemble is uniformly distributed and that k-designs exist with the required symmetry properties for the given dimension d and copy number k.","pith_extraction_headline":"For large enough N, state k-designs exactly maximize success probability in multi-copy pure-state discrimination."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26927/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T23:37:01.566458Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:42:27.447411Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c36f4f84568f8a043a43f2b494fd8e97c93d32dd286c828f0da7f44ad7374e97"},"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":"2604.26927","created_at":"2026-06-24T00:14:22.949159+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.26927v2","created_at":"2026-06-24T00:14:22.949159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26927","created_at":"2026-06-24T00:14:22.949159+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OPKJTXD7XY3","created_at":"2026-06-24T00:14:22.949159+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OPKJTXD7XY32U7Y","created_at":"2026-06-24T00:14:22.949159+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OPKJTXD","created_at":"2026-06-24T00:14:22.949159+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.01193","citing_title":"Non-signaling assistance in prepare-and-measure scenarios with classical communication","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF","json":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF.json","graph_json":"https://pith.science/api/pith-number/5OPKJTXD7XY32U7YOFPDOM4PGF/graph.json","events_json":"https://pith.science/api/pith-number/5OPKJTXD7XY32U7YOFPDOM4PGF/events.json","paper":"https://pith.science/paper/5OPKJTXD"},"agent_actions":{"view_html":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF","download_json":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF.json","view_paper":"https://pith.science/paper/5OPKJTXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.26927&json=true","fetch_graph":"https://pith.science/api/pith-number/5OPKJTXD7XY32U7YOFPDOM4PGF/graph.json","fetch_events":"https://pith.science/api/pith-number/5OPKJTXD7XY32U7YOFPDOM4PGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/action/storage_attestation","attest_author":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/action/author_attestation","sign_citation":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/action/citation_signature","submit_replication":"https://pith.science/pith/5OPKJTXD7XY32U7YOFPDOM4PGF/action/replication_record"}},"created_at":"2026-06-24T00:14:22.949159+00:00","updated_at":"2026-06-24T00:14:22.949159+00:00"}