{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:24NXHX6FYN5RDWZKO27LXSFFDM","short_pith_number":"pith:24NXHX6F","schema_version":"1.0","canonical_sha256":"d71b73dfc5c37b11db2a76bebbc8a51b370ea45ee46f06f9f2cf63d2d08918cd","source":{"kind":"arxiv","id":"1808.10816","version":1},"attestation_state":"computed","paper":{"title":"Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.quant-gas","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Hannes Pichler, Leo Zhou, Mikhail D. Lukin, Sheng-Tao Wang, Soonwon Choi","submitted_at":"2018-08-31T15:49:00Z","abstract_excerpt":"We describe and analyze an architecture for quantum optimization to solve maximum independent set (MIS) problems using neutral atom arrays trapped in optical tweezers. Optimizing independent sets is one of the paradigmatic, NP-hard problems in computer science. Our approach is based on coherent manipulation of atom arrays via the excitation into Rydberg atomic states. Specifically, we show that solutions of MIS problems can be efficiently encoded in the ground state of interacting atoms in 2D arrays by utilizing the Rydberg blockade mechanism. By studying the performance of leading classical a"},"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":"1808.10816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-08-31T15:49:00Z","cross_cats_sorted":["cond-mat.quant-gas","physics.atom-ph"],"title_canon_sha256":"058f2502f4e0e70916c82417ec5a1f1565d7eb787645fabe49c5969aa1bc94f0","abstract_canon_sha256":"143b86eacbecbb15f8d83d2fc72a53ad3382a99678e1340855a7fb851c34eb2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:44.517251Z","signature_b64":"pfTvvJCRywSvw2dx8isnrfgAiNpKcHmn2p5lpSn/gUatQdTcAV17bu5BBqzGQVvoVQTbaKMmBKAZQ7WbO+7jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d71b73dfc5c37b11db2a76bebbc8a51b370ea45ee46f06f9f2cf63d2d08918cd","last_reissued_at":"2026-05-18T00:06:44.516879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:44.516879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.quant-gas","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Hannes Pichler, Leo Zhou, Mikhail D. Lukin, Sheng-Tao Wang, Soonwon Choi","submitted_at":"2018-08-31T15:49:00Z","abstract_excerpt":"We describe and analyze an architecture for quantum optimization to solve maximum independent set (MIS) problems using neutral atom arrays trapped in optical tweezers. Optimizing independent sets is one of the paradigmatic, NP-hard problems in computer science. Our approach is based on coherent manipulation of atom arrays via the excitation into Rydberg atomic states. Specifically, we show that solutions of MIS problems can be efficiently encoded in the ground state of interacting atoms in 2D arrays by utilizing the Rydberg blockade mechanism. By studying the performance of leading classical a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10816","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":"1808.10816","created_at":"2026-05-18T00:06:44.516936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10816v1","created_at":"2026-05-18T00:06:44.516936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10816","created_at":"2026-05-18T00:06:44.516936+00:00"},{"alias_kind":"pith_short_12","alias_value":"24NXHX6FYN5R","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"24NXHX6FYN5RDWZK","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"24NXHX6F","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2503.17115","citing_title":"A quantum wire approach to weighted combinatorial graph optimisation problems","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14188","citing_title":"QOuLiPo: What a quantum computer sees when it reads a book","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27030","citing_title":"Efficient mapping of multi-constraint satisfaction problems to Rydberg platforms","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05297","citing_title":"Systematic construction of quantum many-body scars in frustrated Rydberg arrays","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11535","citing_title":"Problem Reductions at Scale: Agentic Integration of Computationally Hard Problems","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07952","citing_title":"Reducibility of native weighted graphs on Rydberg Arrays","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM","json":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM.json","graph_json":"https://pith.science/api/pith-number/24NXHX6FYN5RDWZKO27LXSFFDM/graph.json","events_json":"https://pith.science/api/pith-number/24NXHX6FYN5RDWZKO27LXSFFDM/events.json","paper":"https://pith.science/paper/24NXHX6F"},"agent_actions":{"view_html":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM","download_json":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM.json","view_paper":"https://pith.science/paper/24NXHX6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10816&json=true","fetch_graph":"https://pith.science/api/pith-number/24NXHX6FYN5RDWZKO27LXSFFDM/graph.json","fetch_events":"https://pith.science/api/pith-number/24NXHX6FYN5RDWZKO27LXSFFDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM/action/storage_attestation","attest_author":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM/action/author_attestation","sign_citation":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM/action/citation_signature","submit_replication":"https://pith.science/pith/24NXHX6FYN5RDWZKO27LXSFFDM/action/replication_record"}},"created_at":"2026-05-18T00:06:44.516936+00:00","updated_at":"2026-05-18T00:06:44.516936+00:00"}