{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:22BMF2JRDMV3LAI4YEHG736A5R","short_pith_number":"pith:22BMF2JR","canonical_record":{"source":{"id":"quant-ph/0308006","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-08-01T07:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"9de52ab2bcf07a117a58532f84edc4f75e6cdee78af58bc2598989ded1762bec","abstract_canon_sha256":"9eed71bb666048d3c3bb76c76985e65134977ae4045d9065fba8e740785c1e92"},"schema_version":"1.0"},"canonical_sha256":"d682c2e9311b2bb5811cc10e6fefc0ec7e54d544722452cf1c175c146a134288","source":{"kind":"arxiv","id":"quant-ph/0308006","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0308006","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0308006v3","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0308006","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"22BMF2JRDMV3","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"pith_short_16","alias_value":"22BMF2JRDMV3LAI4","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"pith_short_8","alias_value":"22BMF2JR","created_at":"2026-07-04T16:42:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:22BMF2JRDMV3LAI4YEHG736A5R","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0308006","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-08-01T07:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"9de52ab2bcf07a117a58532f84edc4f75e6cdee78af58bc2598989ded1762bec","abstract_canon_sha256":"9eed71bb666048d3c3bb76c76985e65134977ae4045d9065fba8e740785c1e92"},"schema_version":"1.0"},"canonical_sha256":"d682c2e9311b2bb5811cc10e6fefc0ec7e54d544722452cf1c175c146a134288","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:42:34.816142Z","signature_b64":"TBGTa8ZSwTiEj/VlGYPsUjDxhgVv3UGteIZmhwQPnyBFD3nWvEx4QbgPsawSybldfvFrSZHu659t0x4Cvfb9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d682c2e9311b2bb5811cc10e6fefc0ec7e54d544722452cf1c175c146a134288","last_reissued_at":"2026-07-04T16:42:34.815711Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:42:34.815711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0308006","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-07-04T16:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGpF7AnVOMgYZy5xJivXpCzaLzTQVoefu7P5M+qRs3WiCSq0v0RqYaqeB8oB7EQkPBygo8c3CbQoPiH3wWZzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T14:01:11.556691Z"},"content_sha256":"02d598b308e814bfd7540c9e07d17ad902d4c7e15df3cc291a6d562c1403a062","schema_version":"1.0","event_id":"sha256:02d598b308e814bfd7540c9e07d17ad902d4c7e15df3cc291a6d562c1403a062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:22BMF2JRDMV3LAI4YEHG736A5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Quantum Circuits for General Two-Qubit Gates","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Colin Williams, Farrokh Vatan","submitted_at":"2003-08-01T07:43:29Z","abstract_excerpt":"In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0308006","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0308006/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T16:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRgtF07OQX5s9KazotCFZsSbHF/cNk/Ks6IexURB35fFjr+bc7q/5POVBKPiJoA+h353bctP+zPqiBplvTJxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T14:01:11.557150Z"},"content_sha256":"236b2f86210b476ac388d815076557b4479e346d064433f7006e3b641913864b","schema_version":"1.0","event_id":"sha256:236b2f86210b476ac388d815076557b4479e346d064433f7006e3b641913864b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/bundle.json","state_url":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22BMF2JRDMV3LAI4YEHG736A5R/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-08-01T14:01:11Z","links":{"resolver":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R","bundle":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/bundle.json","state":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22BMF2JRDMV3LAI4YEHG736A5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:22BMF2JRDMV3LAI4YEHG736A5R","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":"9eed71bb666048d3c3bb76c76985e65134977ae4045d9065fba8e740785c1e92","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-08-01T07:43:29Z","title_canon_sha256":"9de52ab2bcf07a117a58532f84edc4f75e6cdee78af58bc2598989ded1762bec"},"schema_version":"1.0","source":{"id":"quant-ph/0308006","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0308006","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0308006v3","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0308006","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"22BMF2JRDMV3","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"pith_short_16","alias_value":"22BMF2JRDMV3LAI4","created_at":"2026-07-04T16:42:34Z"},{"alias_kind":"pith_short_8","alias_value":"22BMF2JR","created_at":"2026-07-04T16:42:34Z"}],"graph_snapshots":[{"event_id":"sha256:236b2f86210b476ac388d815076557b4479e346d064433f7006e3b641913864b","target":"graph","created_at":"2026-07-04T16:42:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0308006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at","authors_text":"Colin Williams, Farrokh Vatan","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-08-01T07:43:29Z","title":"Optimal Quantum Circuits for General Two-Qubit Gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0308006","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:02d598b308e814bfd7540c9e07d17ad902d4c7e15df3cc291a6d562c1403a062","target":"record","created_at":"2026-07-04T16:42:34Z","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":"9eed71bb666048d3c3bb76c76985e65134977ae4045d9065fba8e740785c1e92","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-08-01T07:43:29Z","title_canon_sha256":"9de52ab2bcf07a117a58532f84edc4f75e6cdee78af58bc2598989ded1762bec"},"schema_version":"1.0","source":{"id":"quant-ph/0308006","kind":"arxiv","version":3}},"canonical_sha256":"d682c2e9311b2bb5811cc10e6fefc0ec7e54d544722452cf1c175c146a134288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d682c2e9311b2bb5811cc10e6fefc0ec7e54d544722452cf1c175c146a134288","first_computed_at":"2026-07-04T16:42:34.815711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T16:42:34.815711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TBGTa8ZSwTiEj/VlGYPsUjDxhgVv3UGteIZmhwQPnyBFD3nWvEx4QbgPsawSybldfvFrSZHu659t0x4Cvfb9Dg==","signature_status":"signed_v1","signed_at":"2026-07-04T16:42:34.816142Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0308006","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02d598b308e814bfd7540c9e07d17ad902d4c7e15df3cc291a6d562c1403a062","sha256:236b2f86210b476ac388d815076557b4479e346d064433f7006e3b641913864b"],"state_sha256":"d52527b88176a2eea07cb09e0761636afdc56818632f81dad4d4687c80ca631f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIWrzC+PG6y+goUtyYXUUdWn0toSX+NQL84fd4oMr7KvjMUsMf/7vbERZDlKOOHOhtbnOk9cbrRWbNy3uQLLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T14:01:11.562193Z","bundle_sha256":"df9a96bcf6727586efad95ddc5ef61e308f5584bf1adf5e6e420f6a92f5224ac"}}