{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3VGGYNLKNLIE6UOTA2WJRJWR25","short_pith_number":"pith:3VGGYNLK","schema_version":"1.0","canonical_sha256":"dd4c6c356a6ad04f51d306ac98a6d1d740b242a5c4898b25d9e7163e60845c6b","source":{"kind":"arxiv","id":"2605.27262","version":1},"attestation_state":"computed","paper":{"title":"Nonasymptotic bounds for quantum purity amplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jack Spilecki, John Wright, Thilo Scharnhorst","submitted_at":"2026-05-26T16:39:24Z","abstract_excerpt":"In quantum purity amplification, one is given $n$ copies of a noisy quantum state $\\rho \\in \\mathbb{C}^{d \\times d}$ and asked to prepare $k$ copies of its principal eigenstate $|v_d\\rangle$. Several prior works have derived information-theoretically optimal algorithms for this problem, but the bounds they prove are only shown in the asymptotic regime as the number of samples $n$ tends to infinity. In this paper, we establish the following nonasymptotic guarantee: if $\\rho$'s eigenvalues are sorted $p_1 \\leq \\cdots \\leq p_d$ and $p_{d-1} < p_d$, then \\begin{equation*}\n  n = O\\Big(k + \\frac{k}{"},"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":"2605.27262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-26T16:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"fae6f5052f1f38ba20c29d5c3af12b3b27d79824b4ce1e0b6476666d7743d3c2","abstract_canon_sha256":"35c46c8a6c875c078e6ddb630ebb82dd7c4b5afdb765d84fbfe14b07499f3791"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:06:08.871807Z","signature_b64":"0Oo2k0p9XL5X5fSUpV2gIjCJQijDRwg+4aqhH5geDDHVWJuC0gnylt6YQjBIgNsDHp8yulmx0OmTFCeXEkSfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd4c6c356a6ad04f51d306ac98a6d1d740b242a5c4898b25d9e7163e60845c6b","last_reissued_at":"2026-05-27T02:06:08.871117Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:06:08.871117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonasymptotic bounds for quantum purity amplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jack Spilecki, John Wright, Thilo Scharnhorst","submitted_at":"2026-05-26T16:39:24Z","abstract_excerpt":"In quantum purity amplification, one is given $n$ copies of a noisy quantum state $\\rho \\in \\mathbb{C}^{d \\times d}$ and asked to prepare $k$ copies of its principal eigenstate $|v_d\\rangle$. Several prior works have derived information-theoretically optimal algorithms for this problem, but the bounds they prove are only shown in the asymptotic regime as the number of samples $n$ tends to infinity. In this paper, we establish the following nonasymptotic guarantee: if $\\rho$'s eigenvalues are sorted $p_1 \\leq \\cdots \\leq p_d$ and $p_{d-1} < p_d$, then \\begin{equation*}\n  n = O\\Big(k + \\frac{k}{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27262","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/2605.27262/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":"2605.27262","created_at":"2026-05-27T02:06:08.871233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27262v1","created_at":"2026-05-27T02:06:08.871233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27262","created_at":"2026-05-27T02:06:08.871233+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VGGYNLKNLIE","created_at":"2026-05-27T02:06:08.871233+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VGGYNLKNLIE6UOT","created_at":"2026-05-27T02:06:08.871233+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VGGYNLK","created_at":"2026-05-27T02:06:08.871233+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/3VGGYNLKNLIE6UOTA2WJRJWR25","json":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25.json","graph_json":"https://pith.science/api/pith-number/3VGGYNLKNLIE6UOTA2WJRJWR25/graph.json","events_json":"https://pith.science/api/pith-number/3VGGYNLKNLIE6UOTA2WJRJWR25/events.json","paper":"https://pith.science/paper/3VGGYNLK"},"agent_actions":{"view_html":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25","download_json":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25.json","view_paper":"https://pith.science/paper/3VGGYNLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27262&json=true","fetch_graph":"https://pith.science/api/pith-number/3VGGYNLKNLIE6UOTA2WJRJWR25/graph.json","fetch_events":"https://pith.science/api/pith-number/3VGGYNLKNLIE6UOTA2WJRJWR25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25/action/storage_attestation","attest_author":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25/action/author_attestation","sign_citation":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25/action/citation_signature","submit_replication":"https://pith.science/pith/3VGGYNLKNLIE6UOTA2WJRJWR25/action/replication_record"}},"created_at":"2026-05-27T02:06:08.871233+00:00","updated_at":"2026-05-27T02:06:08.871233+00:00"}