{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:GGJSFQFDTSQI4ROEQ2TSLWKJUK","short_pith_number":"pith:GGJSFQFD","schema_version":"1.0","canonical_sha256":"319322c0a39ca08e45c486a725d949a2b10a13d8d8dea4a8e79804b0c18104f0","source":{"kind":"arxiv","id":"quant-ph/0212048","version":1},"attestation_state":"computed","paper":{"title":"The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rainer Schuler, V. Arvind","submitted_at":"2002-12-09T05:05:58Z","abstract_excerpt":"We first give an $\\O(2^{n/3})$ quantum algorithm for the 0-1 Knapsack problem with $n$ variables. More generally, for 0-1 Integer Linear Programs with $n$ variables and $d$ inequalities we give an $\\O(2^{n/3}n^d)$ quantum algorithm. For $d =o(n/\\log n)$ this running time is bounded by $\\O(2^{n(1/3+\\epsilon)})$ for every $\\epsilon>0$ and in particular it is better than the $\\O(2^{n/2})$ upper bound for general quantum search. To investigate whether better algorithms for these NP-hard problems are possible, we formulate a \\emph{symmetric} claw problem corresponding to 0-1 Knapsack and study its "},"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":"quant-ph/0212048","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-12-09T05:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"250bed97caadaa26efecbe1a57ba3782a3b1e8589180ed59c931c10fde7986f8","abstract_canon_sha256":"5b3b7d41cff1ee1275b4261397520f6ee4d09a1d40d04012c5ad436d73a7baa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.216032Z","signature_b64":"a3E3nKEi4aPFXo97geVfYDrCp1+YxY3sEn7V+TW3VaTjoqockaVb17RpPBTQthKJTFtBVVNdMlMfjsbMC0HgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"319322c0a39ca08e45c486a725d949a2b10a13d8d8dea4a8e79804b0c18104f0","last_reissued_at":"2026-05-18T01:05:04.215351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.215351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rainer Schuler, V. Arvind","submitted_at":"2002-12-09T05:05:58Z","abstract_excerpt":"We first give an $\\O(2^{n/3})$ quantum algorithm for the 0-1 Knapsack problem with $n$ variables. More generally, for 0-1 Integer Linear Programs with $n$ variables and $d$ inequalities we give an $\\O(2^{n/3}n^d)$ quantum algorithm. For $d =o(n/\\log n)$ this running time is bounded by $\\O(2^{n(1/3+\\epsilon)})$ for every $\\epsilon>0$ and in particular it is better than the $\\O(2^{n/2})$ upper bound for general quantum search. To investigate whether better algorithms for these NP-hard problems are possible, we formulate a \\emph{symmetric} claw problem corresponding to 0-1 Knapsack and study its "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0212048","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":""},"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":"quant-ph/0212048","created_at":"2026-05-18T01:05:04.215462+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0212048v1","created_at":"2026-05-18T01:05:04.215462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0212048","created_at":"2026-05-18T01:05:04.215462+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGJSFQFDTSQI","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGJSFQFDTSQI4ROE","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGJSFQFD","created_at":"2026-05-18T12:25:50.845339+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/GGJSFQFDTSQI4ROEQ2TSLWKJUK","json":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK.json","graph_json":"https://pith.science/api/pith-number/GGJSFQFDTSQI4ROEQ2TSLWKJUK/graph.json","events_json":"https://pith.science/api/pith-number/GGJSFQFDTSQI4ROEQ2TSLWKJUK/events.json","paper":"https://pith.science/paper/GGJSFQFD"},"agent_actions":{"view_html":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK","download_json":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK.json","view_paper":"https://pith.science/paper/GGJSFQFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0212048&json=true","fetch_graph":"https://pith.science/api/pith-number/GGJSFQFDTSQI4ROEQ2TSLWKJUK/graph.json","fetch_events":"https://pith.science/api/pith-number/GGJSFQFDTSQI4ROEQ2TSLWKJUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/action/storage_attestation","attest_author":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/action/author_attestation","sign_citation":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/action/citation_signature","submit_replication":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/action/replication_record"}},"created_at":"2026-05-18T01:05:04.215462+00:00","updated_at":"2026-05-18T01:05:04.215462+00:00"}