{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:WA3DOUG3AZEDAIGOKLB2DXDJ66","short_pith_number":"pith:WA3DOUG3","schema_version":"1.0","canonical_sha256":"b0363750db06483020ce52c3a1dc69f7a00da9169027a65c7ddefd16231c4ec5","source":{"kind":"arxiv","id":"quant-ph/0111122","version":2},"attestation_state":"computed","paper":{"title":"Two-qubit Projective Measurements are Universal for Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. W. Leung (IBM TJ Watson Research Center)","submitted_at":"2001-11-23T04:36:03Z","abstract_excerpt":"Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit measurements, which are both sufficient and necessary. We present a method to partially collapse the $C_k$-hierarchy in the indirect construction of unitary gates [Gottesman and Chuang, Nature, {\\bf 402} 309 (1999)], and apply the method to find discrete universal sets of 2-qubit measurements."},"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/0111122","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-11-23T04:36:03Z","cross_cats_sorted":[],"title_canon_sha256":"8842f26d89b6cadae7a140913c66886738f4734bcd8fa3ace05047c5ce80364e","abstract_canon_sha256":"d6a9818e41755c45b355cbc9fabc2249e9859304ea0e991944485c661e5215ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:44.241270Z","signature_b64":"eTuuGIIruKN3bd6Z6Kfd+X48ROIVxIlVq3la4xYhrciDlH91G7p9pUPLNPtuG3UQKDW1QAeiWsAd9RsFaV6fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0363750db06483020ce52c3a1dc69f7a00da9169027a65c7ddefd16231c4ec5","last_reissued_at":"2026-07-04T14:45:44.240930Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:44.240930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-qubit Projective Measurements are Universal for Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. W. Leung (IBM TJ Watson Research Center)","submitted_at":"2001-11-23T04:36:03Z","abstract_excerpt":"Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit measurements, which are both sufficient and necessary. We present a method to partially collapse the $C_k$-hierarchy in the indirect construction of unitary gates [Gottesman and Chuang, Nature, {\\bf 402} 309 (1999)], and apply the method to find discrete universal sets of 2-qubit measurements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0111122","kind":"arxiv","version":2},"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/0111122/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/0111122","created_at":"2026-07-04T14:45:44.240991+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0111122v2","created_at":"2026-07-04T14:45:44.240991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0111122","created_at":"2026-07-04T14:45:44.240991+00:00"},{"alias_kind":"pith_short_12","alias_value":"WA3DOUG3AZED","created_at":"2026-07-04T14:45:44.240991+00:00"},{"alias_kind":"pith_short_16","alias_value":"WA3DOUG3AZEDAIGO","created_at":"2026-07-04T14:45:44.240991+00:00"},{"alias_kind":"pith_short_8","alias_value":"WA3DOUG3","created_at":"2026-07-04T14:45:44.240991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.04252","citing_title":"A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66","json":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66.json","graph_json":"https://pith.science/api/pith-number/WA3DOUG3AZEDAIGOKLB2DXDJ66/graph.json","events_json":"https://pith.science/api/pith-number/WA3DOUG3AZEDAIGOKLB2DXDJ66/events.json","paper":"https://pith.science/paper/WA3DOUG3"},"agent_actions":{"view_html":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66","download_json":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66.json","view_paper":"https://pith.science/paper/WA3DOUG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0111122&json=true","fetch_graph":"https://pith.science/api/pith-number/WA3DOUG3AZEDAIGOKLB2DXDJ66/graph.json","fetch_events":"https://pith.science/api/pith-number/WA3DOUG3AZEDAIGOKLB2DXDJ66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66/action/storage_attestation","attest_author":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66/action/author_attestation","sign_citation":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66/action/citation_signature","submit_replication":"https://pith.science/pith/WA3DOUG3AZEDAIGOKLB2DXDJ66/action/replication_record"}},"created_at":"2026-07-04T14:45:44.240991+00:00","updated_at":"2026-07-04T14:45:44.240991+00:00"}