{"paper":{"title":"Beyond the $n/2$ Threshold: Quantum Query Complexity for Computing Hamming Weight and Symmetric Functions","arxiv_id":"2611.09809","primary_cat":"quant-ph","submitted_at":"2026-11-06T17:58:16+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"The oracle-interrogation algorithm [van Dam, FOCS '98] computes every $n$-bit Boolean function with bounded error using $n/2+O(\\sqrt n)$ quantum queries.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.03,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":0.97,"id":"s1","own":false,"role":"gap","text":"In contrast, parity can be computed exactly using $\\lceil n/2\\rceil$ queries, but whether an additive overhead beyond $n/2$ is necessary for a single Boolean output has remained open.","hedge":{"p":0.93,"label":"asserted"},"own_p":0.05,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.97,"role_probabilities":{"gap":0.97,"method":0.0,"result":0.0,"background":0.03,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.87,"id":"s2","own":true,"role":"result","text":"In this work, we construct an explicit family of symmetric Boolean functions requiring $n/2+\\Omega(n^{1/3})$ quantum queries at a fixed positive constant error.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.97,"main_claim_p":0.58,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.87,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.13,"interpretation":0.0}},{"i":3,"p":0.54,"id":"s3","own":true,"role":"contribution","text":"We also give an algorithm that recovers the exact Hamming weight using $n/2+O(n^{1/3})$ quantum queries with bounded error, and therefore computes every symmetric Boolean function within the same query bound.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.96,"main_claim_p":0.28,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.02,"result":0.43,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.54,"interpretation":0.01}},{"i":4,"p":0.9,"id":"s4","own":true,"role":"interpretation","text":"Together, these results determine the optimal additive order for Hamming weight recovery and for the worst case over symmetric Boolean functions at sufficiently small constant error.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.58,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.1,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.9}}]},"compiled":{"main_claim":{"p":0.95,"text":"Together, these results determine the optimal additive order for Hamming weight recovery and for the worst case over symmetric Boolean functions at sufficiently small constant error.","location":"abstract s4","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":4408,"cost_usd_reported":0.0},"compiled_at":"2026-11-09","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.15,"states_limitation":0.58,"human_participants":0.01,"controlled_comparison":0.1,"randomized_assignment":0.01,"states_quantitative_result":0.98,"compares_with_prior_results":0.97,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.97,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.03,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.97,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.73,"text":"In this work, we construct an explicit family of symmetric Boolean functions requiring $n/2+\\Omega(n^{1/3})$ quantum queries at a fixed positive constant error.","location":"abstract s2"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":5,"sentences_in_abstract":5},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448}}