{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QEWMGCKOD3B767HPZGKYOLUFS3","short_pith_number":"pith:QEWMGCKO","schema_version":"1.0","canonical_sha256":"812cc3094e1ec3ff7cefc995872e8596dc293592d5fe9289b3969bb3c9734313","source":{"kind":"arxiv","id":"1711.01368","version":2},"attestation_state":"computed","paper":{"title":"A deceptive step towards quantum speedup detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Helmut G. Katzgraber, Salvatore Mandr\\`a","submitted_at":"2017-11-04T00:17:54Z","abstract_excerpt":"There have been multiple attempts to design synthetic benchmark problems with the goal of detecting quantum speedup in current quantum annealing machines. To date, classical heuristics have consistently outperformed quantum-annealing based approaches. Here we introduce a class of problems based on frustrated cluster loops - deceptive cluster loops - for which all currently known state-of-the-art classical heuristics are outperformed by the D-Wave 2000Q quantum annealing machine. While there is a sizable constant speedup over all known classical heuristics, a noticeable improvement in the scali"},"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":"1711.01368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-04T00:17:54Z","cross_cats_sorted":["cond-mat.dis-nn","physics.comp-ph"],"title_canon_sha256":"8ecb833abc410677549be0cc0a038b1ba9760d4d308406d4925ca2930845f7b6","abstract_canon_sha256":"23d7e11ef83343866c39126171115b4200b9ed0d74318ba67e297abb36d8add0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:50.308348Z","signature_b64":"27XDFw4VucPF2rnnRldDAsY0G6ktWslX6qDmq7221lWhZCghfPJnmavYDP9w3rZkpamvQ7Z3YU1MN7JwrRSmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"812cc3094e1ec3ff7cefc995872e8596dc293592d5fe9289b3969bb3c9734313","last_reissued_at":"2026-05-18T00:11:50.307622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:50.307622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A deceptive step towards quantum speedup detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Helmut G. Katzgraber, Salvatore Mandr\\`a","submitted_at":"2017-11-04T00:17:54Z","abstract_excerpt":"There have been multiple attempts to design synthetic benchmark problems with the goal of detecting quantum speedup in current quantum annealing machines. To date, classical heuristics have consistently outperformed quantum-annealing based approaches. Here we introduce a class of problems based on frustrated cluster loops - deceptive cluster loops - for which all currently known state-of-the-art classical heuristics are outperformed by the D-Wave 2000Q quantum annealing machine. While there is a sizable constant speedup over all known classical heuristics, a noticeable improvement in the scali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01368","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":""},"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":"1711.01368","created_at":"2026-05-18T00:11:50.307749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01368v2","created_at":"2026-05-18T00:11:50.307749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01368","created_at":"2026-05-18T00:11:50.307749+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEWMGCKOD3B7","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEWMGCKOD3B767HP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEWMGCKO","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3","json":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3.json","graph_json":"https://pith.science/api/pith-number/QEWMGCKOD3B767HPZGKYOLUFS3/graph.json","events_json":"https://pith.science/api/pith-number/QEWMGCKOD3B767HPZGKYOLUFS3/events.json","paper":"https://pith.science/paper/QEWMGCKO"},"agent_actions":{"view_html":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3","download_json":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3.json","view_paper":"https://pith.science/paper/QEWMGCKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01368&json=true","fetch_graph":"https://pith.science/api/pith-number/QEWMGCKOD3B767HPZGKYOLUFS3/graph.json","fetch_events":"https://pith.science/api/pith-number/QEWMGCKOD3B767HPZGKYOLUFS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3/action/storage_attestation","attest_author":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3/action/author_attestation","sign_citation":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3/action/citation_signature","submit_replication":"https://pith.science/pith/QEWMGCKOD3B767HPZGKYOLUFS3/action/replication_record"}},"created_at":"2026-05-18T00:11:50.307749+00:00","updated_at":"2026-05-18T00:11:50.307749+00:00"}