{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:USVDJRRVAW3YN6SGND5ENIT4OO","short_pith_number":"pith:USVDJRRV","schema_version":"1.0","canonical_sha256":"a4aa34c63505b786fa4668fa46a27c7397dcb5e6a2da36d2e210665e4d9e5bc5","source":{"kind":"arxiv","id":"2404.14054","version":3},"attestation_state":"computed","paper":{"title":"Solving Combinatorial Optimization Problems with a Block Encoding Quantum Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adelina B\\\"arligea, Benedikt Poggel, Jeanette Miriam Lorenz","submitted_at":"2024-04-22T10:10:29Z","abstract_excerpt":"In the pursuit of achieving near-term quantum advantage for combinatorial optimization problems, the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) are the primary methods of interest, but their practical effectiveness remains uncertain. Therefore, there is a persistent need to develop and evaluate alternative variational quantum algorithms. This study presents an investigation of the Block ENcoding Quantum Optimizer (BENQO), a hybrid quantum solver that uses block encoding to represent the cost function. BENQO is designed to be universally appl"},"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":"2404.14054","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-22T10:10:29Z","cross_cats_sorted":[],"title_canon_sha256":"f556908237a00d53c504d0ab7926de0cd7bb82abf27bb366aaa8405b001718c7","abstract_canon_sha256":"e9d62d359e959de4daf9ae5c613eb3ac24a42dae2fa71ee9b2362cd291d3b40a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:24:21.464296Z","signature_b64":"ABOSk2ejznesc6CzhqfUTXnJ3bo5grESkxuLvq0TwaAWXwCxMJg4pcCqqjgJPUewXGi8pPNhU5OT60hLzIEhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4aa34c63505b786fa4668fa46a27c7397dcb5e6a2da36d2e210665e4d9e5bc5","last_reissued_at":"2026-07-05T10:24:21.463726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:24:21.463726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Combinatorial Optimization Problems with a Block Encoding Quantum Optimizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adelina B\\\"arligea, Benedikt Poggel, Jeanette Miriam Lorenz","submitted_at":"2024-04-22T10:10:29Z","abstract_excerpt":"In the pursuit of achieving near-term quantum advantage for combinatorial optimization problems, the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) are the primary methods of interest, but their practical effectiveness remains uncertain. Therefore, there is a persistent need to develop and evaluate alternative variational quantum algorithms. This study presents an investigation of the Block ENcoding Quantum Optimizer (BENQO), a hybrid quantum solver that uses block encoding to represent the cost function. BENQO is designed to be universally appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14054","kind":"arxiv","version":3},"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/2404.14054/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":"2404.14054","created_at":"2026-07-05T10:24:21.463792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14054v3","created_at":"2026-07-05T10:24:21.463792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14054","created_at":"2026-07-05T10:24:21.463792+00:00"},{"alias_kind":"pith_short_12","alias_value":"USVDJRRVAW3Y","created_at":"2026-07-05T10:24:21.463792+00:00"},{"alias_kind":"pith_short_16","alias_value":"USVDJRRVAW3YN6SG","created_at":"2026-07-05T10:24:21.463792+00:00"},{"alias_kind":"pith_short_8","alias_value":"USVDJRRV","created_at":"2026-07-05T10:24:21.463792+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05981","citing_title":"Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO","json":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO.json","graph_json":"https://pith.science/api/pith-number/USVDJRRVAW3YN6SGND5ENIT4OO/graph.json","events_json":"https://pith.science/api/pith-number/USVDJRRVAW3YN6SGND5ENIT4OO/events.json","paper":"https://pith.science/paper/USVDJRRV"},"agent_actions":{"view_html":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO","download_json":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO.json","view_paper":"https://pith.science/paper/USVDJRRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14054&json=true","fetch_graph":"https://pith.science/api/pith-number/USVDJRRVAW3YN6SGND5ENIT4OO/graph.json","fetch_events":"https://pith.science/api/pith-number/USVDJRRVAW3YN6SGND5ENIT4OO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO/action/storage_attestation","attest_author":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO/action/author_attestation","sign_citation":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO/action/citation_signature","submit_replication":"https://pith.science/pith/USVDJRRVAW3YN6SGND5ENIT4OO/action/replication_record"}},"created_at":"2026-07-05T10:24:21.463792+00:00","updated_at":"2026-07-05T10:24:21.463792+00:00"}