{"paper":{"title":"Exact Quantum Algorithms for Composed Boolean Functions","arxiv_id":"2611.16412","primary_cat":"cs.CC","submitted_at":"2026-11-12T07:24:01+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":0.62,"id":"s0","own":true,"role":"contribution","text":"We study exact quantum algorithms for block compositions of total Boolean functions.","hedge":{"p":0.55,"label":"asserted"},"own_p":0.75,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.38,"limitation":0.0,"future_work":0.0,"contribution":0.62,"interpretation":0.0}},{"i":1,"p":0.99,"id":"s1","own":true,"role":"result","text":"For an outer function $f$ of degree $D$ and an inner function $g$ on $m$ bits, we prove $$ Q_E(f\\circ g)=O\\!\\left(mD+Q_E(f)Q_{1/(4D)}(g)\\right).","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.72,"quantitative":true,"quantitative_p":0.97,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.99,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.0}},{"i":2,"p":1.0,"id":"s2","own":true,"role":"method","text":"$$ The algorithm combines approximate inner evaluations with a finite exact correction.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.05,"role_probabilities":{"gap":0.0,"method":1.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.7,"id":"s3","own":true,"role":"interpretation","text":"Its two costs are governed by different parameters of the outer function: exact query complexity determines the cost of simulation, whereas polynomial degree determines the number of inner blocks used in the correction.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.11,"quantitative":false,"quantitative_p":0.11,"role_probabilities":{"gap":0.0,"method":0.26,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.7}},{"i":4,"p":0.96,"id":"s4","own":true,"role":"method","text":"We first establish the construction with an arity-dependent error threshold and then obtain the degree-dependent threshold above.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.96,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.04,"interpretation":0.0}},{"i":5,"p":1.0,"id":"s5","own":true,"role":"result","text":"For recursive ternary not-all-equal, this gives an exact algorithm using $(3/\\sqrt2)^{k(1+o(1))}$ queries asymptotically.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.07,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":6,"p":0.97,"id":"s6","own":true,"role":"result","text":"More generally, for every fixed nonconstant total gadget $h$, we determine the exact recursive rate as $\\max\\{\\textrm{deg}(h),\\operatorname{Adv}^{\\pm}(h)\\}$ and prove $Q_E(h^{\\circ k})=\\widetilde O_h(R(h^{\\circ k})^2)$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.21,"quantitative":true,"quantitative_p":0.94,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.97,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.0}},{"i":7,"p":0.9,"id":"s7","own":true,"role":"interpretation","text":"The composition limit also allows to transfer separations from $Q_{\\varepsilon}$ and $\\deg$ to exact quantum query complexity $Q_E$ (similar to fractional block sensitivity to block sensitivity transfer in Tal and Kulkarni 2016, Chicago Journal of Theoretical Computer Science).","hedge":{"p":0.88,"label":"asserted"},"own_p":0.73,"main_claim_p":0.1,"quantitative":false,"quantitative_p":0.39,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.06,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.04,"interpretation":0.9}},{"i":8,"p":0.97,"id":"s8","own":true,"role":"result","text":"We construct a family with $s=\\operatorname{bs}=\\operatorname{fbs}\\ge Q_E^{3/2-o(1)}$, improving the previous exponent $1.1527\\ldots$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.08,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.97,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.0}},{"i":9,"p":0.96,"id":"s9","own":true,"role":"result","text":"A second construction gives $R \\ge Q_E^{2-o(1)}$, improving the previous exponent $3/2$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.08,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.96,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.04,"interpretation":0.0}},{"i":10,"p":0.79,"id":"s10","own":true,"role":"contribution","text":"We also allow different inner functions and give analogous quantitative separations in quantum communication.","hedge":{"p":0.96,"label":"asserted"},"own_p":0.93,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.06,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.21,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.79,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.92,"text":"For an outer function $f$ of degree $D$ and an inner function $g$ on $m$ bits, we prove $$ Q_E(f\\circ g)=O\\!\\left(mD+Q_E(f)Q_{1/(4D)}(g)\\right).","location":"abstract s1","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":8470,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.07,"states_limitation":0.16,"human_participants":0.01,"controlled_comparison":0.03,"randomized_assignment":0.01,"states_quantitative_result":0.98,"compares_with_prior_results":0.96,"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.91,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.09,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.91,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.91,"text":"For an outer function $f$ of degree $D$ and an inner function $g$ on $m$ bits, we prove $$ Q_E(f\\circ g)=O\\!\\left(mD+Q_E(f)Q_{1/(4D)}(g)\\right).","location":"abstract s1"}},"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":11,"sentences_in_abstract":11},"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,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}