{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005380524,0.0004993242,0.001753335,0.001671812,0.001758919,0.006555983,0.002310202,0.002899935,0.01185301],"category_scores_gemma":[0.04746708,0.0006873099,0.0009538584,0.00254113,0.004940404,0.01874498,0.002799584,0.005078965,0.00100977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003856802,"about_ca_system_score_gemma":0.002427237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002235827,"about_ca_topic_score_gemma":0.001646206,"domain_scores_codex":[0.9941483,0.001640868,0.0002398932,0.0008838523,0.001612206,0.001474986],"domain_scores_gemma":[0.903962,0.07828522,0.003367672,0.008534746,0.003045335,0.00280509],"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.0004242281,0.0001015471,0.002115516,0.0001864059,0.00003571383,0.00007949344,0.000275657,0.01698032,0.001777961,0.9593791,0.004498438,0.01414567],"study_design_scores_gemma":[0.00009186439,0.00008069386,0.001505342,0.00003684505,0.00004782002,0.0002776791,0.0001552512,0.08062731,0.0010433,0.9135768,0.002514279,0.00004273737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.615689,0.008140514,0.2472461,0.0517354,0.0008651189,0.0001703172,0.001507196,0.0006854699,0.07396083],"genre_scores_gemma":[0.9843727,0.001434425,0.007798141,0.0006066177,0.000906869,0.00003891325,0.0001468102,0.0001172508,0.00457824],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01185301,"threshold_uncertainty_score":0.03965229,"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."}}