{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZGH6QZRSCDODI3YQQRMSIJVAJG","short_pith_number":"pith:ZGH6QZRS","schema_version":"1.0","canonical_sha256":"c98fe8663210dc346f1084592426a049a0c58777cbe3caf5c58b48842bc73beb","source":{"kind":"arxiv","id":"2008.07456","version":1},"attestation_state":"computed","paper":{"title":"Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Lauren Pusey-Nazzaro, Prasanna Date","submitted_at":"2020-08-17T16:29:34Z","abstract_excerpt":"In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business, finance, etc. We attempt to solve a number of small knapsack problems whose optimal solutions are known; we find that adiabatic quantum optimization fails to produce solutions corresponding to optimal filling of the knapsack in all problem instances. We compare results obtained on the quantum hardware to the classical simulated annealing algorithm and two s"},"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":"2008.07456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-17T16:29:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"37fe7fd027d73120ee6b8a3d07e628e1c440a8d0cece8c99f39b7c67a3cd0996","abstract_canon_sha256":"f13c4641237a36609a9ee4ffbabbbb87751e7289f16906538bc8d0b4d5724a2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:40.012193Z","signature_b64":"ON8FawVHB9dyiDuwljZbaUz9L4gFeS8ceVVt3yKwwdgfVsJeb22xzl1v0O+27gBSaFdv6EOJpO6pI/qQhINmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98fe8663210dc346f1084592426a049a0c58777cbe3caf5c58b48842bc73beb","last_reissued_at":"2026-07-05T01:27:40.011822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:40.011822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"quant-ph","authors_text":"Lauren Pusey-Nazzaro, Prasanna Date","submitted_at":"2020-08-17T16:29:34Z","abstract_excerpt":"In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business, finance, etc. We attempt to solve a number of small knapsack problems whose optimal solutions are known; we find that adiabatic quantum optimization fails to produce solutions corresponding to optimal filling of the knapsack in all problem instances. We compare results obtained on the quantum hardware to the classical simulated annealing algorithm and two s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07456","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/2008.07456/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":"2008.07456","created_at":"2026-07-05T01:27:40.011883+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.07456v1","created_at":"2026-07-05T01:27:40.011883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07456","created_at":"2026-07-05T01:27:40.011883+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGH6QZRSCDOD","created_at":"2026-07-05T01:27:40.011883+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGH6QZRSCDODI3YQ","created_at":"2026-07-05T01:27:40.011883+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGH6QZRS","created_at":"2026-07-05T01:27:40.011883+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15865","citing_title":"Transfer of Knowledge through Reverse Annealing: A Preliminary Analysis of the Benefits and What to Share","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG","json":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG.json","graph_json":"https://pith.science/api/pith-number/ZGH6QZRSCDODI3YQQRMSIJVAJG/graph.json","events_json":"https://pith.science/api/pith-number/ZGH6QZRSCDODI3YQQRMSIJVAJG/events.json","paper":"https://pith.science/paper/ZGH6QZRS"},"agent_actions":{"view_html":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG","download_json":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG.json","view_paper":"https://pith.science/paper/ZGH6QZRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.07456&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGH6QZRSCDODI3YQQRMSIJVAJG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGH6QZRSCDODI3YQQRMSIJVAJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG/action/storage_attestation","attest_author":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG/action/author_attestation","sign_citation":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG/action/citation_signature","submit_replication":"https://pith.science/pith/ZGH6QZRSCDODI3YQQRMSIJVAJG/action/replication_record"}},"created_at":"2026-07-05T01:27:40.011883+00:00","updated_at":"2026-07-05T01:27:40.011883+00:00"}