{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XPIGC3ZILZGC3Q4KH27HW22WIS","short_pith_number":"pith:XPIGC3ZI","schema_version":"1.0","canonical_sha256":"bbd0616f285e4c2dc38a3ebe7b6b5644866ff34cd0b651c70339121a2f8c0eaf","source":{"kind":"arxiv","id":"2504.15367","version":1},"attestation_state":"computed","paper":{"title":"Branch-and-bound digitized counterdiabatic quantum optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alejandro Gomez Cadavid, Anton Simen, Enrique Solano, Narendra N. Hegade, Sebasti\\'an V. Romero","submitted_at":"2025-04-21T18:19:19Z","abstract_excerpt":"Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order formulations pose challenges due to their inherent non-convexity. In this work, we propose branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO), a quantum algorithm that addresses the relaxation difficulties in higher-order unconstrained binary optimization (HUBO) problems. By employing bias fields as approximate solutions to the relaxed"},"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":"2504.15367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T18:19:19Z","cross_cats_sorted":[],"title_canon_sha256":"9ad12239baaeff891120a4c14f1d27ca1e7c0d9afb48e001cd59780c678a088b","abstract_canon_sha256":"02aa0370ca4052dcbeebe1f53e53c9dd5a543dd453c09f783a416f60646fa973"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:01.576962Z","signature_b64":"ZC1Wsau0KgueDUQGDvpVfErDLY5Gfsoibl4n7NoJZnW8f6yP9CbMSiDjfxF/FsK0AUVVnwAZKqLKzydRMSqcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd0616f285e4c2dc38a3ebe7b6b5644866ff34cd0b651c70339121a2f8c0eaf","last_reissued_at":"2026-07-05T10:52:01.576478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:01.576478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Branch-and-bound digitized counterdiabatic quantum optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alejandro Gomez Cadavid, Anton Simen, Enrique Solano, Narendra N. Hegade, Sebasti\\'an V. Romero","submitted_at":"2025-04-21T18:19:19Z","abstract_excerpt":"Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order formulations pose challenges due to their inherent non-convexity. In this work, we propose branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO), a quantum algorithm that addresses the relaxation difficulties in higher-order unconstrained binary optimization (HUBO) problems. By employing bias fields as approximate solutions to the relaxed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15367","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/2504.15367/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":"2504.15367","created_at":"2026-07-05T10:52:01.576539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15367v1","created_at":"2026-07-05T10:52:01.576539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15367","created_at":"2026-07-05T10:52:01.576539+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPIGC3ZILZGC","created_at":"2026-07-05T10:52:01.576539+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPIGC3ZILZGC3Q4K","created_at":"2026-07-05T10:52:01.576539+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPIGC3ZI","created_at":"2026-07-05T10:52:01.576539+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07159","citing_title":"Large-scale portfolio optimization with variational neural annealing","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS","json":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS.json","graph_json":"https://pith.science/api/pith-number/XPIGC3ZILZGC3Q4KH27HW22WIS/graph.json","events_json":"https://pith.science/api/pith-number/XPIGC3ZILZGC3Q4KH27HW22WIS/events.json","paper":"https://pith.science/paper/XPIGC3ZI"},"agent_actions":{"view_html":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS","download_json":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS.json","view_paper":"https://pith.science/paper/XPIGC3ZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15367&json=true","fetch_graph":"https://pith.science/api/pith-number/XPIGC3ZILZGC3Q4KH27HW22WIS/graph.json","fetch_events":"https://pith.science/api/pith-number/XPIGC3ZILZGC3Q4KH27HW22WIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/action/storage_attestation","attest_author":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/action/author_attestation","sign_citation":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/action/citation_signature","submit_replication":"https://pith.science/pith/XPIGC3ZILZGC3Q4KH27HW22WIS/action/replication_record"}},"created_at":"2026-07-05T10:52:01.576539+00:00","updated_at":"2026-07-05T10:52:01.576539+00:00"}