{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:2TKP5L6CRVCNVXLDIQRTT64RBA","short_pith_number":"pith:2TKP5L6C","schema_version":"1.0","canonical_sha256":"d4d4feafc28d44dadd63442339fb9108330102172a9ce56b30d7e2ae556a9d09","source":{"kind":"arxiv","id":"quant-ph/0207072","version":1},"attestation_state":"computed","paper":{"title":"A practical scheme for quantum computation with any two-qubit entangling gate","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexei Gilchrist, Aram W. Harrow, Christopher M. Dawson, Duncan Mortimer, Jennifer L. Dodd, Michael A. Nielsen, Michael J. Bremner, Tobias J. Osborne","submitted_at":"2002-07-12T06:16:21Z","abstract_excerpt":"Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. Here we present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this important result for systems of arbitrary finite dimension has been provided by J. L. and R. Brylinski [arXiv:q"},"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/0207072","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-07-12T06:16:21Z","cross_cats_sorted":[],"title_canon_sha256":"b0ba7096bced7701ded8c61a1a9f5f398df6e87cefbf1f55e024592db119066a","abstract_canon_sha256":"0646177d53125652c888a83141474aa98b82f5d5ed2b1f2a844570563e6353dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:36:07.175180Z","signature_b64":"CFb5sfPcueqvg7E86nT6vuBgQkcYApYtf3FP/YFfS5t6ErcWCUslo6NT8Xh4zGRobf3k8ZV6RS9gqLWerH1MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4d4feafc28d44dadd63442339fb9108330102172a9ce56b30d7e2ae556a9d09","last_reissued_at":"2026-07-04T16:36:07.174812Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:36:07.174812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A practical scheme for quantum computation with any two-qubit entangling gate","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexei Gilchrist, Aram W. Harrow, Christopher M. Dawson, Duncan Mortimer, Jennifer L. Dodd, Michael A. Nielsen, Michael J. Bremner, Tobias J. Osborne","submitted_at":"2002-07-12T06:16:21Z","abstract_excerpt":"Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. Here we present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this important result for systems of arbitrary finite dimension has been provided by J. L. and R. Brylinski [arXiv:q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0207072","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0207072/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/0207072","created_at":"2026-07-04T16:36:07.174877+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0207072v1","created_at":"2026-07-04T16:36:07.174877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0207072","created_at":"2026-07-04T16:36:07.174877+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TKP5L6CRVCN","created_at":"2026-07-04T16:36:07.174877+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TKP5L6CRVCNVXLD","created_at":"2026-07-04T16:36:07.174877+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TKP5L6C","created_at":"2026-07-04T16:36:07.174877+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07668","citing_title":"Bridging Krylov Complexity and Universal Analog Quantum Simulator","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA","json":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA.json","graph_json":"https://pith.science/api/pith-number/2TKP5L6CRVCNVXLDIQRTT64RBA/graph.json","events_json":"https://pith.science/api/pith-number/2TKP5L6CRVCNVXLDIQRTT64RBA/events.json","paper":"https://pith.science/paper/2TKP5L6C"},"agent_actions":{"view_html":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA","download_json":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA.json","view_paper":"https://pith.science/paper/2TKP5L6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0207072&json=true","fetch_graph":"https://pith.science/api/pith-number/2TKP5L6CRVCNVXLDIQRTT64RBA/graph.json","fetch_events":"https://pith.science/api/pith-number/2TKP5L6CRVCNVXLDIQRTT64RBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA/action/storage_attestation","attest_author":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA/action/author_attestation","sign_citation":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA/action/citation_signature","submit_replication":"https://pith.science/pith/2TKP5L6CRVCNVXLDIQRTT64RBA/action/replication_record"}},"created_at":"2026-07-04T16:36:07.174877+00:00","updated_at":"2026-07-04T16:36:07.174877+00:00"}