{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L6AX32B2QHUHSRB7D6Z3EFUUBC","short_pith_number":"pith:L6AX32B2","schema_version":"1.0","canonical_sha256":"5f817de83a81e879443f1fb3b21694089a549eb7ffca3c5641b33433c0b8bb08","source":{"kind":"arxiv","id":"2406.19351","version":1},"attestation_state":"computed","paper":{"title":"A comment on comparing optimization on D-Wave and IBM quantum processors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew K. King, Catherine C. McGeoch, Kevin Chern, Pau Farr\\'e","submitted_at":"2024-06-27T17:30:16Z","abstract_excerpt":"Recent work [Sachdeva et al.] presented an iterative hybrid quantum variational optimization algorithm designed by Q-CTRL and executed on IBM gate-based quantum processing units (QPUs), claiming a significant performance advantage against a D-Wave quantum annealer. Here we point out major methodological problems with this comparison. Using a simple unoptimized workflow for quantum annealing, we show success probabilities multiple orders of magnitude higher than those reported by [Sachdeva et al.]. These results, which can be reproduced using open-source code and free trial access to a D-Wave q"},"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":"2406.19351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-27T17:30:16Z","cross_cats_sorted":[],"title_canon_sha256":"57be0243e288df05b0267989ef53da7cd096b9fdb806bee40c975d93390668a9","abstract_canon_sha256":"1b95c8e340ccca3b51b755ef2af03b655b525207b7d5dd3c7ae4a74957067fd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:33.474015Z","signature_b64":"SuE+9tJjvq59dG8rE39Sk2yUhdMhpqubr+AXsk5gD3iXSwG0DlRKFWQFIQmn6d/zYw5BF9nQk4aE4JPUfGlcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f817de83a81e879443f1fb3b21694089a549eb7ffca3c5641b33433c0b8bb08","last_reissued_at":"2026-07-05T08:37:33.473551Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:33.473551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A comment on comparing optimization on D-Wave and IBM quantum processors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew K. King, Catherine C. McGeoch, Kevin Chern, Pau Farr\\'e","submitted_at":"2024-06-27T17:30:16Z","abstract_excerpt":"Recent work [Sachdeva et al.] presented an iterative hybrid quantum variational optimization algorithm designed by Q-CTRL and executed on IBM gate-based quantum processing units (QPUs), claiming a significant performance advantage against a D-Wave quantum annealer. Here we point out major methodological problems with this comparison. Using a simple unoptimized workflow for quantum annealing, we show success probabilities multiple orders of magnitude higher than those reported by [Sachdeva et al.]. These results, which can be reproduced using open-source code and free trial access to a D-Wave q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19351","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/2406.19351/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":"2406.19351","created_at":"2026-07-05T08:37:33.473604+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19351v1","created_at":"2026-07-05T08:37:33.473604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19351","created_at":"2026-07-05T08:37:33.473604+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6AX32B2QHUH","created_at":"2026-07-05T08:37:33.473604+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6AX32B2QHUHSRB7","created_at":"2026-07-05T08:37:33.473604+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6AX32B2","created_at":"2026-07-05T08:37:33.473604+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.15572","citing_title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC","json":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC.json","graph_json":"https://pith.science/api/pith-number/L6AX32B2QHUHSRB7D6Z3EFUUBC/graph.json","events_json":"https://pith.science/api/pith-number/L6AX32B2QHUHSRB7D6Z3EFUUBC/events.json","paper":"https://pith.science/paper/L6AX32B2"},"agent_actions":{"view_html":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC","download_json":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC.json","view_paper":"https://pith.science/paper/L6AX32B2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19351&json=true","fetch_graph":"https://pith.science/api/pith-number/L6AX32B2QHUHSRB7D6Z3EFUUBC/graph.json","fetch_events":"https://pith.science/api/pith-number/L6AX32B2QHUHSRB7D6Z3EFUUBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC/action/storage_attestation","attest_author":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC/action/author_attestation","sign_citation":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC/action/citation_signature","submit_replication":"https://pith.science/pith/L6AX32B2QHUHSRB7D6Z3EFUUBC/action/replication_record"}},"created_at":"2026-07-05T08:37:33.473604+00:00","updated_at":"2026-07-05T08:37:33.473604+00:00"}