{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PK5QRSOAI3R2U4LIKDGEZ2UUEW","short_pith_number":"pith:PK5QRSOA","schema_version":"1.0","canonical_sha256":"7abb08c9c046e3aa716850cc4cea94259f8607b7874695db3e46362656a980c3","source":{"kind":"arxiv","id":"1906.10375","version":1},"attestation_state":"computed","paper":{"title":"Quantum speedup of branch-and-bound algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Ashley Montanaro","submitted_at":"2019-06-25T08:27:50Z","abstract_excerpt":"Branch-and-bound is a widely used technique for solving combinatorial optimisation problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower bound on the cost of any solution in a given subset. Here we describe a quantum algorithm that can accelerate classical branch-and-bound algorithms near-quadratically in a very general setting. We show that the quantum algorithm can find exact ground states for most instances of the Sherrington-Kirkpatrick model in time $O(2^{0.226n})$, which i"},"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":"1906.10375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-25T08:27:50Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"96f667c76a2ab54b6c10cba4ecbc6fefc1cd0fd4ea6cc9b63bce515f9ef677a5","abstract_canon_sha256":"77e597a2234c0a32e7d69dcef266698a678cc650b8993ffbe5896bfbddf3a95e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:34:40.908580Z","signature_b64":"4zKu9eg/SBofVkfJJ9pjUO9A3zrfqpYAcQ0BxjkbCE8+oh/KgSsNZaZ8zgkpypUZXG51QxxAuAP+m34Uc3T9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7abb08c9c046e3aa716850cc4cea94259f8607b7874695db3e46362656a980c3","last_reissued_at":"2026-07-05T00:34:40.908129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:34:40.908129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum speedup of branch-and-bound algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Ashley Montanaro","submitted_at":"2019-06-25T08:27:50Z","abstract_excerpt":"Branch-and-bound is a widely used technique for solving combinatorial optimisation problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower bound on the cost of any solution in a given subset. Here we describe a quantum algorithm that can accelerate classical branch-and-bound algorithms near-quadratically in a very general setting. We show that the quantum algorithm can find exact ground states for most instances of the Sherrington-Kirkpatrick model in time $O(2^{0.226n})$, which i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10375","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/1906.10375/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":"1906.10375","created_at":"2026-07-05T00:34:40.908190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10375v1","created_at":"2026-07-05T00:34:40.908190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10375","created_at":"2026-07-05T00:34:40.908190+00:00"},{"alias_kind":"pith_short_12","alias_value":"PK5QRSOAI3R2","created_at":"2026-07-05T00:34:40.908190+00:00"},{"alias_kind":"pith_short_16","alias_value":"PK5QRSOAI3R2U4LI","created_at":"2026-07-05T00:34:40.908190+00:00"},{"alias_kind":"pith_short_8","alias_value":"PK5QRSOA","created_at":"2026-07-05T00:34:40.908190+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11291","citing_title":"Practical implementation of a quantum backtracking algorithm","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW","json":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW.json","graph_json":"https://pith.science/api/pith-number/PK5QRSOAI3R2U4LIKDGEZ2UUEW/graph.json","events_json":"https://pith.science/api/pith-number/PK5QRSOAI3R2U4LIKDGEZ2UUEW/events.json","paper":"https://pith.science/paper/PK5QRSOA"},"agent_actions":{"view_html":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW","download_json":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW.json","view_paper":"https://pith.science/paper/PK5QRSOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10375&json=true","fetch_graph":"https://pith.science/api/pith-number/PK5QRSOAI3R2U4LIKDGEZ2UUEW/graph.json","fetch_events":"https://pith.science/api/pith-number/PK5QRSOAI3R2U4LIKDGEZ2UUEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW/action/storage_attestation","attest_author":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW/action/author_attestation","sign_citation":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW/action/citation_signature","submit_replication":"https://pith.science/pith/PK5QRSOAI3R2U4LIKDGEZ2UUEW/action/replication_record"}},"created_at":"2026-07-05T00:34:40.908190+00:00","updated_at":"2026-07-05T00:34:40.908190+00:00"}