{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CKOFBIAUQMVYSSLKPHGKAZYSGM","short_pith_number":"pith:CKOFBIAU","schema_version":"1.0","canonical_sha256":"129c50a014832b89496a79cca06712332c8937f0c6cddebdf688f1ee06f23363","source":{"kind":"arxiv","id":"1612.06812","version":1},"attestation_state":"computed","paper":{"title":"Efficient quantum computation in a network with probabilistic gates and logical encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anders S. S{\\o}rensen, Ignacio Cirac, Johannes Borregaard, Mikhail D. Lukin","submitted_at":"2016-12-20T19:05:17Z","abstract_excerpt":"A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from linear optical quantum computation in order to perform high fidelity quantum gates across a quantum network. The error-detecting properties of the heralded operations ensure high fidelity while the encoding makes it possible to correct for failed attempts such that deterministic and high-quality gates can be achieved. Importantly, this is robust to photon los"},"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":"1612.06812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-12-20T19:05:17Z","cross_cats_sorted":[],"title_canon_sha256":"8dbe09ae03c03bee7d62f679cf7470eaf9d90a799265b2005f3e01607bfdfcab","abstract_canon_sha256":"b642111520b4427c80d20802bc0adf9991f14a06df100614feaaaae30147f74e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:13.403026Z","signature_b64":"Kh4ecdCE8DUu0itXO3l+7Oiy3Xu2VYJjTk6jELfXUmeXmwAU3JXgOuopqxRsp5zHhnLpGiEg6k8HzKkBo2oSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"129c50a014832b89496a79cca06712332c8937f0c6cddebdf688f1ee06f23363","last_reissued_at":"2026-05-18T00:46:13.402453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:13.402453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient quantum computation in a network with probabilistic gates and logical encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anders S. S{\\o}rensen, Ignacio Cirac, Johannes Borregaard, Mikhail D. Lukin","submitted_at":"2016-12-20T19:05:17Z","abstract_excerpt":"A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from linear optical quantum computation in order to perform high fidelity quantum gates across a quantum network. The error-detecting properties of the heralded operations ensure high fidelity while the encoding makes it possible to correct for failed attempts such that deterministic and high-quality gates can be achieved. Importantly, this is robust to photon los"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06812","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":"1612.06812","created_at":"2026-05-18T00:46:13.402554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06812v1","created_at":"2026-05-18T00:46:13.402554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06812","created_at":"2026-05-18T00:46:13.402554+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKOFBIAUQMVY","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKOFBIAUQMVYSSLK","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKOFBIAU","created_at":"2026-05-18T12:30:09.641336+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/CKOFBIAUQMVYSSLKPHGKAZYSGM","json":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM.json","graph_json":"https://pith.science/api/pith-number/CKOFBIAUQMVYSSLKPHGKAZYSGM/graph.json","events_json":"https://pith.science/api/pith-number/CKOFBIAUQMVYSSLKPHGKAZYSGM/events.json","paper":"https://pith.science/paper/CKOFBIAU"},"agent_actions":{"view_html":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM","download_json":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM.json","view_paper":"https://pith.science/paper/CKOFBIAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06812&json=true","fetch_graph":"https://pith.science/api/pith-number/CKOFBIAUQMVYSSLKPHGKAZYSGM/graph.json","fetch_events":"https://pith.science/api/pith-number/CKOFBIAUQMVYSSLKPHGKAZYSGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM/action/storage_attestation","attest_author":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM/action/author_attestation","sign_citation":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM/action/citation_signature","submit_replication":"https://pith.science/pith/CKOFBIAUQMVYSSLKPHGKAZYSGM/action/replication_record"}},"created_at":"2026-05-18T00:46:13.402554+00:00","updated_at":"2026-05-18T00:46:13.402554+00:00"}