{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SLWK3C2HDIUDMNT54T4LCHHDDO","short_pith_number":"pith:SLWK3C2H","schema_version":"1.0","canonical_sha256":"92ecad8b471a2836367de4f8b11ce31b8693cf07998fbc360701964f19b3d818","source":{"kind":"arxiv","id":"2504.09391","version":2},"attestation_state":"computed","paper":{"title":"Survival of the Optimized: An Evolutionary Approach to T-depth Reduction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AR","cs.ET"],"primary_cat":"quant-ph","authors_text":"Archisman Ghosh, Avimita Chatterjee, Swaroop Ghosh","submitted_at":"2025-04-13T00:55:18Z","abstract_excerpt":"Quantum Error Correction (QEC) is the cornerstone of practical Fault-Tolerant Quantum Computing (FTQC), but incurs enormous resource overheads. Circuits must decompose into Clifford+T gates, and the non-transversal T gates demand costly magic-state distillation. As circuit complexity grows, sequential T-gate layers (\"T-depth\") increase, amplifying the spatiotemporal overhead of QEC. Optimizing T-depth is NP-hard, and existing greedy or brute-force strategies are either inefficient or computationally prohibitive. We frame T-depth reduction as a search optimization problem and present a Genetic "},"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":"2504.09391","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-13T00:55:18Z","cross_cats_sorted":["cs.AR","cs.ET"],"title_canon_sha256":"c92cef70f5b0396df31c995b9e1e3d3011e2e03a629e62227f0192cf4671b1f5","abstract_canon_sha256":"abc5d85ab51e43a7f6af38c347cf575ee5db6f0a9b0c9b95d61415bb8a36a786"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:55.260196Z","signature_b64":"T85Ef126u5aAnP9MlO/38ZrL1B4g+kGVfoIFDWoj26Z8jSDIZmKxYSt/FFStbCgSYV4KRnoOJ0L28/MALokjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ecad8b471a2836367de4f8b11ce31b8693cf07998fbc360701964f19b3d818","last_reissued_at":"2026-07-05T11:35:55.259712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:55.259712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survival of the Optimized: An Evolutionary Approach to T-depth Reduction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AR","cs.ET"],"primary_cat":"quant-ph","authors_text":"Archisman Ghosh, Avimita Chatterjee, Swaroop Ghosh","submitted_at":"2025-04-13T00:55:18Z","abstract_excerpt":"Quantum Error Correction (QEC) is the cornerstone of practical Fault-Tolerant Quantum Computing (FTQC), but incurs enormous resource overheads. Circuits must decompose into Clifford+T gates, and the non-transversal T gates demand costly magic-state distillation. As circuit complexity grows, sequential T-gate layers (\"T-depth\") increase, amplifying the spatiotemporal overhead of QEC. Optimizing T-depth is NP-hard, and existing greedy or brute-force strategies are either inefficient or computationally prohibitive. We frame T-depth reduction as a search optimization problem and present a Genetic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09391","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/2504.09391/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":"2504.09391","created_at":"2026-07-05T11:35:55.259776+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.09391v2","created_at":"2026-07-05T11:35:55.259776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09391","created_at":"2026-07-05T11:35:55.259776+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLWK3C2HDIUD","created_at":"2026-07-05T11:35:55.259776+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLWK3C2HDIUDMNT5","created_at":"2026-07-05T11:35:55.259776+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLWK3C2H","created_at":"2026-07-05T11:35:55.259776+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.09133","citing_title":"Quantum Error-Corrected Computation of Molecular Energies","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO","json":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO.json","graph_json":"https://pith.science/api/pith-number/SLWK3C2HDIUDMNT54T4LCHHDDO/graph.json","events_json":"https://pith.science/api/pith-number/SLWK3C2HDIUDMNT54T4LCHHDDO/events.json","paper":"https://pith.science/paper/SLWK3C2H"},"agent_actions":{"view_html":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO","download_json":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO.json","view_paper":"https://pith.science/paper/SLWK3C2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.09391&json=true","fetch_graph":"https://pith.science/api/pith-number/SLWK3C2HDIUDMNT54T4LCHHDDO/graph.json","fetch_events":"https://pith.science/api/pith-number/SLWK3C2HDIUDMNT54T4LCHHDDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO/action/storage_attestation","attest_author":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO/action/author_attestation","sign_citation":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO/action/citation_signature","submit_replication":"https://pith.science/pith/SLWK3C2HDIUDMNT54T4LCHHDDO/action/replication_record"}},"created_at":"2026-07-05T11:35:55.259776+00:00","updated_at":"2026-07-05T11:35:55.259776+00:00"}