{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001385059,0.0001440556,0.0001448704,0.00005886882,0.0001689019,0.0002631785,0.0008014396,0.00005321721,0.0002923036],"category_scores_gemma":[0.00001687329,0.000113582,0.00007679274,0.0002675421,0.00004012074,0.000169764,0.0002095494,0.0001390371,0.0004113433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001453424,"about_ca_system_score_gemma":0.000009243196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003365579,"about_ca_topic_score_gemma":0.00000114271,"domain_scores_codex":[0.9988317,0.00003826125,0.0001834574,0.0003692783,0.0002170872,0.0003601596],"domain_scores_gemma":[0.9992241,0.00007117783,0.00004702019,0.0005115464,0.00002436494,0.0001217781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002242931,0.0002920797,0.00009724477,0.000007718532,0.00002773102,0.00004312507,0.0006438988,0.000303146,0.002898076,0.05200842,0.7239691,0.2197072],"study_design_scores_gemma":[0.000181113,0.000106789,0.00006975913,0.000006204292,0.000001431931,0.00002948051,0.00000318088,0.8537714,0.0007766167,0.001903504,0.1429356,0.0002148481],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1108857,0.001109708,0.8458288,0.01150064,0.001977985,0.0001479588,0.00000503602,0.001076443,0.02746769],"genre_scores_gemma":[0.9640688,0.00001719722,0.02644421,0.002143015,0.0001932641,0.000003231881,9.120739e-7,0.00001320589,0.007116225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8534683,"threshold_uncertainty_score":0.5287123,"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."}}