{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CCHZDQ32WHWUYW255ZW5V5BN4A","short_pith_number":"pith:CCHZDQ32","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"},"canonical_sha256":"108f91c37ab1ed4c5b5dee6ddaf42de037133a23a3af1b5e9e6e9a739ff2505c","source":{"kind":"arxiv","id":"1303.2042","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2042","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2042v2","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2042","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"CCHZDQ32WHWU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CCHZDQ32WHWUYW25","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CCHZDQ32","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CCHZDQ32WHWUYW255ZW5V5BN4A","target":"record","payload":{"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"},"canonical_sha256":"108f91c37ab1ed4c5b5dee6ddaf42de037133a23a3af1b5e9e6e9a739ff2505c","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"},"source_kind":"arxiv","source_id":"1303.2042","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-18T02:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbFS3aIjktw3YlXTnW902VoDE6jL1BZr/y11/pNVngG5PI/H66z91iot5VsTEginq8X4gZ952D4xf9SZVQTICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:26:00.284776Z"},"content_sha256":"acee33f2504430e8ecd0306fdc0ca71acd2abf952959e11960c9e79c9a2e0391","schema_version":"1.0","event_id":"sha256:acee33f2504430e8ecd0306fdc0ca71acd2abf952959e11960c9e79c9a2e0391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CCHZDQ32WHWUYW255ZW5V5BN4A","target":"graph","payload":{"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"},"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-18T02:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwbQqejdDpU/f8nxWkOw0Wy4sryqvXSCvFPOOm+Osna+urKzNvgs/PILpNwVkL7FIGw+uEykzSpihx6oVOzIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:26:00.285143Z"},"content_sha256":"8e3cefeba67cbf7cfd6e8f29ec8658937c75cc6325ab18c457fd80e563e112a6","schema_version":"1.0","event_id":"sha256:8e3cefeba67cbf7cfd6e8f29ec8658937c75cc6325ab18c457fd80e563e112a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/bundle.json","state_url":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/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-07-01T15:26:00Z","links":{"resolver":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A","bundle":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/bundle.json","state":"https://pith.science/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCHZDQ32WHWUYW255ZW5V5BN4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CCHZDQ32WHWUYW255ZW5V5BN4A","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":"507b7437cd18c4b00ace6166886da4be2e9bd076b4d002b28d1d0f5c4ca924a2","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-08T16:20:34Z","title_canon_sha256":"d1de31b5e48a6ca572dcfa0e10f58b867fd67da40aeae5deca8c766a8fa81fad"},"schema_version":"1.0","source":{"id":"1303.2042","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2042","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2042v2","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2042","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"CCHZDQ32WHWU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CCHZDQ32WHWUYW25","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CCHZDQ32","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:8e3cefeba67cbf7cfd6e8f29ec8658937c75cc6325ab18c457fd80e563e112a6","target":"graph","created_at":"2026-05-18T02:35:52Z","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":"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","authors_text":"Dmitri Maslov, Matthew Amy, Michele Mosca","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-08T16:20:34Z","title":"Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2042","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:acee33f2504430e8ecd0306fdc0ca71acd2abf952959e11960c9e79c9a2e0391","target":"record","created_at":"2026-05-18T02:35:52Z","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":"507b7437cd18c4b00ace6166886da4be2e9bd076b4d002b28d1d0f5c4ca924a2","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-03-08T16:20:34Z","title_canon_sha256":"d1de31b5e48a6ca572dcfa0e10f58b867fd67da40aeae5deca8c766a8fa81fad"},"schema_version":"1.0","source":{"id":"1303.2042","kind":"arxiv","version":2}},"canonical_sha256":"108f91c37ab1ed4c5b5dee6ddaf42de037133a23a3af1b5e9e6e9a739ff2505c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"108f91c37ab1ed4c5b5dee6ddaf42de037133a23a3af1b5e9e6e9a739ff2505c","first_computed_at":"2026-05-18T02:35:52.539329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:52.539329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6TA/CLYC60FS8ZyUVn1LgUBQZgk+niFybz3t/JyMrZLH72iLjc3evdntCmKTfr199pAW6NquKchqUrZnYDrQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:52.539909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2042","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acee33f2504430e8ecd0306fdc0ca71acd2abf952959e11960c9e79c9a2e0391","sha256:8e3cefeba67cbf7cfd6e8f29ec8658937c75cc6325ab18c457fd80e563e112a6"],"state_sha256":"69dab48e62ce8a6d595b863c6f2f490fb61636a6be887bdef56126d0a95a1664"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XNKzy3lJOZGqos2XDkmkdnEchXqaV/NYKUH7lE6DNLHywjTIl1Mznp4L4TdT0P5t6Vayxy/dglAQ3tIpbhODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:26:00.287161Z","bundle_sha256":"effc30dfeace2df639b78678b6ed13e0486d21db3aa1fd389646273dc94ac2e6"}}