{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:S6DRJEHBVMFBPMM56CGM42BZZY","short_pith_number":"pith:S6DRJEHB","schema_version":"1.0","canonical_sha256":"97871490e1ab0a17b19df08cce6839ce28570fcd3828dfc2d93dbe920a93e7ae","source":{"kind":"arxiv","id":"2209.03965","version":2},"attestation_state":"computed","paper":{"title":"Quantum optimization with arbitrary connectivity using Rydberg atom arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.quant-gas","cs.CC","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Hannes Pichler, Jin-Guo Liu, Jonathan Wurtz, Mikhail D. Lukin, Minh-Thi Nguyen, Sheng-Tao Wang","submitted_at":"2022-09-08T18:00:00Z","abstract_excerpt":"Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum independent set problem on so-called unit-disk graphs, was shown to be efficiently encodable in such a quantum system. Here, we extend the classes of problems that can be efficiently encoded in Rydberg arrays by constructing explicit mappings from a wide class of problems to maximum weighted independent set problems on unit-disk graphs, with at most a quadra"},"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":"2209.03965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-09-08T18:00:00Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.quant-gas","cs.CC","physics.atom-ph"],"title_canon_sha256":"ae0d8ddf3f4426f71969f440619f2f9476a10dacfb4b57ba741c41e5f94db452","abstract_canon_sha256":"e46d850767de5a3588612783f8faee6cecd9b7562b19335025273996ea9fe94b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:46:51.825689Z","signature_b64":"FAReBsyfULHtQCng0C+fRaWmr33VfoCAB0hrjHMPlozsc+fmaQqavY3dsm1EQ2eD82vOxIASGA5G/28NjTnXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97871490e1ab0a17b19df08cce6839ce28570fcd3828dfc2d93dbe920a93e7ae","last_reissued_at":"2026-07-05T05:46:51.825229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:46:51.825229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum optimization with arbitrary connectivity using Rydberg atom arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.quant-gas","cs.CC","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Hannes Pichler, Jin-Guo Liu, Jonathan Wurtz, Mikhail D. Lukin, Minh-Thi Nguyen, Sheng-Tao Wang","submitted_at":"2022-09-08T18:00:00Z","abstract_excerpt":"Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum independent set problem on so-called unit-disk graphs, was shown to be efficiently encodable in such a quantum system. Here, we extend the classes of problems that can be efficiently encoded in Rydberg arrays by constructing explicit mappings from a wide class of problems to maximum weighted independent set problems on unit-disk graphs, with at most a quadra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.03965","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.03965/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":"2209.03965","created_at":"2026-07-05T05:46:51.825282+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.03965v2","created_at":"2026-07-05T05:46:51.825282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.03965","created_at":"2026-07-05T05:46:51.825282+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6DRJEHBVMFB","created_at":"2026-07-05T05:46:51.825282+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6DRJEHBVMFBPMM5","created_at":"2026-07-05T05:46:51.825282+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6DRJEHB","created_at":"2026-07-05T05:46:51.825282+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16656","citing_title":"Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY","json":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY.json","graph_json":"https://pith.science/api/pith-number/S6DRJEHBVMFBPMM56CGM42BZZY/graph.json","events_json":"https://pith.science/api/pith-number/S6DRJEHBVMFBPMM56CGM42BZZY/events.json","paper":"https://pith.science/paper/S6DRJEHB"},"agent_actions":{"view_html":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY","download_json":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY.json","view_paper":"https://pith.science/paper/S6DRJEHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.03965&json=true","fetch_graph":"https://pith.science/api/pith-number/S6DRJEHBVMFBPMM56CGM42BZZY/graph.json","fetch_events":"https://pith.science/api/pith-number/S6DRJEHBVMFBPMM56CGM42BZZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY/action/storage_attestation","attest_author":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY/action/author_attestation","sign_citation":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY/action/citation_signature","submit_replication":"https://pith.science/pith/S6DRJEHBVMFBPMM56CGM42BZZY/action/replication_record"}},"created_at":"2026-07-05T05:46:51.825282+00:00","updated_at":"2026-07-05T05:46:51.825282+00:00"}