{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N3SFMBRX7O3S42PQY4LPN3T42T","short_pith_number":"pith:N3SFMBRX","schema_version":"1.0","canonical_sha256":"6ee4560637fbb72e69f0c716f6ee7cd4e1a3c6f9f7947a5c6a4de0a538bd3870","source":{"kind":"arxiv","id":"2409.04477","version":2},"attestation_state":"computed","paper":{"title":"Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"Alejandro Gomez Cadavid, Anne-Maria Visuri, Anton Simen, Enrique Solano, Narendra N. Hegade, Sebasti\\'an V. Romero","submitted_at":"2024-09-05T17:38:59Z","abstract_excerpt":"Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO). We apply BF-DCQO to a HUBO problem featuring three-local terms in the Ising spin-glass model, validated experimentally using 156 qubits on an IBM quantum processor. In the studied instances, our results outperform standard "},"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":"2409.04477","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-05T17:38:59Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"8bd2ac7ae85ea7ec486d3fdf5b4e9471a153002797aa568db51b5d064e8c743e","abstract_canon_sha256":"a8dc8af7f6b714e3ca9ed9566d91466c9173f20bebf13bce99e30ea7832454f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:20.445194Z","signature_b64":"TxwuN0tSpbLNu/KDJqcDGhxgm9G3zPti4pEoGwArJ6YDtzq+AfKktSd4gotfo1nPfB60Vt/EVshxRWA99CWNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee4560637fbb72e69f0c716f6ee7cd4e1a3c6f9f7947a5c6a4de0a538bd3870","last_reissued_at":"2026-07-05T11:58:20.444752Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:20.444752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"Alejandro Gomez Cadavid, Anne-Maria Visuri, Anton Simen, Enrique Solano, Narendra N. Hegade, Sebasti\\'an V. Romero","submitted_at":"2024-09-05T17:38:59Z","abstract_excerpt":"Combinatorial optimization plays a crucial role in many industrial applications. While classical computing often struggles with complex instances, quantum optimization emerges as a promising alternative. Here, we present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO). We apply BF-DCQO to a HUBO problem featuring three-local terms in the Ising spin-glass model, validated experimentally using 156 qubits on an IBM quantum processor. In the studied instances, our results outperform standard "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04477","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/2409.04477/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":"2409.04477","created_at":"2026-07-05T11:58:20.444808+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04477v2","created_at":"2026-07-05T11:58:20.444808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04477","created_at":"2026-07-05T11:58:20.444808+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3SFMBRX7O3S","created_at":"2026-07-05T11:58:20.444808+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3SFMBRX7O3S42PQ","created_at":"2026-07-05T11:58:20.444808+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3SFMBRX","created_at":"2026-07-05T11:58:20.444808+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.19221","citing_title":"VeloxQ: A Fast and Efficient QUBO Solver","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2502.15375","citing_title":"Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2510.06337","citing_title":"Recent quantum runtime (dis)advantages","ref_index":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T","json":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T.json","graph_json":"https://pith.science/api/pith-number/N3SFMBRX7O3S42PQY4LPN3T42T/graph.json","events_json":"https://pith.science/api/pith-number/N3SFMBRX7O3S42PQY4LPN3T42T/events.json","paper":"https://pith.science/paper/N3SFMBRX"},"agent_actions":{"view_html":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T","download_json":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T.json","view_paper":"https://pith.science/paper/N3SFMBRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04477&json=true","fetch_graph":"https://pith.science/api/pith-number/N3SFMBRX7O3S42PQY4LPN3T42T/graph.json","fetch_events":"https://pith.science/api/pith-number/N3SFMBRX7O3S42PQY4LPN3T42T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T/action/storage_attestation","attest_author":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T/action/author_attestation","sign_citation":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T/action/citation_signature","submit_replication":"https://pith.science/pith/N3SFMBRX7O3S42PQY4LPN3T42T/action/replication_record"}},"created_at":"2026-07-05T11:58:20.444808+00:00","updated_at":"2026-07-05T11:58:20.444808+00:00"}