{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QX3AAS7U6A7WNZTIAZ5FWRP67X","short_pith_number":"pith:QX3AAS7U","schema_version":"1.0","canonical_sha256":"85f6004bf4f03f66e668067a5b45fefdcc0653a02ad96893facf7b729679a82a","source":{"kind":"arxiv","id":"2512.23799","version":2},"attestation_state":"computed","paper":{"title":"Efficient simulation of logical magic state preparation protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac H. Kim, Lucas Daguerre, Samyak Surti","submitted_at":"2025-12-29T19:00:05Z","abstract_excerpt":"Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical magic state preparation protocols under the standard circuit-level noise model. When applied to protocols based on code switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the non-stabilizerness, e.g., stabilizer rank or Pauli rank, of the target encode"},"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":"2512.23799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-29T19:00:05Z","cross_cats_sorted":[],"title_canon_sha256":"d15b007a8c520b4efde22fee10f239f6627762ee4ba71f5a0a7013bf5a50b8b1","abstract_canon_sha256":"66883cb5ca21672123e2c59c1b3be29a5229d2494ceba388092b7d9b61be1841"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:01.803797Z","signature_b64":"3UxCS64Zp+FHf4xWqn4tp0KFcUW7zc9pZoBtUB1bDzDSqYCAtfszXztWYYhoZuoCECzpGBtFl9MwSlVcdX49Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f6004bf4f03f66e668067a5b45fefdcc0653a02ad96893facf7b729679a82a","last_reissued_at":"2026-05-26T02:04:01.803034Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:01.803034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient simulation of logical magic state preparation protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac H. Kim, Lucas Daguerre, Samyak Surti","submitted_at":"2025-12-29T19:00:05Z","abstract_excerpt":"Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical magic state preparation protocols under the standard circuit-level noise model. When applied to protocols based on code switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the non-stabilizerness, e.g., stabilizer rank or Pauli rank, of the target encode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.23799","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/2512.23799/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":"2512.23799","created_at":"2026-05-26T02:04:01.803136+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.23799v2","created_at":"2026-05-26T02:04:01.803136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.23799","created_at":"2026-05-26T02:04:01.803136+00:00"},{"alias_kind":"pith_short_12","alias_value":"QX3AAS7U6A7W","created_at":"2026-05-26T02:04:01.803136+00:00"},{"alias_kind":"pith_short_16","alias_value":"QX3AAS7U6A7WNZTI","created_at":"2026-05-26T02:04:01.803136+00:00"},{"alias_kind":"pith_short_8","alias_value":"QX3AAS7U","created_at":"2026-05-26T02:04:01.803136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03616","citing_title":"Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X","json":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X.json","graph_json":"https://pith.science/api/pith-number/QX3AAS7U6A7WNZTIAZ5FWRP67X/graph.json","events_json":"https://pith.science/api/pith-number/QX3AAS7U6A7WNZTIAZ5FWRP67X/events.json","paper":"https://pith.science/paper/QX3AAS7U"},"agent_actions":{"view_html":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X","download_json":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X.json","view_paper":"https://pith.science/paper/QX3AAS7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.23799&json=true","fetch_graph":"https://pith.science/api/pith-number/QX3AAS7U6A7WNZTIAZ5FWRP67X/graph.json","fetch_events":"https://pith.science/api/pith-number/QX3AAS7U6A7WNZTIAZ5FWRP67X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X/action/storage_attestation","attest_author":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X/action/author_attestation","sign_citation":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X/action/citation_signature","submit_replication":"https://pith.science/pith/QX3AAS7U6A7WNZTIAZ5FWRP67X/action/replication_record"}},"created_at":"2026-05-26T02:04:01.803136+00:00","updated_at":"2026-05-26T02:04:01.803136+00:00"}