{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FELNYKKHP3MH4UJESEFUMYBJAL","short_pith_number":"pith:FELNYKKH","schema_version":"1.0","canonical_sha256":"2916dc29477ed87e5124910b46602902dfc6378b15cd74d1839a898ba9446231","source":{"kind":"arxiv","id":"1603.05672","version":1},"attestation_state":"computed","paper":{"title":"Transport Implementation of the Bernstein-Vazirani Algorithm with Ion Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Brian McMahon, Creston Herold, Jason Amini, Kara Maller, Kenneth Brown, Spencer Fallek","submitted_at":"2016-03-17T20:19:02Z","abstract_excerpt":"Using trapped ion quantum bits in a scalable microfabricated surface trap, we perform the Bernstein-Vazirani algorithm. Our architecture relies upon ion transport and can readily be expanded to larger systems. The algorithm is demonstrated using two- and three-ion chains. For three ions, an improvement is achieved compared to a classical system using the same number of oracle queries. For two ions and one query, we correctly determine an unknown bit string with probability 97.6(8)%. For three ions, we succeed with probability 80.9(3)%."},"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":"1603.05672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-03-17T20:19:02Z","cross_cats_sorted":["physics.atom-ph"],"title_canon_sha256":"8c34cda49ddede35d2880d809e7a5b5417671ad7df45cfc22b73837c67dd42ac","abstract_canon_sha256":"149483e6d500310684af0ca009e24f1df68eeb1ac954a1af15ba66c3d63ae91e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:29.529483Z","signature_b64":"2W3RI6O5udvhsBNJFEQscc3wlyUXoV2ETV9cPits9hgR2nyZPKSFF/eTGgIsRYbUasFOWiMC5v91r6iHL7AEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2916dc29477ed87e5124910b46602902dfc6378b15cd74d1839a898ba9446231","last_reissued_at":"2026-05-18T01:09:29.529037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:29.529037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transport Implementation of the Bernstein-Vazirani Algorithm with Ion Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Brian McMahon, Creston Herold, Jason Amini, Kara Maller, Kenneth Brown, Spencer Fallek","submitted_at":"2016-03-17T20:19:02Z","abstract_excerpt":"Using trapped ion quantum bits in a scalable microfabricated surface trap, we perform the Bernstein-Vazirani algorithm. Our architecture relies upon ion transport and can readily be expanded to larger systems. The algorithm is demonstrated using two- and three-ion chains. For three ions, an improvement is achieved compared to a classical system using the same number of oracle queries. For two ions and one query, we correctly determine an unknown bit string with probability 97.6(8)%. For three ions, we succeed with probability 80.9(3)%."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05672","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":"1603.05672","created_at":"2026-05-18T01:09:29.529098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05672v1","created_at":"2026-05-18T01:09:29.529098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05672","created_at":"2026-05-18T01:09:29.529098+00:00"},{"alias_kind":"pith_short_12","alias_value":"FELNYKKHP3MH","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FELNYKKHP3MH4UJE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FELNYKKH","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11822","citing_title":"Fault-tolerant quantum computation with a neutral atom processor","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL","json":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL.json","graph_json":"https://pith.science/api/pith-number/FELNYKKHP3MH4UJESEFUMYBJAL/graph.json","events_json":"https://pith.science/api/pith-number/FELNYKKHP3MH4UJESEFUMYBJAL/events.json","paper":"https://pith.science/paper/FELNYKKH"},"agent_actions":{"view_html":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL","download_json":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL.json","view_paper":"https://pith.science/paper/FELNYKKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05672&json=true","fetch_graph":"https://pith.science/api/pith-number/FELNYKKHP3MH4UJESEFUMYBJAL/graph.json","fetch_events":"https://pith.science/api/pith-number/FELNYKKHP3MH4UJESEFUMYBJAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL/action/storage_attestation","attest_author":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL/action/author_attestation","sign_citation":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL/action/citation_signature","submit_replication":"https://pith.science/pith/FELNYKKHP3MH4UJESEFUMYBJAL/action/replication_record"}},"created_at":"2026-05-18T01:09:29.529098+00:00","updated_at":"2026-05-18T01:09:29.529098+00:00"}