{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VAHKQ5X2ISADKMIM3EOOR7P6UO","short_pith_number":"pith:VAHKQ5X2","schema_version":"1.0","canonical_sha256":"a80ea876fa448035310cd91ce8fdfea38679b1082ebcb7d7204325ab1386170b","source":{"kind":"arxiv","id":"2408.07764","version":2},"attestation_state":"computed","paper":{"title":"Constant-Overhead Magic State Distillation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Hayata Yamasaki, Min-Hsiu Hsieh","submitted_at":"2024-08-14T18:31:22Z","abstract_excerpt":"Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states required per output magic state with an error rate below $\\epsilon$, typically grows as $\\mathcal{O}(\\log^\\gamma(1/\\epsilon))$. Achieving smaller overheads, i.e., smaller exponents $\\gamma$, is highly desirable; however, all existing protocols require polylogarithmically growing overheads with some $\\gamma > 0$, and identifying the smallest achievable exponent $\\gamma$ for distilling magic states of qubits has remained "},"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.07764","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-14T18:31:22Z","cross_cats_sorted":[],"title_canon_sha256":"57a090faa29a948c1ed85408f0f25f2c6af3f73616aaeaa10b70b06d2f0af507","abstract_canon_sha256":"7cd2af7860038fd75ae78b427f868e424191afec15d57f5e3a4a1fd06c6574cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:40.497895Z","signature_b64":"3xbMDe2nMmvLZBcymBJBgZ/w3sAyRLTc3R66dKPWMA0ji+h15/dfQVQvc5yhIlR/I5sezstc6a/hD/Dv+eb6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a80ea876fa448035310cd91ce8fdfea38679b1082ebcb7d7204325ab1386170b","last_reissued_at":"2026-07-05T08:57:40.497413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:40.497413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-Overhead Magic State Distillation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Hayata Yamasaki, Min-Hsiu Hsieh","submitted_at":"2024-08-14T18:31:22Z","abstract_excerpt":"Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states required per output magic state with an error rate below $\\epsilon$, typically grows as $\\mathcal{O}(\\log^\\gamma(1/\\epsilon))$. Achieving smaller overheads, i.e., smaller exponents $\\gamma$, is highly desirable; however, all existing protocols require polylogarithmically growing overheads with some $\\gamma > 0$, and identifying the smallest achievable exponent $\\gamma$ for distilling magic states of qubits has remained "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.07764","kind":"arxiv","version":2},"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.07764/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.07764","created_at":"2026-07-05T08:57:40.497473+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.07764v2","created_at":"2026-07-05T08:57:40.497473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.07764","created_at":"2026-07-05T08:57:40.497473+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAHKQ5X2ISAD","created_at":"2026-07-05T08:57:40.497473+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAHKQ5X2ISADKMIM","created_at":"2026-07-05T08:57:40.497473+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAHKQ5X2","created_at":"2026-07-05T08:57:40.497473+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28518","citing_title":"Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30108","citing_title":"Asymptotic magic state distillation with almost linear rate","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":201,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10714","citing_title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13993","citing_title":"Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13486","citing_title":"Taming Trotter Errors with Quantum Resources","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO","json":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO.json","graph_json":"https://pith.science/api/pith-number/VAHKQ5X2ISADKMIM3EOOR7P6UO/graph.json","events_json":"https://pith.science/api/pith-number/VAHKQ5X2ISADKMIM3EOOR7P6UO/events.json","paper":"https://pith.science/paper/VAHKQ5X2"},"agent_actions":{"view_html":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO","download_json":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO.json","view_paper":"https://pith.science/paper/VAHKQ5X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.07764&json=true","fetch_graph":"https://pith.science/api/pith-number/VAHKQ5X2ISADKMIM3EOOR7P6UO/graph.json","fetch_events":"https://pith.science/api/pith-number/VAHKQ5X2ISADKMIM3EOOR7P6UO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO/action/storage_attestation","attest_author":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO/action/author_attestation","sign_citation":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO/action/citation_signature","submit_replication":"https://pith.science/pith/VAHKQ5X2ISADKMIM3EOOR7P6UO/action/replication_record"}},"created_at":"2026-07-05T08:57:40.497473+00:00","updated_at":"2026-07-05T08:57:40.497473+00:00"}