{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:22BMF2JRDMV3LAI4YEHG736A5R","short_pith_number":"pith:22BMF2JR","schema_version":"1.0","canonical_sha256":"d682c2e9311b2bb5811cc10e6fefc0ec7e54d544722452cf1c175c146a134288","source":{"kind":"arxiv","id":"quant-ph/0308006","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0308006","created_at":"2026-07-04T16:42:34.815790+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0308006v3","created_at":"2026-07-04T16:42:34.815790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0308006","created_at":"2026-07-04T16:42:34.815790+00:00"},{"alias_kind":"pith_short_12","alias_value":"22BMF2JRDMV3","created_at":"2026-07-04T16:42:34.815790+00:00"},{"alias_kind":"pith_short_16","alias_value":"22BMF2JRDMV3LAI4","created_at":"2026-07-04T16:42:34.815790+00:00"},{"alias_kind":"pith_short_8","alias_value":"22BMF2JR","created_at":"2026-07-04T16:42:34.815790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":164,"is_internal_anchor":true},{"citing_arxiv_id":"2208.13557","citing_title":"Controlled Gate Networks: Theory and Application to Eigenvalue Estimation","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2505.00543","citing_title":"GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R","json":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R.json","graph_json":"https://pith.science/api/pith-number/22BMF2JRDMV3LAI4YEHG736A5R/graph.json","events_json":"https://pith.science/api/pith-number/22BMF2JRDMV3LAI4YEHG736A5R/events.json","paper":"https://pith.science/paper/22BMF2JR"},"agent_actions":{"view_html":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R","download_json":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R.json","view_paper":"https://pith.science/paper/22BMF2JR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0308006&json=true","fetch_graph":"https://pith.science/api/pith-number/22BMF2JRDMV3LAI4YEHG736A5R/graph.json","fetch_events":"https://pith.science/api/pith-number/22BMF2JRDMV3LAI4YEHG736A5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/action/storage_attestation","attest_author":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/action/author_attestation","sign_citation":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/action/citation_signature","submit_replication":"https://pith.science/pith/22BMF2JRDMV3LAI4YEHG736A5R/action/replication_record"}},"created_at":"2026-07-04T16:42:34.815790+00:00","updated_at":"2026-07-04T16:42:34.815790+00:00"}