{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IPSORCG6PATVSGSPVUQTZKSX3O","short_pith_number":"pith:IPSORCG6","schema_version":"1.0","canonical_sha256":"43e4e888de7827591a4fad213caa57dbb339eac244527339459da3b513f9cea0","source":{"kind":"arxiv","id":"2509.08658","version":8},"attestation_state":"computed","paper":{"title":"Simulating magic state cultivation with few Clifford terms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ainhoa Zapirain, Kwok Ho Wan, Zhenghao Zhong","submitted_at":"2025-09-10T14:52:55Z","abstract_excerpt":"Building upon [arXiv:2509.01224], we present a few methods on how to simulate the non-Clifford $d=5$ magic state cultivation circuits [arXiv:2409.17595] with a sum of $\\approx 8$ Clifford ZX-diagrams on average, at $0.1\\%$ noise. Compared to a magic cat state stabiliser decomposition of all $53$ non-Clifford spiders ($6{,}377{,}292$ terms required), this is more than $7 \\times 10^{5}$ times reduction in the number of terms. Our stabiliser decomposition has the advantage of representing the final non-Clifford state (in light of circuit errors) as a sum of Clifford ZX-diagrams. This will be usef"},"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":"2509.08658","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-10T14:52:55Z","cross_cats_sorted":[],"title_canon_sha256":"0c7ec5e8895a10b4f5a84c34c5db8fd8773e5b5af4d48040cd10fbc1fcafd66e","abstract_canon_sha256":"3cd8aa36b2e72144dd866014fd796d437e7343887de3338062aa7aeb5d1a370c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:27.706365Z","signature_b64":"9Yl5SvQk6A0uux1Qqnlz/SP3IBazIXCSi/rOXcdjEGtuJywcGXvBXB68UEvQIYYtAIq+rtWkXMKjNFwasmbTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43e4e888de7827591a4fad213caa57dbb339eac244527339459da3b513f9cea0","last_reissued_at":"2026-06-11T01:10:27.705421Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:27.705421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating magic state cultivation with few Clifford terms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ainhoa Zapirain, Kwok Ho Wan, Zhenghao Zhong","submitted_at":"2025-09-10T14:52:55Z","abstract_excerpt":"Building upon [arXiv:2509.01224], we present a few methods on how to simulate the non-Clifford $d=5$ magic state cultivation circuits [arXiv:2409.17595] with a sum of $\\approx 8$ Clifford ZX-diagrams on average, at $0.1\\%$ noise. Compared to a magic cat state stabiliser decomposition of all $53$ non-Clifford spiders ($6{,}377{,}292$ terms required), this is more than $7 \\times 10^{5}$ times reduction in the number of terms. Our stabiliser decomposition has the advantage of representing the final non-Clifford state (in light of circuit errors) as a sum of Clifford ZX-diagrams. This will be usef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08658","kind":"arxiv","version":8},"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/2509.08658/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":"2509.08658","created_at":"2026-06-11T01:10:27.705524+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08658v8","created_at":"2026-06-11T01:10:27.705524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08658","created_at":"2026-06-11T01:10:27.705524+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPSORCG6PATV","created_at":"2026-06-11T01:10:27.705524+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPSORCG6PATVSGSP","created_at":"2026-06-11T01:10:27.705524+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPSORCG6","created_at":"2026-06-11T01:10:27.705524+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2603.14670","citing_title":"Computing logical error thresholds with the Pauli Frame Sparse Representation","ref_index":65,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03616","citing_title":"Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing","ref_index":61,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27058","citing_title":"Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O","json":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O.json","graph_json":"https://pith.science/api/pith-number/IPSORCG6PATVSGSPVUQTZKSX3O/graph.json","events_json":"https://pith.science/api/pith-number/IPSORCG6PATVSGSPVUQTZKSX3O/events.json","paper":"https://pith.science/paper/IPSORCG6"},"agent_actions":{"view_html":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O","download_json":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O.json","view_paper":"https://pith.science/paper/IPSORCG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08658&json=true","fetch_graph":"https://pith.science/api/pith-number/IPSORCG6PATVSGSPVUQTZKSX3O/graph.json","fetch_events":"https://pith.science/api/pith-number/IPSORCG6PATVSGSPVUQTZKSX3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O/action/storage_attestation","attest_author":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O/action/author_attestation","sign_citation":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O/action/citation_signature","submit_replication":"https://pith.science/pith/IPSORCG6PATVSGSPVUQTZKSX3O/action/replication_record"}},"created_at":"2026-06-11T01:10:27.705524+00:00","updated_at":"2026-06-11T01:10:27.705524+00:00"}