{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2BGHMHARY3UVYWLJOCQPT23Q5Y","short_pith_number":"pith:2BGHMHAR","schema_version":"1.0","canonical_sha256":"d04c761c11c6e95c596970a0f9eb70ee1c8d8973e2917231fdfa28ee5f016b9f","source":{"kind":"arxiv","id":"1708.06002","version":3},"attestation_state":"computed","paper":{"title":"Quantum state certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Costin B\\u{a}descu, John Wright, Ryan O'Donnell","submitted_at":"2017-08-20T18:41:41Z","abstract_excerpt":"We consider the problem of quantum state certification, where one is given $n$ copies of an unknown $d$-dimensional quantum mixed state $\\rho$, and one wants to test whether $\\rho$ is equal to some known mixed state $\\sigma$ or else is $\\epsilon$-far from $\\sigma$. The goal is to use notably fewer copies than the $\\Omega(d^2)$ needed for full tomography on $\\rho$ (i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using $n = O(d/\\epsilon)$ copies, and one with respect to trace distance using $n = O(d/\\epsilon^2)$ copies. The latter algori"},"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":"1708.06002","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-20T18:41:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ae8637dd860894f1d72ffd120020d799d76a5527ac5e4b3a4d3cf9fde9bac1ca","abstract_canon_sha256":"1166aad2492b4dbdeed05330fdb1e9c49e19aa754905eb5e9a7032343239fda9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:18.876434Z","signature_b64":"/cG4/zCT9v3+bDj30GB/SXaVdVWl1LJrr8oIVCaWaje4z+9r5fDiwizLUZNUr4RDTPyyXsBbiifehLkl1GXqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d04c761c11c6e95c596970a0f9eb70ee1c8d8973e2917231fdfa28ee5f016b9f","last_reissued_at":"2026-05-18T00:31:18.875671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:18.875671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum state certification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Costin B\\u{a}descu, John Wright, Ryan O'Donnell","submitted_at":"2017-08-20T18:41:41Z","abstract_excerpt":"We consider the problem of quantum state certification, where one is given $n$ copies of an unknown $d$-dimensional quantum mixed state $\\rho$, and one wants to test whether $\\rho$ is equal to some known mixed state $\\sigma$ or else is $\\epsilon$-far from $\\sigma$. The goal is to use notably fewer copies than the $\\Omega(d^2)$ needed for full tomography on $\\rho$ (i.e., density estimation). We give two robust state certification algorithms: one with respect to fidelity using $n = O(d/\\epsilon)$ copies, and one with respect to trace distance using $n = O(d/\\epsilon^2)$ copies. The latter algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06002","kind":"arxiv","version":3},"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":"1708.06002","created_at":"2026-05-18T00:31:18.875785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06002v3","created_at":"2026-05-18T00:31:18.875785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06002","created_at":"2026-05-18T00:31:18.875785+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BGHMHARY3UV","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BGHMHARY3UVYWLJ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BGHMHAR","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21860","citing_title":"Robust Statistical Estimators with Bounded Empirical Sensitivity","ref_index":112,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y","json":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y.json","graph_json":"https://pith.science/api/pith-number/2BGHMHARY3UVYWLJOCQPT23Q5Y/graph.json","events_json":"https://pith.science/api/pith-number/2BGHMHARY3UVYWLJOCQPT23Q5Y/events.json","paper":"https://pith.science/paper/2BGHMHAR"},"agent_actions":{"view_html":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y","download_json":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y.json","view_paper":"https://pith.science/paper/2BGHMHAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06002&json=true","fetch_graph":"https://pith.science/api/pith-number/2BGHMHARY3UVYWLJOCQPT23Q5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/2BGHMHARY3UVYWLJOCQPT23Q5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y/action/storage_attestation","attest_author":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y/action/author_attestation","sign_citation":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y/action/citation_signature","submit_replication":"https://pith.science/pith/2BGHMHARY3UVYWLJOCQPT23Q5Y/action/replication_record"}},"created_at":"2026-05-18T00:31:18.875785+00:00","updated_at":"2026-05-18T00:31:18.875785+00:00"}