{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AVRSTQCCHWZU26FY6EITQM4WHH","short_pith_number":"pith:AVRSTQCC","schema_version":"1.0","canonical_sha256":"056329c0423db34d78b8f11138339639df200b011bf988d6c07b1b061bc6d45b","source":{"kind":"arxiv","id":"2405.13898","version":1},"attestation_state":"computed","paper":{"title":"Bias-field digitized counterdiabatic 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, Archismita Dalal, Enrique Solano, Narendra N. Hegade","submitted_at":"2024-05-22T18:11:42Z","abstract_excerpt":"We introduce a method for solving combinatorial optimization problems on digital quantum computers, where we incorporate auxiliary counterdiabatic (CD) terms into the adiabatic Hamiltonian, while integrating bias terms derived from an iterative digitized counterdiabatic quantum algorithm. We call this protocol bias-field digitized counterdiabatic quantum optimization (BF-DCQO). Designed to effectively tackle large-scale combinatorial optimization problems, BF-DCQO demonstrates resilience against the limitations posed by the restricted coherence times of current quantum processors and shows cle"},"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":"2405.13898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-22T18:11:42Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"02212109edfd584616ff0f6f5cdef9c411a47bbd17e27d7b971fa81e8604a5c0","abstract_canon_sha256":"21c059acabe331152bf4740cdb95dc0b8d53d6347b1d7d63e9e015a5974b3b44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:36.903548Z","signature_b64":"9kh3MuqgAAfcl+e7XpQ4KfeTFHxAC0f7G3GGU0NUuDCmGO3kJ1LsXlTL43q21zT7c5V4Pp0XRkrDghFmb0K6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"056329c0423db34d78b8f11138339639df200b011bf988d6c07b1b061bc6d45b","last_reissued_at":"2026-07-05T10:52:36.903012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:36.903012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bias-field digitized counterdiabatic 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, Archismita Dalal, Enrique Solano, Narendra N. Hegade","submitted_at":"2024-05-22T18:11:42Z","abstract_excerpt":"We introduce a method for solving combinatorial optimization problems on digital quantum computers, where we incorporate auxiliary counterdiabatic (CD) terms into the adiabatic Hamiltonian, while integrating bias terms derived from an iterative digitized counterdiabatic quantum algorithm. We call this protocol bias-field digitized counterdiabatic quantum optimization (BF-DCQO). Designed to effectively tackle large-scale combinatorial optimization problems, BF-DCQO demonstrates resilience against the limitations posed by the restricted coherence times of current quantum processors and shows cle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13898","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/2405.13898/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":"2405.13898","created_at":"2026-07-05T10:52:36.903076+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.13898v1","created_at":"2026-07-05T10:52:36.903076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13898","created_at":"2026-07-05T10:52:36.903076+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVRSTQCCHWZU","created_at":"2026-07-05T10:52:36.903076+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVRSTQCCHWZU26FY","created_at":"2026-07-05T10:52:36.903076+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVRSTQCC","created_at":"2026-07-05T10:52:36.903076+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.15375","citing_title":"Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH","json":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH.json","graph_json":"https://pith.science/api/pith-number/AVRSTQCCHWZU26FY6EITQM4WHH/graph.json","events_json":"https://pith.science/api/pith-number/AVRSTQCCHWZU26FY6EITQM4WHH/events.json","paper":"https://pith.science/paper/AVRSTQCC"},"agent_actions":{"view_html":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH","download_json":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH.json","view_paper":"https://pith.science/paper/AVRSTQCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.13898&json=true","fetch_graph":"https://pith.science/api/pith-number/AVRSTQCCHWZU26FY6EITQM4WHH/graph.json","fetch_events":"https://pith.science/api/pith-number/AVRSTQCCHWZU26FY6EITQM4WHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH/action/storage_attestation","attest_author":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH/action/author_attestation","sign_citation":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH/action/citation_signature","submit_replication":"https://pith.science/pith/AVRSTQCCHWZU26FY6EITQM4WHH/action/replication_record"}},"created_at":"2026-07-05T10:52:36.903076+00:00","updated_at":"2026-07-05T10:52:36.903076+00:00"}