{"id":"W2126323053","doi":"10.1016/j.jcss.2005.06.006","title":"Polynomial degree vs. quantum query complexity","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Mathematics; Upper and lower bounds; Quantum complexity theory; Polynomial; Function (biology); Quantum; Degree of a polynomial; Combinatorics; Time complexity; Structural complexity theory; Discrete mathematics; Quantum algorithm; Computational complexity theory; Complexity class; Algorithm; Physics; 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.001680963,0.0001822158,0.00042096,0.0002876777,0.0004488853,0.0005830972,0.001349211,0.00005137649,0.000001666671],"category_scores_gemma":[0.000009937451,0.0001233997,0.0001438152,0.000386069,0.0002770592,0.0006616451,0.000315333,0.0002382864,0.000007281775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004093014,"about_ca_system_score_gemma":0.0001697807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000193719,"about_ca_topic_score_gemma":0.000004673474,"domain_scores_codex":[0.9978985,0.0001857972,0.0006450201,0.0003066356,0.0006194355,0.0003446702],"domain_scores_gemma":[0.9987722,0.0001892671,0.00046354,0.0002178156,0.0001439813,0.0002131976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006252894,0.0002635084,0.004150788,0.0001993112,0.000121426,0.000245005,0.005047533,0.02916349,0.0003071801,0.0859139,0.02499804,0.8495273],"study_design_scores_gemma":[0.0004264458,0.0005950911,0.008733502,0.0001858149,0.00000684443,0.002646463,0.00007085539,0.9811375,0.00007778051,0.000296877,0.005626787,0.0001961115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3987072,0.0008239045,0.5946617,0.003124069,0.001928311,0.00007381335,0.000001216007,0.00007336736,0.0006065054],"genre_scores_gemma":[0.8208042,0.00000891589,0.1775644,0.0002613763,0.001346176,3.022321e-7,6.357315e-8,0.000003837713,0.0000107112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9519739,"threshold_uncertainty_score":0.562282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03660138892514958,"score_gpt":0.2591070153224866,"score_spread":0.222505626397337,"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."}}