{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1995:WS2K6DPLQOASC2XHKLS6OFAK4L","short_pith_number":"pith:WS2K6DPL","canonical_record":{"source":{"id":"quant-ph/9503016","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-03-23T15:16:16Z","cross_cats_sorted":["cond-mat","hep-th"],"title_canon_sha256":"1c5185537367d8877e761821d6ade5709d02814aad0a8fb421050d8bed886dbd","abstract_canon_sha256":"c4fcd80323e7b9184bb304b55d656eec55cb600ac52ff083e369d4edbe97a0ee"},"schema_version":"1.0"},"canonical_sha256":"b4b4af0deb8381216ae752e5e7140ae2ccbf18c7d1381db0a6a05a760890fb64","source":{"kind":"arxiv","id":"quant-ph/9503016","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9503016","created_at":"2026-05-18T01:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9503016v1","created_at":"2026-05-18T01:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9503016","created_at":"2026-05-18T01:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"WS2K6DPLQOAS","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"WS2K6DPLQOASC2XH","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"WS2K6DPL","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1995:WS2K6DPLQOASC2XHKLS6OFAK4L","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/9503016","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1995-03-23T15:16:16Z","cross_cats_sorted":["cond-mat","hep-th"],"title_canon_sha256":"1c5185537367d8877e761821d6ade5709d02814aad0a8fb421050d8bed886dbd","abstract_canon_sha256":"c4fcd80323e7b9184bb304b55d656eec55cb600ac52ff083e369d4edbe97a0ee"},"schema_version":"1.0"},"canonical_sha256":"b4b4af0deb8381216ae752e5e7140ae2ccbf18c7d1381db0a6a05a760890fb64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:02.207133Z","signature_b64":"eQKBI4VgV81R3efiD4jNIrKB0Ehba2uQW/AyGa/5srLkPOSfkGWXvWWcYEBXmwEHti8Hy6wuPiHJLQp6/NjfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4b4af0deb8381216ae752e5e7140ae2ccbf18c7d1381db0a6a05a760890fb64","last_reissued_at":"2026-05-18T01:05:02.206565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:02.206565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/9503016","source_version":1,"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-18T01:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcVaAgRcoVZLXXfmmRSkL8ZAAMzBYhSRCEgxozwfPUnVP9eye2MOnYoG6ISFua9LtTe9s/ZXWWctbUnsxk5yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:37:42.208677Z"},"content_sha256":"f347711f70cf01e38a3c0bf54aa35c38f8bab9d60aef980e0101e97872785a1a","schema_version":"1.0","event_id":"sha256:f347711f70cf01e38a3c0bf54aa35c38f8bab9d60aef980e0101e97872785a1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1995:WS2K6DPLQOASC2XHKLS6OFAK4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Elementary gates for quantum computation","license":"","headline":"","cross_cats":["cond-mat","hep-th"],"primary_cat":"quant-ph","authors_text":"A. Barenco (Oxford), C. H. Bennett (IBM), D. P. DiVincenzo (IBM), H. Weinfurter (Innsbruck), J. Smolin (UCLA), N. Margolus (MIT), P. Shor (AT&T), R. Cleve (Calgary), T. Sleator (NYU)","submitted_at":"1995-03-23T15:16:16Z","abstract_excerpt":"We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \\oplus y)$) is universal in the sense that all unitary operations on arbitrarily many bits $n$ (U($2^n$)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9503016","kind":"arxiv","version":1},"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-18T01:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMINvJKiZjukaFIiQLQUdbTxl4vMe+yfQ4tB3Flg8V1fhoX1kcELuISDRRTflL/iToqsbLfbnNG7jkDAL7W/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T17:37:42.209341Z"},"content_sha256":"1d36a928a374647e9ea5edc4362d73ae6444c00c81734d9af65c03ecb70d64dd","schema_version":"1.0","event_id":"sha256:1d36a928a374647e9ea5edc4362d73ae6444c00c81734d9af65c03ecb70d64dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/bundle.json","state_url":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/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-18T17:37:42Z","links":{"resolver":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L","bundle":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/bundle.json","state":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:WS2K6DPLQOASC2XHKLS6OFAK4L","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":"c4fcd80323e7b9184bb304b55d656eec55cb600ac52ff083e369d4edbe97a0ee","cross_cats_sorted":["cond-mat","hep-th"],"license":"","primary_cat":"quant-ph","submitted_at":"1995-03-23T15:16:16Z","title_canon_sha256":"1c5185537367d8877e761821d6ade5709d02814aad0a8fb421050d8bed886dbd"},"schema_version":"1.0","source":{"id":"quant-ph/9503016","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9503016","created_at":"2026-05-18T01:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9503016v1","created_at":"2026-05-18T01:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9503016","created_at":"2026-05-18T01:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"WS2K6DPLQOAS","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"WS2K6DPLQOASC2XH","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"WS2K6DPL","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:1d36a928a374647e9ea5edc4362d73ae6444c00c81734d9af65c03ecb70d64dd","target":"graph","created_at":"2026-05-18T01:05: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":"We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \\oplus y)$) is universal in the sense that all unitary operations on arbitrarily many bits $n$ (U($2^n$)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in ","authors_text":"A. Barenco (Oxford), C. H. Bennett (IBM), D. P. DiVincenzo (IBM), H. Weinfurter (Innsbruck), J. Smolin (UCLA), N. Margolus (MIT), P. Shor (AT&T), R. Cleve (Calgary), T. Sleator (NYU)","cross_cats":["cond-mat","hep-th"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"1995-03-23T15:16:16Z","title":"Elementary gates for quantum computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9503016","kind":"arxiv","version":1},"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:f347711f70cf01e38a3c0bf54aa35c38f8bab9d60aef980e0101e97872785a1a","target":"record","created_at":"2026-05-18T01:05: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":"c4fcd80323e7b9184bb304b55d656eec55cb600ac52ff083e369d4edbe97a0ee","cross_cats_sorted":["cond-mat","hep-th"],"license":"","primary_cat":"quant-ph","submitted_at":"1995-03-23T15:16:16Z","title_canon_sha256":"1c5185537367d8877e761821d6ade5709d02814aad0a8fb421050d8bed886dbd"},"schema_version":"1.0","source":{"id":"quant-ph/9503016","kind":"arxiv","version":1}},"canonical_sha256":"b4b4af0deb8381216ae752e5e7140ae2ccbf18c7d1381db0a6a05a760890fb64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4b4af0deb8381216ae752e5e7140ae2ccbf18c7d1381db0a6a05a760890fb64","first_computed_at":"2026-05-18T01:05:02.206565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:02.206565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eQKBI4VgV81R3efiD4jNIrKB0Ehba2uQW/AyGa/5srLkPOSfkGWXvWWcYEBXmwEHti8Hy6wuPiHJLQp6/NjfBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:02.207133Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/9503016","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f347711f70cf01e38a3c0bf54aa35c38f8bab9d60aef980e0101e97872785a1a","sha256:1d36a928a374647e9ea5edc4362d73ae6444c00c81734d9af65c03ecb70d64dd"],"state_sha256":"212decd35d1d51a38556501c0c8ab3b1dbffb7817e4bdb1301a9ee8b3a9bdb71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ns4ddMUVwv7hCNoSIjHP+APlfLwZaQlUN3joI4Yi6SlmUPvuYKhwtT+Gi49yhmNXF3oYLeMgpnjKuZn/7RJ2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T17:37:42.211427Z","bundle_sha256":"424ab8e5e8e37c5e97dd17317ebba8de131e41d523d8e6114925b728d6b32378"}}