{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BBRDSPF2PRON2FTCOG4EZEVLCW","short_pith_number":"pith:BBRDSPF2","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"},"canonical_sha256":"0862393cba7c5cdd166271b84c92ab15a528309e76970d5ed40e07619b22e2bc","source":{"kind":"arxiv","id":"1601.07363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07363","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07363v2","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07363","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"BBRDSPF2PRON","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BBRDSPF2PRON2FTC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BBRDSPF2","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BBRDSPF2PRON2FTCOG4EZEVLCW","target":"record","payload":{"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"},"canonical_sha256":"0862393cba7c5cdd166271b84c92ab15a528309e76970d5ed40e07619b22e2bc","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"},"source_kind":"arxiv","source_id":"1601.07363","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmS1ANZntihhO4wFs2o/ZaFH0rlP51h/BuTao9AgSqwLrqJC1UFjDiDsMEIohWERKW+/uSDsbRNf8yOROQE0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:59:21.356811Z"},"content_sha256":"08c9403e2331c8c17c504ce488400c40b891657614d7acba1ab200909d021d7e","schema_version":"1.0","event_id":"sha256:08c9403e2331c8c17c504ce488400c40b891657614d7acba1ab200909d021d7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BBRDSPF2PRON2FTCOG4EZEVLCW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhoU25HRL5k6j3T7mNIn/GPOQ5ZgzPd2blS1ga9xWMbU09krY++F6k+KxQlQ23v6JXz/e1azZ2Uh9m94BCsmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:59:21.357174Z"},"content_sha256":"ced1da37f766cee9a2245988c898f5c4c0ba0f0bf13cf27337c810770afc754e","schema_version":"1.0","event_id":"sha256:ced1da37f766cee9a2245988c898f5c4c0ba0f0bf13cf27337c810770afc754e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/bundle.json","state_url":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T09:59:21Z","links":{"resolver":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW","bundle":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/bundle.json","state":"https://pith.science/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBRDSPF2PRON2FTCOG4EZEVLCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BBRDSPF2PRON2FTCOG4EZEVLCW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2c70a775d9afcd532c12d31615b09ebf88d9e0f5b726cdac09fc9ba842f13bb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-27T13:39:44Z","title_canon_sha256":"96c9d6667c611ee5f3f26b2ab65e61010734f31cb2c61669bd3c0f679fe45610"},"schema_version":"1.0","source":{"id":"1601.07363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07363","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07363v2","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07363","created_at":"2026-05-17T23:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"BBRDSPF2PRON","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BBRDSPF2PRON2FTC","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BBRDSPF2","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:ced1da37f766cee9a2245988c898f5c4c0ba0f0bf13cf27337c810770afc754e","target":"graph","created_at":"2026-05-17T23:50:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Matthew Amy, Michele Mosca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-27T13:39:44Z","title":"T-count optimization and Reed-Muller codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07363","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:08c9403e2331c8c17c504ce488400c40b891657614d7acba1ab200909d021d7e","target":"record","created_at":"2026-05-17T23:50:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2c70a775d9afcd532c12d31615b09ebf88d9e0f5b726cdac09fc9ba842f13bb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-27T13:39:44Z","title_canon_sha256":"96c9d6667c611ee5f3f26b2ab65e61010734f31cb2c61669bd3c0f679fe45610"},"schema_version":"1.0","source":{"id":"1601.07363","kind":"arxiv","version":2}},"canonical_sha256":"0862393cba7c5cdd166271b84c92ab15a528309e76970d5ed40e07619b22e2bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0862393cba7c5cdd166271b84c92ab15a528309e76970d5ed40e07619b22e2bc","first_computed_at":"2026-05-17T23:50:02.813330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:02.813330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Gx3jyoXVtF8+XUbb6jI/RzyBVC6pSE/5ZYHbHoIi1i33LA2bJkLw0clx4e6wInaHvrKgzWUyPh1t1/mn7pXAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:02.814027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08c9403e2331c8c17c504ce488400c40b891657614d7acba1ab200909d021d7e","sha256:ced1da37f766cee9a2245988c898f5c4c0ba0f0bf13cf27337c810770afc754e"],"state_sha256":"83625b575a88e05dfeea84d4b0a95e8bb88d3c38c72e19cae1db5ff44328893b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coyKhH6VQjaH5AWZFP5YjUymYZ6bRQjtFxg6XIPFPuvGBa2jzEQWtrIBFszIBi6hv8/fXhgIAJFgpKUT+QxFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:59:21.359709Z","bundle_sha256":"f701a21e74c8b11c2777a64ad2da304833aca0ac56f2171703908258c852b872"}}