{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6YKTU6MV5EWPBOU5EDHVRQQJI7","short_pith_number":"pith:6YKTU6MV","schema_version":"1.0","canonical_sha256":"f6153a7995e92cf0ba9d20cf58c20947cfe8efcc3de14a087cf477a1742780e3","source":{"kind":"arxiv","id":"2408.06967","version":3},"attestation_state":"computed","paper":{"title":"Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Qi Ye, Sitan Chen, Weiyuan Gong, Zhihan Zhang","submitted_at":"2024-08-13T15:23:17Z","abstract_excerpt":"We study the task of agnostic tomography: given copies of an unknown $n$-qubit state $\\rho$ which has fidelity $\\tau$ with some state in a given class $C$, find a state which has fidelity $\\ge \\tau - \\epsilon$ with $\\rho$. We give a new framework, stabilizer bootstrapping, for designing computationally efficient protocols for this task, and use this to get new agnostic tomography protocols for the following classes:\n  Stabilizer states: We give a protocol that runs in time $\\mathrm{poly}(n,1/\\epsilon)\\cdot (1/\\tau)^{O(\\log(1/\\tau))}$, answering an open question posed by Grewal, Iyer, Kretschme"},"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":"2408.06967","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-13T15:23:17Z","cross_cats_sorted":["cs.CC","cs.DS","cs.LG"],"title_canon_sha256":"ba14a32046edcf53f92ef4f278e92da8e503db0a160ef5057f6dc42db5ea623e","abstract_canon_sha256":"fa785a14a783e39ca64339f01428f6a986256e614a04271c69cbfd56f464e4dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:35.535251Z","signature_b64":"lghkDtMDSjTkGwH+XWx2n5zjbEgil3czL7L5co49PZXRX+8TZIo7uDogz55dLBJv0OJ0AbjFLdrZ1pEAaE01BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6153a7995e92cf0ba9d20cf58c20947cfe8efcc3de14a087cf477a1742780e3","last_reissued_at":"2026-07-05T09:44:35.534755Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:35.534755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Qi Ye, Sitan Chen, Weiyuan Gong, Zhihan Zhang","submitted_at":"2024-08-13T15:23:17Z","abstract_excerpt":"We study the task of agnostic tomography: given copies of an unknown $n$-qubit state $\\rho$ which has fidelity $\\tau$ with some state in a given class $C$, find a state which has fidelity $\\ge \\tau - \\epsilon$ with $\\rho$. We give a new framework, stabilizer bootstrapping, for designing computationally efficient protocols for this task, and use this to get new agnostic tomography protocols for the following classes:\n  Stabilizer states: We give a protocol that runs in time $\\mathrm{poly}(n,1/\\epsilon)\\cdot (1/\\tau)^{O(\\log(1/\\tau))}$, answering an open question posed by Grewal, Iyer, Kretschme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06967","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.06967/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":"2408.06967","created_at":"2026-07-05T09:44:35.534813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.06967v3","created_at":"2026-07-05T09:44:35.534813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06967","created_at":"2026-07-05T09:44:35.534813+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YKTU6MV5EWP","created_at":"2026-07-05T09:44:35.534813+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YKTU6MV5EWPBOU5","created_at":"2026-07-05T09:44:35.534813+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YKTU6MV","created_at":"2026-07-05T09:44:35.534813+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7","json":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7.json","graph_json":"https://pith.science/api/pith-number/6YKTU6MV5EWPBOU5EDHVRQQJI7/graph.json","events_json":"https://pith.science/api/pith-number/6YKTU6MV5EWPBOU5EDHVRQQJI7/events.json","paper":"https://pith.science/paper/6YKTU6MV"},"agent_actions":{"view_html":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7","download_json":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7.json","view_paper":"https://pith.science/paper/6YKTU6MV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.06967&json=true","fetch_graph":"https://pith.science/api/pith-number/6YKTU6MV5EWPBOU5EDHVRQQJI7/graph.json","fetch_events":"https://pith.science/api/pith-number/6YKTU6MV5EWPBOU5EDHVRQQJI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7/action/storage_attestation","attest_author":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7/action/author_attestation","sign_citation":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7/action/citation_signature","submit_replication":"https://pith.science/pith/6YKTU6MV5EWPBOU5EDHVRQQJI7/action/replication_record"}},"created_at":"2026-07-05T09:44:35.534813+00:00","updated_at":"2026-07-05T09:44:35.534813+00:00"}