{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BBRDSPF2PRON2FTCOG4EZEVLCW","short_pith_number":"pith:BBRDSPF2","schema_version":"1.0","canonical_sha256":"0862393cba7c5cdd166271b84c92ab15a528309e76970d5ed40e07619b22e2bc","source":{"kind":"arxiv","id":"1601.07363","version":2},"attestation_state":"computed","paper":{"title":"T-count optimization and Reed-Muller codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Matthew Amy, Michele Mosca","submitted_at":"2016-01-27T13:39:44Z","abstract_excerpt":"In this paper, we study the close relationship between Reed-Muller codes and single-qubit phase gates from the perspective of $T$-count optimization. We prove that minimizing the number of $T$ gates in an $n$-qubit quantum circuit over CNOT and $T$, together with the Clifford group powers of $T$, corresponds to finding a minimum distance decoding of a length $2^n-1$ binary vector in the order $n-4$ punctured Reed-Muller code. Moreover, we show that the problems are polynomially equivalent in the length of the code. As a consequence, we derive an algorithm for the optimization of $T$-count in q"},"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":"1601.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-27T13:39:44Z","cross_cats_sorted":[],"title_canon_sha256":"96c9d6667c611ee5f3f26b2ab65e61010734f31cb2c61669bd3c0f679fe45610","abstract_canon_sha256":"2c70a775d9afcd532c12d31615b09ebf88d9e0f5b726cdac09fc9ba842f13bb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:02.814027Z","signature_b64":"/Gx3jyoXVtF8+XUbb6jI/RzyBVC6pSE/5ZYHbHoIi1i33LA2bJkLw0clx4e6wInaHvrKgzWUyPh1t1/mn7pXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0862393cba7c5cdd166271b84c92ab15a528309e76970d5ed40e07619b22e2bc","last_reissued_at":"2026-05-17T23:50:02.813330Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:02.813330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"T-count optimization and Reed-Muller codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Matthew Amy, Michele Mosca","submitted_at":"2016-01-27T13:39:44Z","abstract_excerpt":"In this paper, we study the close relationship between Reed-Muller codes and single-qubit phase gates from the perspective of $T$-count optimization. We prove that minimizing the number of $T$ gates in an $n$-qubit quantum circuit over CNOT and $T$, together with the Clifford group powers of $T$, corresponds to finding a minimum distance decoding of a length $2^n-1$ binary vector in the order $n-4$ punctured Reed-Muller code. Moreover, we show that the problems are polynomially equivalent in the length of the code. As a consequence, we derive an algorithm for the optimization of $T$-count in q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07363","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":"1601.07363","created_at":"2026-05-17T23:50:02.813419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.07363v2","created_at":"2026-05-17T23:50:02.813419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07363","created_at":"2026-05-17T23:50:02.813419+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBRDSPF2PRON","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBRDSPF2PRON2FTC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBRDSPF2","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW","json":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW.json","graph_json":"https://pith.science/api/pith-number/BBRDSPF2PRON2FTCOG4EZEVLCW/graph.json","events_json":"https://pith.science/api/pith-number/BBRDSPF2PRON2FTCOG4EZEVLCW/events.json","paper":"https://pith.science/paper/BBRDSPF2"},"agent_actions":{"view_html":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW","download_json":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW.json","view_paper":"https://pith.science/paper/BBRDSPF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.07363&json=true","fetch_graph":"https://pith.science/api/pith-number/BBRDSPF2PRON2FTCOG4EZEVLCW/graph.json","fetch_events":"https://pith.science/api/pith-number/BBRDSPF2PRON2FTCOG4EZEVLCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/action/storage_attestation","attest_author":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/action/author_attestation","sign_citation":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/action/citation_signature","submit_replication":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/action/replication_record"}},"created_at":"2026-05-17T23:50:02.813419+00:00","updated_at":"2026-05-17T23:50:02.813419+00:00"}