{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FEWZIWVJX7IKICPGGUP4AGPLKE","short_pith_number":"pith:FEWZIWVJ","schema_version":"1.0","canonical_sha256":"292d945aa9bfd0a409e6351fc019eb513efa0c292c5a410533676d5c8163857e","source":{"kind":"arxiv","id":"1308.4134","version":1},"attestation_state":"computed","paper":{"title":"An algorithm for the T-count","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Michele Mosca, Vadym Kliuchnikov, Vincent Russo","submitted_at":"2013-08-19T20:00:01Z","abstract_excerpt":"We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive to implement fault-tolerantly. We therefore view this gate as a resource which should be used only when necessary. Given an n-qubit unitary U we are interested in computing a circuit that implements it using the minimum possible number of T gates (called the T-count of U). A related task is to decide if the T-count of U is less than or equal to m; we consid"},"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":"1308.4134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-08-19T20:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"e5b2f71f02e5763b7d2baac5fc878c277b7d3acce78f317fe194ed50d8b4dcb3","abstract_canon_sha256":"34b01ee3df3f3163564684df6dee914a41f94dc64371c749a6bd56cd08d5386e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.612893Z","signature_b64":"bjsgqfBgPxvjhkhgAT3pK2ZaP0OUb44xNf2xSbyw1b4sT0Z/qsV+E1YeF4XPPUCfUrhGV+uUg6Tce1JMM78JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292d945aa9bfd0a409e6351fc019eb513efa0c292c5a410533676d5c8163857e","last_reissued_at":"2026-05-18T03:15:33.612014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.612014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm for the T-count","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Gosset, Michele Mosca, Vadym Kliuchnikov, Vincent Russo","submitted_at":"2013-08-19T20:00:01Z","abstract_excerpt":"We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive to implement fault-tolerantly. We therefore view this gate as a resource which should be used only when necessary. Given an n-qubit unitary U we are interested in computing a circuit that implements it using the minimum possible number of T gates (called the T-count of U). A related task is to decide if the T-count of U is less than or equal to m; we consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4134","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1308.4134","created_at":"2026-05-18T03:15:33.612157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4134v1","created_at":"2026-05-18T03:15:33.612157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4134","created_at":"2026-05-18T03:15:33.612157+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEWZIWVJX7IK","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEWZIWVJX7IKICPG","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEWZIWVJ","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2409.00433","citing_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14275","citing_title":"Generalized Complexity Distances and Non-Invertible Symmetries","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14921","citing_title":"Split-Evolution Quantum Phase Estimation for Particle-Conserving Hamiltonians","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE","json":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE.json","graph_json":"https://pith.science/api/pith-number/FEWZIWVJX7IKICPGGUP4AGPLKE/graph.json","events_json":"https://pith.science/api/pith-number/FEWZIWVJX7IKICPGGUP4AGPLKE/events.json","paper":"https://pith.science/paper/FEWZIWVJ"},"agent_actions":{"view_html":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE","download_json":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE.json","view_paper":"https://pith.science/paper/FEWZIWVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4134&json=true","fetch_graph":"https://pith.science/api/pith-number/FEWZIWVJX7IKICPGGUP4AGPLKE/graph.json","fetch_events":"https://pith.science/api/pith-number/FEWZIWVJX7IKICPGGUP4AGPLKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/action/storage_attestation","attest_author":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/action/author_attestation","sign_citation":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/action/citation_signature","submit_replication":"https://pith.science/pith/FEWZIWVJX7IKICPGGUP4AGPLKE/action/replication_record"}},"created_at":"2026-05-18T03:15:33.612157+00:00","updated_at":"2026-05-18T03:15:33.612157+00:00"}