{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U3TPOGUDVVM54FEYBDRTIG4SNP","short_pith_number":"pith:U3TPOGUD","schema_version":"1.0","canonical_sha256":"a6e6f71a83ad59de149808e3341b926bd2eb6ca1df69d27639c3890f6bbaa4cd","source":{"kind":"arxiv","id":"1512.02206","version":4},"attestation_state":"computed","paper":{"title":"What is the Computational Value of Finite Range Tunneling?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hartmut Neven, John Martinis, Nan Ding, Ryan Babbush, Sergei V. Isakov, Sergio Boixo, Vadim Smelyanskiy, Vasil S. Denchev","submitted_at":"2015-12-07T20:47:38Z","abstract_excerpt":"Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite range tunneling can provide considerable computational advantage. For a crafted problem designed to have tall and narrow energy barriers separating local minima, the D-Wave 2X quantum annealer achieves significant runtime advantages relative to Simulated Annealing (SA). For instances with 945 variables, this results in a time-to-99%-success-probability that is $\\sim 10^8$ times faster than SA running on a single processor core. We also compared physical QA"},"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":"1512.02206","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-12-07T20:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"f229f37f39edb435334ce5642c4c18fd87d60e2fa4fbb0029cb3d4e42ce372ba","abstract_canon_sha256":"23fe52f79b16a97f9fcb8c5257212dd277b008ee83a57d5970b79c5a1954cc94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:36.293330Z","signature_b64":"09nD/3r6BmR1ByGLDMB536hFnAi0lcO1iQMzoPpGvCz+J/bgXdzBAglWCTKhaL0QSCWDSQjYvCwfB919QY4SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6e6f71a83ad59de149808e3341b926bd2eb6ca1df69d27639c3890f6bbaa4cd","last_reissued_at":"2026-05-18T01:09:36.292719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:36.292719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What is the Computational Value of Finite Range Tunneling?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hartmut Neven, John Martinis, Nan Ding, Ryan Babbush, Sergei V. Isakov, Sergio Boixo, Vadim Smelyanskiy, Vasil S. Denchev","submitted_at":"2015-12-07T20:47:38Z","abstract_excerpt":"Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite range tunneling can provide considerable computational advantage. For a crafted problem designed to have tall and narrow energy barriers separating local minima, the D-Wave 2X quantum annealer achieves significant runtime advantages relative to Simulated Annealing (SA). For instances with 945 variables, this results in a time-to-99%-success-probability that is $\\sim 10^8$ times faster than SA running on a single processor core. We also compared physical QA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02206","kind":"arxiv","version":4},"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":"1512.02206","created_at":"2026-05-18T01:09:36.292798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02206v4","created_at":"2026-05-18T01:09:36.292798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02206","created_at":"2026-05-18T01:09:36.292798+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/U3TPOGUDVVM54FEYBDRTIG4SNP","json":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP.json","graph_json":"https://pith.science/api/pith-number/U3TPOGUDVVM54FEYBDRTIG4SNP/graph.json","events_json":"https://pith.science/api/pith-number/U3TPOGUDVVM54FEYBDRTIG4SNP/events.json","paper":"https://pith.science/paper/U3TPOGUD"},"agent_actions":{"view_html":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP","download_json":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP.json","view_paper":"https://pith.science/paper/U3TPOGUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02206&json=true","fetch_graph":"https://pith.science/api/pith-number/U3TPOGUDVVM54FEYBDRTIG4SNP/graph.json","fetch_events":"https://pith.science/api/pith-number/U3TPOGUDVVM54FEYBDRTIG4SNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP/action/storage_attestation","attest_author":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP/action/author_attestation","sign_citation":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP/action/citation_signature","submit_replication":"https://pith.science/pith/U3TPOGUDVVM54FEYBDRTIG4SNP/action/replication_record"}},"created_at":"2026-05-18T01:09:36.292798+00:00","updated_at":"2026-05-18T01:09:36.292798+00:00"}