{"id":"W2137637395","doi":"10.1007/978-3-540-28629-5_65","title":"An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Trent University","funders":"","keywords":"Argument (complex analysis); Oracle; Quantum complexity theory; Generalization; Quantum algorithm; Quantum computer; Computational complexity theory; Theoretical computer science; Computer science; Quantum; Complexity class; Mathematics; Time complexity; Computation; Discrete mathematics; Algorithm; 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.008927806,0.002449025,0.002845041,0.002715729,0.003415565,0.007257396,0.009051885,0.0058141,0.02085339],"category_scores_gemma":[0.05041629,0.002006143,0.003691655,0.003696655,0.01114596,0.02436915,0.01416853,0.02236491,0.003692358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005100384,"about_ca_system_score_gemma":0.003075721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230643,"about_ca_topic_score_gemma":0.001211418,"domain_scores_codex":[0.9896763,0.002768812,0.0003824772,0.001767629,0.004202505,0.001202284],"domain_scores_gemma":[0.9342098,0.04816747,0.00130839,0.01172668,0.002954278,0.001633227],"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.0001375669,0.000077654,0.0002398262,0.00008649442,0.0000196148,0.00003000342,0.0001501169,0.006306875,0.001242928,0.9781065,0.004153108,0.009449334],"study_design_scores_gemma":[0.00003336648,0.00002622182,0.0001523207,0.00002130918,0.00001970247,0.00003316807,0.00002532032,0.05764944,0.000827175,0.9391211,0.002071138,0.00001979315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03645263,0.001287399,0.8664178,0.01434503,0.0008313688,0.000248498,0.0004449419,0.001412839,0.07855951],"genre_scores_gemma":[0.6790826,0.001413539,0.2546312,0.007333367,0.002550202,0.001459944,0.0009366875,0.001638375,0.05095412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02085339,"threshold_uncertainty_score":0.06976157,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02209990278930636,"score_gpt":0.2721587853212135,"score_spread":0.2500588825319071,"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."}}