{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:XKIWKMIPB33CVOJPITJSZGWMEF","short_pith_number":"pith:XKIWKMIP","schema_version":"1.0","canonical_sha256":"ba9165310f0ef62ab92f44d32c9acc217c3c071d3fa695e68ae1b0ba5d793ea7","source":{"kind":"arxiv","id":"quant-ph/0305028","version":4},"attestation_state":"computed","paper":{"title":"Polynomial degree vs. quantum query complexity","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2003-05-06T11:53:23Z","abstract_excerpt":"The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight.\n  We exhibit a function with polynomial degree M and quantum query complexity \\Omega(M^{1.321...}). This is the first superlinear separation between polynomial degree and quantum query complexity. The lower bound is shown by a new, more general version of quantum adversary method."},"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/0305028","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-06T11:53:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c1f0191213f4de6322d7ac5a3acd5e305395e0800d9357ed6e71f1ed48dee13e","abstract_canon_sha256":"7fc589d7906bf19ffeef43298e1e7ed5ce6843c808160927e5ba1efd919ee3cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:28.990105Z","signature_b64":"JnSRDfx5PdJOqaWW+lEvzk62XGlAnvxl8uOp49sZyU117X2c9/MwgbPKesn95lAKHQ3d62MZwg1DQZjMSTHADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba9165310f0ef62ab92f44d32c9acc217c3c071d3fa695e68ae1b0ba5d793ea7","last_reissued_at":"2026-07-04T15:11:28.989696Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:28.989696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial degree vs. quantum query complexity","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2003-05-06T11:53:23Z","abstract_excerpt":"The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight.\n  We exhibit a function with polynomial degree M and quantum query complexity \\Omega(M^{1.321...}). This is the first superlinear separation between polynomial degree and quantum query complexity. The lower bound is shown by a new, more general version of quantum adversary method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0305028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0305028/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/0305028","created_at":"2026-07-04T15:11:28.989750+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0305028v4","created_at":"2026-07-04T15:11:28.989750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0305028","created_at":"2026-07-04T15:11:28.989750+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKIWKMIPB33C","created_at":"2026-07-04T15:11:28.989750+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKIWKMIPB33CVOJP","created_at":"2026-07-04T15:11:28.989750+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKIWKMIP","created_at":"2026-07-04T15:11:28.989750+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/XKIWKMIPB33CVOJPITJSZGWMEF","json":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF.json","graph_json":"https://pith.science/api/pith-number/XKIWKMIPB33CVOJPITJSZGWMEF/graph.json","events_json":"https://pith.science/api/pith-number/XKIWKMIPB33CVOJPITJSZGWMEF/events.json","paper":"https://pith.science/paper/XKIWKMIP"},"agent_actions":{"view_html":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF","download_json":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF.json","view_paper":"https://pith.science/paper/XKIWKMIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0305028&json=true","fetch_graph":"https://pith.science/api/pith-number/XKIWKMIPB33CVOJPITJSZGWMEF/graph.json","fetch_events":"https://pith.science/api/pith-number/XKIWKMIPB33CVOJPITJSZGWMEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF/action/storage_attestation","attest_author":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF/action/author_attestation","sign_citation":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF/action/citation_signature","submit_replication":"https://pith.science/pith/XKIWKMIPB33CVOJPITJSZGWMEF/action/replication_record"}},"created_at":"2026-07-04T15:11:28.989750+00:00","updated_at":"2026-07-04T15:11:28.989750+00:00"}