{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7OQ7ICEMW3OVKRVOOHITBZBFXP","short_pith_number":"pith:7OQ7ICEM","schema_version":"1.0","canonical_sha256":"fba1f4088cb6dd5546ae71d130e425bbd091e7e0a915eeb39a73bb0cb7d60971","source":{"kind":"arxiv","id":"2410.03902","version":1},"attestation_state":"computed","paper":{"title":"Quantum optimization with globally driven neutral atom arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Clemens Dlaska, Kilian Ender, Martin Lanthaler, Wolfgang Lechner","submitted_at":"2024-10-04T20:09:10Z","abstract_excerpt":"We propose a scalable encoding of combinatorial optimization problems with arbitrary connectivity, including higher-order terms, on arrays of trapped neutral atoms requiring only a global laser drive. Our approach relies on modular arrangements of a small number of problem-independent gadgets. These gadgets represent maximum-weight independent set (MWIS) problems on unit-disk graphs, which are native to such devices. Instead of programming MWIS weights with site-dependent laser detunings, the scheme relies on systematic placements of auxiliary atoms. We show, that these auxiliary atoms can be "},"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":"2410.03902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-04T20:09:10Z","cross_cats_sorted":[],"title_canon_sha256":"da6d9ed5437bf81dc7ba6f2ffc9d2ef23e345d524587724292a6ee6b442c0bdf","abstract_canon_sha256":"ec058d91e05ebfdfd9d1d9f85efe7a2c430ebde5ccfbff3e88579270a6180c77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:16:26.144806Z","signature_b64":"OP1LfLFeEn1nem6y/AfewQInqhHKm5Kix2EBA3DnhTxwefNNA7zei1jlRaf1XsUFgavi75gs8QjO2dJzq5tODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba1f4088cb6dd5546ae71d130e425bbd091e7e0a915eeb39a73bb0cb7d60971","last_reissued_at":"2026-07-05T09:16:26.144338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:16:26.144338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum optimization with globally driven neutral atom arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Clemens Dlaska, Kilian Ender, Martin Lanthaler, Wolfgang Lechner","submitted_at":"2024-10-04T20:09:10Z","abstract_excerpt":"We propose a scalable encoding of combinatorial optimization problems with arbitrary connectivity, including higher-order terms, on arrays of trapped neutral atoms requiring only a global laser drive. Our approach relies on modular arrangements of a small number of problem-independent gadgets. These gadgets represent maximum-weight independent set (MWIS) problems on unit-disk graphs, which are native to such devices. Instead of programming MWIS weights with site-dependent laser detunings, the scheme relies on systematic placements of auxiliary atoms. We show, that these auxiliary atoms can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03902","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.03902/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":"2410.03902","created_at":"2026-07-05T09:16:26.144396+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03902v1","created_at":"2026-07-05T09:16:26.144396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03902","created_at":"2026-07-05T09:16:26.144396+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OQ7ICEMW3OV","created_at":"2026-07-05T09:16:26.144396+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OQ7ICEMW3OVKRVO","created_at":"2026-07-05T09:16:26.144396+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OQ7ICEM","created_at":"2026-07-05T09:16:26.144396+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2503.17115","citing_title":"A quantum wire approach to weighted combinatorial graph optimisation problems","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07952","citing_title":"Reducibility of native weighted graphs on Rydberg Arrays","ref_index":66,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03579","citing_title":"Quantum Spin Liquid State of a Dual-Species Atomic Array on Kagome Lattice","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP","json":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP.json","graph_json":"https://pith.science/api/pith-number/7OQ7ICEMW3OVKRVOOHITBZBFXP/graph.json","events_json":"https://pith.science/api/pith-number/7OQ7ICEMW3OVKRVOOHITBZBFXP/events.json","paper":"https://pith.science/paper/7OQ7ICEM"},"agent_actions":{"view_html":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP","download_json":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP.json","view_paper":"https://pith.science/paper/7OQ7ICEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03902&json=true","fetch_graph":"https://pith.science/api/pith-number/7OQ7ICEMW3OVKRVOOHITBZBFXP/graph.json","fetch_events":"https://pith.science/api/pith-number/7OQ7ICEMW3OVKRVOOHITBZBFXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP/action/storage_attestation","attest_author":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP/action/author_attestation","sign_citation":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP/action/citation_signature","submit_replication":"https://pith.science/pith/7OQ7ICEMW3OVKRVOOHITBZBFXP/action/replication_record"}},"created_at":"2026-07-05T09:16:26.144396+00:00","updated_at":"2026-07-05T09:16:26.144396+00:00"}