{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:WS2K6DPLQOASC2XHKLS6OFAK4L","short_pith_number":"pith:WS2K6DPL","schema_version":"1.0","canonical_sha256":"b4b4af0deb8381216ae752e5e7140ae2ccbf18c7d1381db0a6a05a760890fb64","source":{"kind":"arxiv","id":"quant-ph/9503016","version":1},"attestation_state":"computed","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 "},"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/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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9503016","created_at":"2026-05-18T01:05:02.206645+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9503016v1","created_at":"2026-05-18T01:05:02.206645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9503016","created_at":"2026-05-18T01:05:02.206645+00:00"},{"alias_kind":"pith_short_12","alias_value":"WS2K6DPLQOAS","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"WS2K6DPLQOASC2XH","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"WS2K6DPL","created_at":"2026-05-18T12:25:47.700082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"quant-ph/9511026","citing_title":"Quantum measurements and the Abelian Stabilizer Problem","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05479","citing_title":"Quantum Simulation of the Real-time Dynamics in the multi-flavor Gross-Neveu Model at the utility scale using Superconducting Quantum Computers","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11616","citing_title":"Quantum simulating multi-particle processes in high energy nuclear physics: dijet production and color (de)coherence","ref_index":88,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07668","citing_title":"Bridging Krylov Complexity and Universal Analog Quantum Simulator","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L","json":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L.json","graph_json":"https://pith.science/api/pith-number/WS2K6DPLQOASC2XHKLS6OFAK4L/graph.json","events_json":"https://pith.science/api/pith-number/WS2K6DPLQOASC2XHKLS6OFAK4L/events.json","paper":"https://pith.science/paper/WS2K6DPL"},"agent_actions":{"view_html":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L","download_json":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L.json","view_paper":"https://pith.science/paper/WS2K6DPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9503016&json=true","fetch_graph":"https://pith.science/api/pith-number/WS2K6DPLQOASC2XHKLS6OFAK4L/graph.json","fetch_events":"https://pith.science/api/pith-number/WS2K6DPLQOASC2XHKLS6OFAK4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/action/storage_attestation","attest_author":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/action/author_attestation","sign_citation":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/action/citation_signature","submit_replication":"https://pith.science/pith/WS2K6DPLQOASC2XHKLS6OFAK4L/action/replication_record"}},"created_at":"2026-05-18T01:05:02.206645+00:00","updated_at":"2026-05-18T01:05:02.206645+00:00"}