{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DA6W342HJYOJJAQUSC3ELD4VFR","short_pith_number":"pith:DA6W342H","schema_version":"1.0","canonical_sha256":"183d6df3474e1c94821490b6458f952c7de9dbcce2c2894b6aa6b1f418765f40","source":{"kind":"arxiv","id":"2608.01770","version":1},"attestation_state":"computed","paper":{"title":"The Sample Complexity of Fidelity Estimation to a Known Rank-$r$ Reference State Is $\\widetilde{\\Theta}(r^2/\\varepsilon^2)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gye Jin Lee, Sunghyeon Jo","submitted_at":"2026-08-03T06:43:01Z","abstract_excerpt":"We settle the sample complexity of estimating the root Uhlmann fidelity $F(\\rho,\\sigma)=\\operatorname{tr}\\sqrt{\\sqrt{\\sigma}\\rho\\sqrt{\\sigma}}$ between an unknown state $\\rho$ and a known rank-$r$ reference state $\\sigma$. Writing $S(r,\\varepsilon)$ for the sample complexity at additive error $\\varepsilon$, we resolve the open problem posed by Wang by closing, up to logarithmic factors, the gap between the previously known bounds $\\Omega(r/\\varepsilon^2)$ and $O(r^2/\\varepsilon^2)$. We prove $S(r,\\varepsilon)=\\widetilde{\\Theta}(r^2/\\varepsilon^2)$ for all $0<\\varepsilon\\le\\varepsilon_0$, where"},"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":"2608.01770","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-03T06:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"05717baf9685ab4711b5469eaefdc4013c95be17d4074c26bb8ff2336fa82d93","abstract_canon_sha256":"b7c2fbd42fb701d289eb0be45fac7e98e25f2fe90d5a7436c484106d047ae8c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:06:50.278993Z","signature_b64":"E72B07ZlGgYfCqkSH7CRHJqWQrZpecSBQTY7focChQfHpJfUa38SiPPSow6h+8lGXnpbRu6+mxggdl2HOjGCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"183d6df3474e1c94821490b6458f952c7de9dbcce2c2894b6aa6b1f418765f40","last_reissued_at":"2026-08-04T02:06:50.277237Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:06:50.277237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sample Complexity of Fidelity Estimation to a Known Rank-$r$ Reference State Is $\\widetilde{\\Theta}(r^2/\\varepsilon^2)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gye Jin Lee, Sunghyeon Jo","submitted_at":"2026-08-03T06:43:01Z","abstract_excerpt":"We settle the sample complexity of estimating the root Uhlmann fidelity $F(\\rho,\\sigma)=\\operatorname{tr}\\sqrt{\\sqrt{\\sigma}\\rho\\sqrt{\\sigma}}$ between an unknown state $\\rho$ and a known rank-$r$ reference state $\\sigma$. Writing $S(r,\\varepsilon)$ for the sample complexity at additive error $\\varepsilon$, we resolve the open problem posed by Wang by closing, up to logarithmic factors, the gap between the previously known bounds $\\Omega(r/\\varepsilon^2)$ and $O(r^2/\\varepsilon^2)$. We prove $S(r,\\varepsilon)=\\widetilde{\\Theta}(r^2/\\varepsilon^2)$ for all $0<\\varepsilon\\le\\varepsilon_0$, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01770","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/2608.01770/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":"2608.01770","created_at":"2026-08-04T02:06:50.278796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01770v1","created_at":"2026-08-04T02:06:50.278796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01770","created_at":"2026-08-04T02:06:50.278796+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA6W342HJYOJ","created_at":"2026-08-04T02:06:50.278796+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA6W342HJYOJJAQU","created_at":"2026-08-04T02:06:50.278796+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA6W342H","created_at":"2026-08-04T02:06:50.278796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10674","citing_title":"Optimal fidelity estimation when one state is pure via algorithmic Uhlmann transform","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR","json":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR.json","graph_json":"https://pith.science/api/pith-number/DA6W342HJYOJJAQUSC3ELD4VFR/graph.json","events_json":"https://pith.science/api/pith-number/DA6W342HJYOJJAQUSC3ELD4VFR/events.json","paper":"https://pith.science/paper/DA6W342H"},"agent_actions":{"view_html":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR","download_json":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR.json","view_paper":"https://pith.science/paper/DA6W342H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01770&json=true","fetch_graph":"https://pith.science/api/pith-number/DA6W342HJYOJJAQUSC3ELD4VFR/graph.json","fetch_events":"https://pith.science/api/pith-number/DA6W342HJYOJJAQUSC3ELD4VFR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR/action/storage_attestation","attest_author":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR/action/author_attestation","sign_citation":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR/action/citation_signature","submit_replication":"https://pith.science/pith/DA6W342HJYOJJAQUSC3ELD4VFR/action/replication_record"}},"created_at":"2026-08-04T02:06:50.278796+00:00","updated_at":"2026-08-04T02:06:50.278796+00:00"}