{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IK7SNW2KGQDT4C4SX5QMHHK5O7","short_pith_number":"pith:IK7SNW2K","canonical_record":{"source":{"id":"1206.0758","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-04T20:35:37Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"55ad11c98ceb6efcd0208a4a5d6e178610e08d0a0063dbda1fff5080dc47f649","abstract_canon_sha256":"bde3e6ee19bd1b679635fa28679b4557b73c91493155a42003efd2963036db13"},"schema_version":"1.0"},"canonical_sha256":"42bf26db4a34073e0b92bf60c39d5d77d2ae0bf3b1d1902706a804a26fcf9e2b","source":{"kind":"arxiv","id":"1206.0758","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0758","created_at":"2026-05-18T03:06:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0758v3","created_at":"2026-05-18T03:06:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0758","created_at":"2026-05-18T03:06:05Z"},{"alias_kind":"pith_short_12","alias_value":"IK7SNW2KGQDT","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IK7SNW2KGQDT4C4S","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IK7SNW2K","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IK7SNW2KGQDT4C4SX5QMHHK5O7","target":"record","payload":{"canonical_record":{"source":{"id":"1206.0758","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-04T20:35:37Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"55ad11c98ceb6efcd0208a4a5d6e178610e08d0a0063dbda1fff5080dc47f649","abstract_canon_sha256":"bde3e6ee19bd1b679635fa28679b4557b73c91493155a42003efd2963036db13"},"schema_version":"1.0"},"canonical_sha256":"42bf26db4a34073e0b92bf60c39d5d77d2ae0bf3b1d1902706a804a26fcf9e2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:05.701957Z","signature_b64":"OB5W8bflYyDATL4scFrHpnHeELUH7UbUHF6sTDUFQ4MBExsFUIsIi7I2Qkq4bVg3oIAbm+YlVfn3enctmBAHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42bf26db4a34073e0b92bf60c39d5d77d2ae0bf3b1d1902706a804a26fcf9e2b","last_reissued_at":"2026-05-18T03:06:05.701557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:05.701557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.0758","source_version":3,"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-18T03:06:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhCcEmtrRDNtP2V1CggNJV6uivxQKlZv6WyLcxwItbQVW9qz0ESQu/P1xQ+KfUhdI4o45GdtqByhES8QMsLHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:45:10.700948Z"},"content_sha256":"dd8e0d657d4d9f161e58592bfbab476c71ae5aaa941aeeae1bed88c81b260857","schema_version":"1.0","event_id":"sha256:dd8e0d657d4d9f161e58592bfbab476c71ae5aaa941aeeae1bed88c81b260857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IK7SNW2KGQDT4C4SX5QMHHK5O7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Dmitri Maslov, Martin Roetteler, Matthew Amy, Michele Mosca","submitted_at":"2012-06-04T20:35:37Z","abstract_excerpt":"We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speed-up over simple brute force algorithms. As an illustration of our method we implemented this algorithm and found factorizations of the commonly used quantum logical operations into elementary gates in the Clifford+T set. In particular, we report a decomposition of the Toffoli gate over the set of Clifford and T gates. Our decomposition achieves a total T-depth of 3, thereby providing a 40% reduction over the previously best known deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0758","kind":"arxiv","version":3},"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-18T03:06:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n60+IYUZUtVdQPTo8Xi3Johag3/SsNTiWttbKuor5xVSw14mSeyL9j+NB3nbg5EnKNKZ+VDW0KshfDzQyPvnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:45:10.701515Z"},"content_sha256":"7a8b41ee9dd0f8ea08d0ff28dc430c69ba3e81c3fe8d6ec37284c5f4a2df6607","schema_version":"1.0","event_id":"sha256:7a8b41ee9dd0f8ea08d0ff28dc430c69ba3e81c3fe8d6ec37284c5f4a2df6607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IK7SNW2KGQDT4C4SX5QMHHK5O7/bundle.json","state_url":"https://pith.science/pith/IK7SNW2KGQDT4C4SX5QMHHK5O7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IK7SNW2KGQDT4C4SX5QMHHK5O7/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-06-05T04:45:10Z","links":{"resolver":"https://pith.science/pith/IK7SNW2KGQDT4C4SX5QMHHK5O7","bundle":"https://pith.science/pith/IK7SNW2KGQDT4C4SX5QMHHK5O7/bundle.json","state":"https://pith.science/pith/IK7SNW2KGQDT4C4SX5QMHHK5O7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IK7SNW2KGQDT4C4SX5QMHHK5O7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IK7SNW2KGQDT4C4SX5QMHHK5O7","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":"bde3e6ee19bd1b679635fa28679b4557b73c91493155a42003efd2963036db13","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-04T20:35:37Z","title_canon_sha256":"55ad11c98ceb6efcd0208a4a5d6e178610e08d0a0063dbda1fff5080dc47f649"},"schema_version":"1.0","source":{"id":"1206.0758","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0758","created_at":"2026-05-18T03:06:05Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0758v3","created_at":"2026-05-18T03:06:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0758","created_at":"2026-05-18T03:06:05Z"},{"alias_kind":"pith_short_12","alias_value":"IK7SNW2KGQDT","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IK7SNW2KGQDT4C4S","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IK7SNW2K","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:7a8b41ee9dd0f8ea08d0ff28dc430c69ba3e81c3fe8d6ec37284c5f4a2df6607","target":"graph","created_at":"2026-05-18T03:06:05Z","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":"We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speed-up over simple brute force algorithms. As an illustration of our method we implemented this algorithm and found factorizations of the commonly used quantum logical operations into elementary gates in the Clifford+T set. In particular, we report a decomposition of the Toffoli gate over the set of Clifford and T gates. Our decomposition achieves a total T-depth of 3, thereby providing a 40% reduction over the previously best known deco","authors_text":"Dmitri Maslov, Martin Roetteler, Matthew Amy, Michele Mosca","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-04T20:35:37Z","title":"A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0758","kind":"arxiv","version":3},"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:dd8e0d657d4d9f161e58592bfbab476c71ae5aaa941aeeae1bed88c81b260857","target":"record","created_at":"2026-05-18T03:06:05Z","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":"bde3e6ee19bd1b679635fa28679b4557b73c91493155a42003efd2963036db13","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-04T20:35:37Z","title_canon_sha256":"55ad11c98ceb6efcd0208a4a5d6e178610e08d0a0063dbda1fff5080dc47f649"},"schema_version":"1.0","source":{"id":"1206.0758","kind":"arxiv","version":3}},"canonical_sha256":"42bf26db4a34073e0b92bf60c39d5d77d2ae0bf3b1d1902706a804a26fcf9e2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42bf26db4a34073e0b92bf60c39d5d77d2ae0bf3b1d1902706a804a26fcf9e2b","first_computed_at":"2026-05-18T03:06:05.701557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:05.701557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OB5W8bflYyDATL4scFrHpnHeELUH7UbUHF6sTDUFQ4MBExsFUIsIi7I2Qkq4bVg3oIAbm+YlVfn3enctmBAHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:05.701957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0758","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd8e0d657d4d9f161e58592bfbab476c71ae5aaa941aeeae1bed88c81b260857","sha256:7a8b41ee9dd0f8ea08d0ff28dc430c69ba3e81c3fe8d6ec37284c5f4a2df6607"],"state_sha256":"f778be2d8079c72d39377b46c6930e19a7024d728c6d2b036f985663fdef8348"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bU4Hs6AnEp3U7BAD3Qc/Jj/rpBMrZH3sPbc5UCAo8OtYRwVE9llJivrXkLvIvuWap3b8/i/84vBSkrQXHvKfBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:45:10.704641Z","bundle_sha256":"55e2c4309ac2510889026f2295c81f8dcdbf30e8daf58a8bfda8ef471c74db09"}}