{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:UZWUTLJHXCR5PVUQZFUEOHUWUP","short_pith_number":"pith:UZWUTLJH","schema_version":"1.0","canonical_sha256":"a66d49ad27b8a3d7d690c968471e96a3d908f42420a67c62b10281309f37c78a","source":{"kind":"arxiv","id":"quant-ph/0201007","version":1},"attestation_state":"computed","paper":{"title":"A lower bound on the quantum query complexity of read-once functions","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Howard Barnum, Michael Saks","submitted_at":"2002-01-03T19:19:09Z","abstract_excerpt":"We establish a lower bound of $\\Omega{(\\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\\Omega(\\sqrt{D(f)})$ is a lower bound for all Boolean functions. Our technique extends a result of Ambainis, based on the idea that successful computation of a function requires ``decoherence'' of initially coherently superposed inputs in the query register, having different values of the function. The number of queries is bounded by comparing the required total amount of decoherence of a judiciously selected set of input-o"},"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/0201007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-01-03T19:19:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"257872d2da3328186b05658689865bbe91d5e25665657b488757a7c9246f8f84","abstract_canon_sha256":"c70c392190bf5572f98f3b0db4caa34d4cbb4e789707ab6dede1f86ac1b49ddc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:52.354219Z","signature_b64":"dpnFikk7uCC8Mx4Gorh/XbbL24xH1d8bLtdeV3nYo3oxAbnndj/S6yf5KHGL3DgRoyKQnf3bTAmC95l9X3SyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a66d49ad27b8a3d7d690c968471e96a3d908f42420a67c62b10281309f37c78a","last_reissued_at":"2026-07-04T14:45:52.353849Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:52.353849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the quantum query complexity of read-once functions","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Howard Barnum, Michael Saks","submitted_at":"2002-01-03T19:19:09Z","abstract_excerpt":"We establish a lower bound of $\\Omega{(\\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\\Omega(\\sqrt{D(f)})$ is a lower bound for all Boolean functions. Our technique extends a result of Ambainis, based on the idea that successful computation of a function requires ``decoherence'' of initially coherently superposed inputs in the query register, having different values of the function. The number of queries is bounded by comparing the required total amount of decoherence of a judiciously selected set of input-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0201007","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/quant-ph/0201007/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/0201007","created_at":"2026-07-04T14:45:52.353904+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0201007v1","created_at":"2026-07-04T14:45:52.353904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0201007","created_at":"2026-07-04T14:45:52.353904+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZWUTLJHXCR5","created_at":"2026-07-04T14:45:52.353904+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZWUTLJHXCR5PVUQ","created_at":"2026-07-04T14:45:52.353904+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZWUTLJH","created_at":"2026-07-04T14:45:52.353904+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07876","citing_title":"The Compressed Oracle is a Worthy (Multiplicative) Adversary","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP","json":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP.json","graph_json":"https://pith.science/api/pith-number/UZWUTLJHXCR5PVUQZFUEOHUWUP/graph.json","events_json":"https://pith.science/api/pith-number/UZWUTLJHXCR5PVUQZFUEOHUWUP/events.json","paper":"https://pith.science/paper/UZWUTLJH"},"agent_actions":{"view_html":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP","download_json":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP.json","view_paper":"https://pith.science/paper/UZWUTLJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0201007&json=true","fetch_graph":"https://pith.science/api/pith-number/UZWUTLJHXCR5PVUQZFUEOHUWUP/graph.json","fetch_events":"https://pith.science/api/pith-number/UZWUTLJHXCR5PVUQZFUEOHUWUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/action/storage_attestation","attest_author":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/action/author_attestation","sign_citation":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/action/citation_signature","submit_replication":"https://pith.science/pith/UZWUTLJHXCR5PVUQZFUEOHUWUP/action/replication_record"}},"created_at":"2026-07-04T14:45:52.353904+00:00","updated_at":"2026-07-04T14:45:52.353904+00:00"}