{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CCHZDQ32WHWUYW255ZW5V5BN4A","short_pith_number":"pith:CCHZDQ32","schema_version":"1.0","canonical_sha256":"108f91c37ab1ed4c5b5dee6ddaf42de037133a23a3af1b5e9e6e9a739ff2505c","source":{"kind":"arxiv","id":"1303.2042","version":2},"attestation_state":"computed","paper":{"title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Matthew Amy, Michele Mosca","submitted_at":"2013-03-08T16:20:34Z","abstract_excerpt":"Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates into consideration. Our algorithm re-synthesizes quantum circuits composed of Clifford group and T gates, the latter being typically the most costly gate in fault-tolerant models, e.g., those based on the Steane or surface codes, with the purpose of minimizing both T-count and T-depth. A major feature of the algorithm is the ability t"},"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":"1303.2042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-08T16:20:34Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"d1de31b5e48a6ca572dcfa0e10f58b867fd67da40aeae5deca8c766a8fa81fad","abstract_canon_sha256":"507b7437cd18c4b00ace6166886da4be2e9bd076b4d002b28d1d0f5c4ca924a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:52.539909Z","signature_b64":"6TA/CLYC60FS8ZyUVn1LgUBQZgk+niFybz3t/JyMrZLH72iLjc3evdntCmKTfr199pAW6NquKchqUrZnYDrQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"108f91c37ab1ed4c5b5dee6ddaf42de037133a23a3af1b5e9e6e9a739ff2505c","last_reissued_at":"2026-05-18T02:35:52.539329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:52.539329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Matthew Amy, Michele Mosca","submitted_at":"2013-03-08T16:20:34Z","abstract_excerpt":"Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates into consideration. Our algorithm re-synthesizes quantum circuits composed of Clifford group and T gates, the latter being typically the most costly gate in fault-tolerant models, e.g., those based on the Steane or surface codes, with the purpose of minimizing both T-count and T-depth. A major feature of the algorithm is the ability t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2042","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":""},"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":"1303.2042","created_at":"2026-05-18T02:35:52.539435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2042v2","created_at":"2026-05-18T02:35:52.539435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2042","created_at":"2026-05-18T02:35:52.539435+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCHZDQ32WHWU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCHZDQ32WHWUYW25","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCHZDQ32","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A","json":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A.json","graph_json":"https://pith.science/api/pith-number/CCHZDQ32WHWUYW255ZW5V5BN4A/graph.json","events_json":"https://pith.science/api/pith-number/CCHZDQ32WHWUYW255ZW5V5BN4A/events.json","paper":"https://pith.science/paper/CCHZDQ32"},"agent_actions":{"view_html":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A","download_json":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A.json","view_paper":"https://pith.science/paper/CCHZDQ32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2042&json=true","fetch_graph":"https://pith.science/api/pith-number/CCHZDQ32WHWUYW255ZW5V5BN4A/graph.json","fetch_events":"https://pith.science/api/pith-number/CCHZDQ32WHWUYW255ZW5V5BN4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/action/storage_attestation","attest_author":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/action/author_attestation","sign_citation":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/action/citation_signature","submit_replication":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/action/replication_record"}},"created_at":"2026-05-18T02:35:52.539435+00:00","updated_at":"2026-05-18T02:35:52.539435+00:00"}