{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CNDOOHKVGX6LAHZ24ENWNHIFRH","short_pith_number":"pith:CNDOOHKV","schema_version":"1.0","canonical_sha256":"1346e71d5535fcb01f3ae11b669d0589ca05ff24938a56388e5494d80995ac10","source":{"kind":"arxiv","id":"2505.08663","version":1},"attestation_state":"computed","paper":{"title":"Runtime Quantum Advantage with Digital Quantum 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, Anton Simen, Enrique Solano, Narendra N. Hegade, Pranav Chandarana, Sebasti\\'an V. Romero","submitted_at":"2025-05-13T15:24:17Z","abstract_excerpt":"We demonstrate experimentally that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm on IBM's 156-qubit devices can outperform simulated annealing (SA) and CPLEX in time-to-approximate solutions for specific higher-order unconstrained binary optimization (HUBO) problems. We suitably select problem instances that are challenging for classical methods, running in fractions of minutes even with multicore processors. On the other hand, our counterdiabatic quantum algorithms obtain similar or better results in at most a few seconds on quantum hardware, achieving runt"},"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":"2505.08663","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-13T15:24:17Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"a2c2d56041d39942c40776ca1a08b8f7649d93ecf922206206d8e6cc4e13cedf","abstract_canon_sha256":"88939c01a5a0fabbca52b784d33691922657d7682229b851b37db67e72fb07d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:34.444345Z","signature_b64":"Vr5UgQvT4HRdeIIR0sZcvTkVEkNh3M3urpwSma9NxWBYylj3GJZgLkQLdMK1bdGWDz8Ni4+nYyARXLvWquVNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1346e71d5535fcb01f3ae11b669d0589ca05ff24938a56388e5494d80995ac10","last_reissued_at":"2026-07-05T11:02:34.443784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:34.443784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Runtime Quantum Advantage with Digital Quantum 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, Anton Simen, Enrique Solano, Narendra N. Hegade, Pranav Chandarana, Sebasti\\'an V. Romero","submitted_at":"2025-05-13T15:24:17Z","abstract_excerpt":"We demonstrate experimentally that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm on IBM's 156-qubit devices can outperform simulated annealing (SA) and CPLEX in time-to-approximate solutions for specific higher-order unconstrained binary optimization (HUBO) problems. We suitably select problem instances that are challenging for classical methods, running in fractions of minutes even with multicore processors. On the other hand, our counterdiabatic quantum algorithms obtain similar or better results in at most a few seconds on quantum hardware, achieving runt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08663","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/2505.08663/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":"2505.08663","created_at":"2026-07-05T11:02:34.443850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08663v1","created_at":"2026-07-05T11:02:34.443850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08663","created_at":"2026-07-05T11:02:34.443850+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNDOOHKVGX6L","created_at":"2026-07-05T11:02:34.443850+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNDOOHKVGX6LAHZ2","created_at":"2026-07-05T11:02:34.443850+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNDOOHKV","created_at":"2026-07-05T11:02:34.443850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30252","citing_title":"Quantum optimization beyond QUBO for industrial logistics and scheduling","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2510.06337","citing_title":"Recent quantum runtime (dis)advantages","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01050","citing_title":"Simulated Bifurcation Quantum Annealing","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02617","citing_title":"AutoVerifier: An Agentic Automated Verification Framework Using Large Language Models","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH","json":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH.json","graph_json":"https://pith.science/api/pith-number/CNDOOHKVGX6LAHZ24ENWNHIFRH/graph.json","events_json":"https://pith.science/api/pith-number/CNDOOHKVGX6LAHZ24ENWNHIFRH/events.json","paper":"https://pith.science/paper/CNDOOHKV"},"agent_actions":{"view_html":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH","download_json":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH.json","view_paper":"https://pith.science/paper/CNDOOHKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08663&json=true","fetch_graph":"https://pith.science/api/pith-number/CNDOOHKVGX6LAHZ24ENWNHIFRH/graph.json","fetch_events":"https://pith.science/api/pith-number/CNDOOHKVGX6LAHZ24ENWNHIFRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH/action/storage_attestation","attest_author":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH/action/author_attestation","sign_citation":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH/action/citation_signature","submit_replication":"https://pith.science/pith/CNDOOHKVGX6LAHZ24ENWNHIFRH/action/replication_record"}},"created_at":"2026-07-05T11:02:34.443850+00:00","updated_at":"2026-07-05T11:02:34.443850+00:00"}