{"id":"W1982397733","doi":"10.48550/arxiv.quant-ph/0011065","title":"Sharp Quantum vs. Classical Query Complexity Separations","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Noncommutative geometry; Simple (philosophy); Quantum; Mathematics; Quantum algorithm; Bounded function; Polynomial; Quantum complexity theory; Quantum Fourier transform; Fourier transform; Algebraic number; Discrete mathematics; Pure mathematics; Quantum error correction; Quantum mechanics; Physics; Mathematical analysis","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003431827,0.000585831,0.0006877159,0.0002128238,0.0005006937,0.0004330911,0.002625778,0.0004265259,0.0001160153],"category_scores_gemma":[0.00005318082,0.0005475105,0.0004112649,0.0004063766,0.0002726115,0.0001900835,0.002428794,0.001947263,0.0006820607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009605196,"about_ca_system_score_gemma":0.0004177955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001758591,"about_ca_topic_score_gemma":0.00004189814,"domain_scores_codex":[0.9963139,0.0002745857,0.0006578915,0.001488595,0.0005296503,0.0007353981],"domain_scores_gemma":[0.9970732,0.000207519,0.0002776535,0.002018498,0.0001172785,0.0003058943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002394423,0.004381379,0.1248542,0.001198033,0.00140207,0.001559662,0.01337881,0.2287662,0.0008647174,0.3333942,0.1567251,0.1332361],"study_design_scores_gemma":[0.000251162,0.00009857622,0.1261003,0.0001741391,0.00002369906,0.00004728818,0.000005385351,0.8236604,0.00007431243,0.02569039,0.02312703,0.0007473079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8232521,0.0002935498,0.1603145,0.0101555,0.002215365,0.0004101359,0.00006273371,0.001079638,0.002216476],"genre_scores_gemma":[0.9721051,0.00004883261,0.02452583,0.001367306,0.001093282,0.00004475347,0.00008692419,0.00004664294,0.0006812758],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5948942,"threshold_uncertainty_score":0.9996976,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06221783549432466,"score_gpt":0.2942542188634645,"score_spread":0.2320363833691399,"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."}}