{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CRNXH2PZS4KWYRW7ILSYOWLTOM","short_pith_number":"pith:CRNXH2PZ","schema_version":"1.0","canonical_sha256":"145b73e9f997156c46df42e5875973731fcec81d7b353c68d97fa8f39ac0fb58","source":{"kind":"arxiv","id":"1208.1122","version":1},"attestation_state":"computed","paper":{"title":"Optimal quantum query bounds for almost all Boolean functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis (U of Latvia), Arturs Backurs (U of Latvia), Juris Smotrovs (U of Latvia), Ronald de Wolf (CWI, U of Amsterdam)","submitted_at":"2012-08-06T09:20:22Z","abstract_excerpt":"We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis, and shows that van Dam's oracle interrogation is essentially optimal for almost all functions. Our proof uses the fact that the acceptance probability of a T-query algorithm can be written as the sum of squares of degree-T polynomials."},"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":"1208.1122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-06T09:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"ae59875a39fce83b86ebd57d7619c670023e0cd8c04db33ec2ee1379ad9b1ff9","abstract_canon_sha256":"402be54aaeb6d3f7b4b502ee8836ba6df9b928fe89054cefc247d498d9a5d276"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.540122Z","signature_b64":"NR8sXdgLh9otkdG4q2TBN3VU93DeNbAcDEQlm7rWH2xfHpQbivd4gE44qA+dwSU3xOjO8Xrp56FyK2nH18e9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"145b73e9f997156c46df42e5875973731fcec81d7b353c68d97fa8f39ac0fb58","last_reissued_at":"2026-05-18T03:49:20.539367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.539367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal quantum query bounds for almost all Boolean functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis (U of Latvia), Arturs Backurs (U of Latvia), Juris Smotrovs (U of Latvia), Ronald de Wolf (CWI, U of Amsterdam)","submitted_at":"2012-08-06T09:20:22Z","abstract_excerpt":"We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis, and shows that van Dam's oracle interrogation is essentially optimal for almost all functions. Our proof uses the fact that the acceptance probability of a T-query algorithm can be written as the sum of squares of degree-T polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1122","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":"1208.1122","created_at":"2026-05-18T03:49:20.539476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1122v1","created_at":"2026-05-18T03:49:20.539476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1122","created_at":"2026-05-18T03:49:20.539476+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRNXH2PZS4KW","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRNXH2PZS4KWYRW7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRNXH2PZ","created_at":"2026-05-18T12:27:01.376967+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/CRNXH2PZS4KWYRW7ILSYOWLTOM","json":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM.json","graph_json":"https://pith.science/api/pith-number/CRNXH2PZS4KWYRW7ILSYOWLTOM/graph.json","events_json":"https://pith.science/api/pith-number/CRNXH2PZS4KWYRW7ILSYOWLTOM/events.json","paper":"https://pith.science/paper/CRNXH2PZ"},"agent_actions":{"view_html":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM","download_json":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM.json","view_paper":"https://pith.science/paper/CRNXH2PZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1122&json=true","fetch_graph":"https://pith.science/api/pith-number/CRNXH2PZS4KWYRW7ILSYOWLTOM/graph.json","fetch_events":"https://pith.science/api/pith-number/CRNXH2PZS4KWYRW7ILSYOWLTOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/action/storage_attestation","attest_author":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/action/author_attestation","sign_citation":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/action/citation_signature","submit_replication":"https://pith.science/pith/CRNXH2PZS4KWYRW7ILSYOWLTOM/action/replication_record"}},"created_at":"2026-05-18T03:49:20.539476+00:00","updated_at":"2026-05-18T03:49:20.539476+00:00"}