{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:NOQEFQJQV62QG6VMOIXDEASBH4","short_pith_number":"pith:NOQEFQJQ","schema_version":"1.0","canonical_sha256":"6ba042c130afb5037aac722e3202413f03d66b301cad7776e5a819412cb46adf","source":{"kind":"arxiv","id":"quant-ph/0504111","version":2},"attestation_state":"computed","paper":{"title":"Efficient Graph State Construction Under the Barrett and Kok Scheme","license":"","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Simon C. Benjamin","submitted_at":"2005-04-14T23:23:10Z","abstract_excerpt":"Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes com"},"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/0504111","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T23:23:10Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"d175a717351edd8c1459018933ccadcdfa5020506c645667b9d36385d80fc1e6","abstract_canon_sha256":"96b5726cdc47efe0a8692922f219dba5268616c8031cbfe2302ea5de30ec0b9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:57.866874Z","signature_b64":"zBd4HADr/7+dj3pAx+TR72tpY1zi8yIUlX50J1IF6jo9oK4FJfqIj0ZH5AOpqTIEDaNfVzi8RdCeVnk3OI/CAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ba042c130afb5037aac722e3202413f03d66b301cad7776e5a819412cb46adf","last_reissued_at":"2026-05-18T01:37:57.866289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:57.866289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Graph State Construction Under the Barrett and Kok Scheme","license":"","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Simon C. Benjamin","submitted_at":"2005-04-14T23:23:10Z","abstract_excerpt":"Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504111","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":""},"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/0504111","created_at":"2026-05-18T01:37:57.866399+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504111v2","created_at":"2026-05-18T01:37:57.866399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504111","created_at":"2026-05-18T01:37:57.866399+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOQEFQJQV62Q","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOQEFQJQV62QG6VM","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOQEFQJQ","created_at":"2026-05-18T12:25:53.335082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4","json":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4.json","graph_json":"https://pith.science/api/pith-number/NOQEFQJQV62QG6VMOIXDEASBH4/graph.json","events_json":"https://pith.science/api/pith-number/NOQEFQJQV62QG6VMOIXDEASBH4/events.json","paper":"https://pith.science/paper/NOQEFQJQ"},"agent_actions":{"view_html":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4","download_json":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4.json","view_paper":"https://pith.science/paper/NOQEFQJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0504111&json=true","fetch_graph":"https://pith.science/api/pith-number/NOQEFQJQV62QG6VMOIXDEASBH4/graph.json","fetch_events":"https://pith.science/api/pith-number/NOQEFQJQV62QG6VMOIXDEASBH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/action/storage_attestation","attest_author":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/action/author_attestation","sign_citation":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/action/citation_signature","submit_replication":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/action/replication_record"}},"created_at":"2026-05-18T01:37:57.866399+00:00","updated_at":"2026-05-18T01:37:57.866399+00:00"}