{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SLX6OG6LXZVNS76XNQZ2ZBUAV5","short_pith_number":"pith:SLX6OG6L","schema_version":"1.0","canonical_sha256":"92efe71bcbbe6ad97fd76c33ac8680af68a18b343c65786c798c86aad3ebdd5d","source":{"kind":"arxiv","id":"2004.05164","version":2},"attestation_state":"computed","paper":{"title":"Fast and effective techniques for T-count reduction via spider nest identities","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Niel de Beaudrap, Quanlong Wang, Xiaoning Bian","submitted_at":"2020-04-10T14:12:55Z","abstract_excerpt":"In fault-tolerant quantum computing systems, realising (approximately) universal quantum computation is usually described in terms of realising Clifford+T operations, which is to say a circuit of CNOT, Hadamard, and $\\pi/2$-phase rotations, together with T operations ($\\pi/4$-phase rotations). For many error correcting codes, fault-tolerant realisations of Clifford operations are significantly less resource-intensive than those of T gates, which motivates finding ways to realise the same transformation involving T-count (the number of T gates involved) which is as low as possible. Investigatio"},"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":"2004.05164","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2020-04-10T14:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"1b1f07ee50457e8f9fdde139b484f2525892fbfc484ca40c883689e9bda6ef90","abstract_canon_sha256":"610de6450459b83717539fb43493a40515488d453ad5677ccb565201619548d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:47.619284Z","signature_b64":"KZtRn024Kg49CWjthrYfXNmIENV5aehjBD9FFb/gTmvwwn8XQg4ouIoCzK2DLrniX5/94ZQrJvhLjIdYXQO8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92efe71bcbbe6ad97fd76c33ac8680af68a18b343c65786c798c86aad3ebdd5d","last_reissued_at":"2026-07-05T08:43:47.618787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:47.618787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and effective techniques for T-count reduction via spider nest identities","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Niel de Beaudrap, Quanlong Wang, Xiaoning Bian","submitted_at":"2020-04-10T14:12:55Z","abstract_excerpt":"In fault-tolerant quantum computing systems, realising (approximately) universal quantum computation is usually described in terms of realising Clifford+T operations, which is to say a circuit of CNOT, Hadamard, and $\\pi/2$-phase rotations, together with T operations ($\\pi/4$-phase rotations). For many error correcting codes, fault-tolerant realisations of Clifford operations are significantly less resource-intensive than those of T gates, which motivates finding ways to realise the same transformation involving T-count (the number of T gates involved) which is as low as possible. Investigatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05164","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/2004.05164/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":"2004.05164","created_at":"2026-07-05T08:43:47.618846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.05164v2","created_at":"2026-07-05T08:43:47.618846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05164","created_at":"2026-07-05T08:43:47.618846+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLX6OG6LXZVN","created_at":"2026-07-05T08:43:47.618846+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLX6OG6LXZVNS76X","created_at":"2026-07-05T08:43:47.618846+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLX6OG6L","created_at":"2026-07-05T08:43:47.618846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.13014","citing_title":"Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5","json":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5.json","graph_json":"https://pith.science/api/pith-number/SLX6OG6LXZVNS76XNQZ2ZBUAV5/graph.json","events_json":"https://pith.science/api/pith-number/SLX6OG6LXZVNS76XNQZ2ZBUAV5/events.json","paper":"https://pith.science/paper/SLX6OG6L"},"agent_actions":{"view_html":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5","download_json":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5.json","view_paper":"https://pith.science/paper/SLX6OG6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.05164&json=true","fetch_graph":"https://pith.science/api/pith-number/SLX6OG6LXZVNS76XNQZ2ZBUAV5/graph.json","fetch_events":"https://pith.science/api/pith-number/SLX6OG6LXZVNS76XNQZ2ZBUAV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5/action/storage_attestation","attest_author":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5/action/author_attestation","sign_citation":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5/action/citation_signature","submit_replication":"https://pith.science/pith/SLX6OG6LXZVNS76XNQZ2ZBUAV5/action/replication_record"}},"created_at":"2026-07-05T08:43:47.618846+00:00","updated_at":"2026-07-05T08:43:47.618846+00:00"}