{"id":"W2095618864","doi":"10.1109/sfcs.1998.743485","title":"Quantum lower bounds by polynomials","year":2002,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Boolean function; Bounded function; Quantum algorithm; Discrete mathematics; Mathematics; Quantum; Polynomial; Black box; Quantum complexity theory; Function (biology); Extension (predicate logic); Quantum computer; Combinatorics; Computer science; Quantum mechanics; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005761798,0.001697816,0.002078003,0.002295832,0.003093719,0.00549576,0.002776755,0.002607546,0.01389077],"category_scores_gemma":[0.03788737,0.0009235449,0.00273101,0.002881582,0.006657342,0.0161925,0.005404539,0.008762022,0.002331869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005751572,"about_ca_system_score_gemma":0.002943133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00316212,"about_ca_topic_score_gemma":0.002468417,"domain_scores_codex":[0.9926992,0.001688449,0.0002145075,0.001371183,0.002211548,0.001815135],"domain_scores_gemma":[0.9578604,0.03249338,0.001461568,0.005121783,0.002069659,0.0009932809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001606421,0.00006542246,0.0003611891,0.0001408854,0.00002909157,0.00005454856,0.00015535,0.02415806,0.00110797,0.9585139,0.004447883,0.01080506],"study_design_scores_gemma":[0.00003599542,0.00003831682,0.0001631066,0.00003639837,0.00002595815,0.00004758279,0.00003397672,0.1174401,0.001038583,0.8770868,0.004031269,0.00002200094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1017527,0.007001185,0.772848,0.01573776,0.0009163658,0.0002129134,0.0009185514,0.001375093,0.09923755],"genre_scores_gemma":[0.8654796,0.004791553,0.1041271,0.002400447,0.001649047,0.0005863584,0.0006499129,0.0009950551,0.01932094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01389077,"threshold_uncertainty_score":0.04646927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01071458148919707,"score_gpt":0.2126669073982336,"score_spread":0.2019523259090365,"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."}}