{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:HBDBJ24LF5L7NTGGPRXRX5VYJC","short_pith_number":"pith:HBDBJ24L","schema_version":"1.0","canonical_sha256":"384614eb8b2f57f6ccc67c6f1bf6b848ad6305421df81d84368c1e4c234a022e","source":{"kind":"arxiv","id":"quant-ph/9802049","version":3},"attestation_state":"computed","paper":{"title":"Quantum Lower Bounds by Polynomials","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Harry Buhrman (CWI), Michele Mosca (U of Oxford), Richard Cleve (U of Calgary), Robert Beals (U of Arizona), Ronald de Wolf (CWI, U of Amsterdam)","submitted_at":"1998-02-18T17:41:12Z","abstract_excerpt":"We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes some total Boolean function f with bounded-error using T black-box queries then there is a classical deterministic algorithm that computes f exactly with O(T^6) queries.\n  We also give asymptotically t"},"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/9802049","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1998-02-18T17:41:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"72093c69a5a07788657c06f1d1e5ef8787232afe9255fd062e0f247b1b0b9711","abstract_canon_sha256":"6b62990ca881b15b6f51d4b7f614e64716d988e9c308a8be9ada90d09808a42b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:10.911403Z","signature_b64":"B8xCrFLJxSbkupg4kNGk+3Shlxt8qQvJ5/VYpf0cQw/MjwbRdlf95RrjFicOj+/OPZMVpK5ohhs80x2mpX9jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"384614eb8b2f57f6ccc67c6f1bf6b848ad6305421df81d84368c1e4c234a022e","last_reissued_at":"2026-07-04T14:47:10.911034Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:10.911034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Lower Bounds by Polynomials","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Harry Buhrman (CWI), Michele Mosca (U of Oxford), Richard Cleve (U of Calgary), Robert Beals (U of Arizona), Ronald de Wolf (CWI, U of Amsterdam)","submitted_at":"1998-02-18T17:41:12Z","abstract_excerpt":"We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes some total Boolean function f with bounded-error using T black-box queries then there is a classical deterministic algorithm that computes f exactly with O(T^6) queries.\n  We also give asymptotically t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9802049","kind":"arxiv","version":3},"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/quant-ph/9802049/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":"quant-ph/9802049","created_at":"2026-07-04T14:47:10.911084+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9802049v3","created_at":"2026-07-04T14:47:10.911084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9802049","created_at":"2026-07-04T14:47:10.911084+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBDBJ24LF5L7","created_at":"2026-07-04T14:47:10.911084+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBDBJ24LF5L7NTGG","created_at":"2026-07-04T14:47:10.911084+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBDBJ24L","created_at":"2026-07-04T14:47:10.911084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.12675","citing_title":"Answer Partitions and Oracle Access Determine Quantum Query Complexity","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12675","citing_title":"Answer Partitions and Oracle Access Determine Quantum Query Complexity","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12675","citing_title":"Answer Partitions and Oracle Access Determine Quantum Query Complexity","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC","json":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC.json","graph_json":"https://pith.science/api/pith-number/HBDBJ24LF5L7NTGGPRXRX5VYJC/graph.json","events_json":"https://pith.science/api/pith-number/HBDBJ24LF5L7NTGGPRXRX5VYJC/events.json","paper":"https://pith.science/paper/HBDBJ24L"},"agent_actions":{"view_html":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC","download_json":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC.json","view_paper":"https://pith.science/paper/HBDBJ24L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9802049&json=true","fetch_graph":"https://pith.science/api/pith-number/HBDBJ24LF5L7NTGGPRXRX5VYJC/graph.json","fetch_events":"https://pith.science/api/pith-number/HBDBJ24LF5L7NTGGPRXRX5VYJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC/action/storage_attestation","attest_author":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC/action/author_attestation","sign_citation":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC/action/citation_signature","submit_replication":"https://pith.science/pith/HBDBJ24LF5L7NTGGPRXRX5VYJC/action/replication_record"}},"created_at":"2026-07-04T14:47:10.911084+00:00","updated_at":"2026-07-04T14:47:10.911084+00:00"}