{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XACZLMHIASCR5Y7EOLSBTRAJMC","short_pith_number":"pith:XACZLMHI","schema_version":"1.0","canonical_sha256":"b80595b0e804851ee3e472e419c40960a7c070a9ec974aa7b9afc9136857bf57","source":{"kind":"arxiv","id":"2502.02245","version":1},"attestation_state":"computed","paper":{"title":"Qubit-efficient quantum local search for combinatorial optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. Podobrii, M. R. Perelshtein, M. Veshchezerova, V. Kuzmin, V. Voloshinov","submitted_at":"2025-02-04T11:44:34Z","abstract_excerpt":"An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches for a better solution within a chosen set of immediate neighbors. The size $l$ of this set is limited due to the computational costs required to run the method on classical processing units. We present a qubit-efficient variational quantum algorithm that implements a quantum version of local search with only $\\lceil \\log_2 l \\rceil$ qubits and, therefore, can potentially work with classically intractable neighborhood s"},"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":"2502.02245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-04T11:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"ca92e702c0e645b4398a54999fa74794e4362073cb05f46dbf0b23bacb2097fe","abstract_canon_sha256":"32a304b63a1b9cb94d9f570eb4a292fb805d50c0eacb5736dc51a39601645474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:25.942162Z","signature_b64":"tlx5bYPt6zmGMEa+S0vitco9ZbDeh4LEQo28SqRYEXhOwbAU1ORe8ZVF4eGR57ZxOijBpRSzR2/uGu8zMVUKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b80595b0e804851ee3e472e419c40960a7c070a9ec974aa7b9afc9136857bf57","last_reissued_at":"2026-07-05T10:09:25.941776Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:25.941776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qubit-efficient quantum local search for combinatorial optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"M. Podobrii, M. R. Perelshtein, M. Veshchezerova, V. Kuzmin, V. Voloshinov","submitted_at":"2025-02-04T11:44:34Z","abstract_excerpt":"An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches for a better solution within a chosen set of immediate neighbors. The size $l$ of this set is limited due to the computational costs required to run the method on classical processing units. We present a qubit-efficient variational quantum algorithm that implements a quantum version of local search with only $\\lceil \\log_2 l \\rceil$ qubits and, therefore, can potentially work with classically intractable neighborhood s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02245","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/2502.02245/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":"2502.02245","created_at":"2026-07-05T10:09:25.941832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02245v1","created_at":"2026-07-05T10:09:25.941832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02245","created_at":"2026-07-05T10:09:25.941832+00:00"},{"alias_kind":"pith_short_12","alias_value":"XACZLMHIASCR","created_at":"2026-07-05T10:09:25.941832+00:00"},{"alias_kind":"pith_short_16","alias_value":"XACZLMHIASCR5Y7E","created_at":"2026-07-05T10:09:25.941832+00:00"},{"alias_kind":"pith_short_8","alias_value":"XACZLMHI","created_at":"2026-07-05T10:09:25.941832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18285","citing_title":"EQE-QAOA: An Equivalence-Preserving Qubit Efficient Framework for Combinatorial Optimization","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC","json":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC.json","graph_json":"https://pith.science/api/pith-number/XACZLMHIASCR5Y7EOLSBTRAJMC/graph.json","events_json":"https://pith.science/api/pith-number/XACZLMHIASCR5Y7EOLSBTRAJMC/events.json","paper":"https://pith.science/paper/XACZLMHI"},"agent_actions":{"view_html":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC","download_json":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC.json","view_paper":"https://pith.science/paper/XACZLMHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02245&json=true","fetch_graph":"https://pith.science/api/pith-number/XACZLMHIASCR5Y7EOLSBTRAJMC/graph.json","fetch_events":"https://pith.science/api/pith-number/XACZLMHIASCR5Y7EOLSBTRAJMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/action/storage_attestation","attest_author":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/action/author_attestation","sign_citation":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/action/citation_signature","submit_replication":"https://pith.science/pith/XACZLMHIASCR5Y7EOLSBTRAJMC/action/replication_record"}},"created_at":"2026-07-05T10:09:25.941832+00:00","updated_at":"2026-07-05T10:09:25.941832+00:00"}