{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RTYVJJUYMMYYOCGS2CS2GEZAAF","short_pith_number":"pith:RTYVJJUY","schema_version":"1.0","canonical_sha256":"8cf154a69863318708d2d0a5a31320015b72df50e1d97b493012b065bc3c347d","source":{"kind":"arxiv","id":"1310.6112","version":2},"attestation_state":"computed","paper":{"title":"Two-Qubit Gate Operation on Selected Nearest-Neighbor Neutral Atom Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.quant-gas"],"primary_cat":"quant-ph","authors_text":"Elham Hosseini Lapasar, Kenichi Kasamatsu, Mikio Nakahara, Sile Nic Chormaic, Takeji Takui, Tetsuo Ohmi, Yasushi Kondo","submitted_at":"2013-10-23T05:23:30Z","abstract_excerpt":"We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to demonstrate a selective two-qubit gate operation that is less demanding than our original proposal, although the gate operation is limited to act between two neighboring atoms. We evaluate numerically the process of a two-qubit gate operation that is applied to a selected pair of nearest-neighbor, trapped atoms and we estimate the upper bound of the gate operation "},"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":"1310.6112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-23T05:23:30Z","cross_cats_sorted":["cond-mat.quant-gas"],"title_canon_sha256":"c04ede98564c32203ca4ec22fabd2b2470168b7aa2262b28f5701a77a93a8be6","abstract_canon_sha256":"82335b29347d5a2174dc0c918a2e3641db2da61f2b0f1091f74696b4608c062e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:37.773178Z","signature_b64":"ohWKddJ9Oh9+OOrjJxiaIBYCSnj4uImvAAmS7h1ka0t0FuMhuEpHyyueUdb/oV7idONr3PxjFV7idl0/s+5AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cf154a69863318708d2d0a5a31320015b72df50e1d97b493012b065bc3c347d","last_reissued_at":"2026-05-18T02:54:37.772506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:37.772506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Qubit Gate Operation on Selected Nearest-Neighbor Neutral Atom Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.quant-gas"],"primary_cat":"quant-ph","authors_text":"Elham Hosseini Lapasar, Kenichi Kasamatsu, Mikio Nakahara, Sile Nic Chormaic, Takeji Takui, Tetsuo Ohmi, Yasushi Kondo","submitted_at":"2013-10-23T05:23:30Z","abstract_excerpt":"We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to demonstrate a selective two-qubit gate operation that is less demanding than our original proposal, although the gate operation is limited to act between two neighboring atoms. We evaluate numerically the process of a two-qubit gate operation that is applied to a selected pair of nearest-neighbor, trapped atoms and we estimate the upper bound of the gate operation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6112","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":"1310.6112","created_at":"2026-05-18T02:54:37.772609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6112v2","created_at":"2026-05-18T02:54:37.772609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6112","created_at":"2026-05-18T02:54:37.772609+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTYVJJUYMMYY","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTYVJJUYMMYYOCGS","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTYVJJUY","created_at":"2026-05-18T12:27:59.945178+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/RTYVJJUYMMYYOCGS2CS2GEZAAF","json":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF.json","graph_json":"https://pith.science/api/pith-number/RTYVJJUYMMYYOCGS2CS2GEZAAF/graph.json","events_json":"https://pith.science/api/pith-number/RTYVJJUYMMYYOCGS2CS2GEZAAF/events.json","paper":"https://pith.science/paper/RTYVJJUY"},"agent_actions":{"view_html":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF","download_json":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF.json","view_paper":"https://pith.science/paper/RTYVJJUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6112&json=true","fetch_graph":"https://pith.science/api/pith-number/RTYVJJUYMMYYOCGS2CS2GEZAAF/graph.json","fetch_events":"https://pith.science/api/pith-number/RTYVJJUYMMYYOCGS2CS2GEZAAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF/action/storage_attestation","attest_author":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF/action/author_attestation","sign_citation":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF/action/citation_signature","submit_replication":"https://pith.science/pith/RTYVJJUYMMYYOCGS2CS2GEZAAF/action/replication_record"}},"created_at":"2026-05-18T02:54:37.772609+00:00","updated_at":"2026-05-18T02:54:37.772609+00:00"}