{"id":"W2122780600","doi":"10.1145/502090.502097","title":"Quantum lower bounds by polynomials","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":659,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Boolean function; Quantum algorithm; Mathematics; Bounded function; Discrete mathematics; Quantum; Polynomial; Quantum complexity theory; Extension (predicate logic); Function (biology); Combinatorics; Computer science; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005223367,0.00009823159,0.0001677629,0.00005542587,0.0001633744,0.0001737505,0.004381924,0.00003878149,0.000011956],"category_scores_gemma":[0.0003487948,0.00005508768,0.0001917386,0.0002676714,0.00003963271,0.000175552,0.0008520046,0.000306343,0.00001155756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003136141,"about_ca_system_score_gemma":0.00008179367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009425167,"about_ca_topic_score_gemma":6.957032e-7,"domain_scores_codex":[0.9989526,0.00008395904,0.0003010666,0.0001115187,0.0003358761,0.0002150256],"domain_scores_gemma":[0.9983372,0.0001254771,0.0003339378,0.00104501,0.00007352098,0.00008484174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007834798,0.000415811,0.002934466,0.00001126508,0.0001656322,0.0002626215,0.001358873,0.003941916,0.02206772,0.00302043,0.8244876,0.1412553],"study_design_scores_gemma":[0.001638353,0.0009090273,0.0108988,0.0002461375,0.00004333776,0.005443011,0.00003791764,0.1309549,0.005583571,0.1344619,0.7091994,0.0005837017],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9143634,0.0009576707,0.04108993,0.03970694,0.003533971,0.00004597041,0.00000111891,0.00002901166,0.0002719854],"genre_scores_gemma":[0.9795787,0.00005255003,0.01736242,0.001683502,0.0007040213,2.515849e-7,6.127608e-8,0.000009956258,0.0006085008],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1406716,"threshold_uncertainty_score":0.8142779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01042503458019538,"score_gpt":0.2404386584872687,"score_spread":0.2300136239070733,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}