{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001226243,0.001121714,0.001004783,0.001164701,0.0008939843,0.001065834,0.003671461,0.0004695075,0.00001238414],"category_scores_gemma":[0.00006034951,0.001040712,0.0003576628,0.0006818586,0.001366784,0.0006085478,0.0007266043,0.001308755,0.0000300152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001079871,"about_ca_system_score_gemma":0.001457623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009227874,"about_ca_topic_score_gemma":0.00006919076,"domain_scores_codex":[0.9931264,0.00009407417,0.0009226887,0.002968005,0.001610919,0.001277897],"domain_scores_gemma":[0.9960231,0.0007279287,0.0006115675,0.001690318,0.0005206073,0.000426442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004808079,0.000219866,0.000002318422,0.00005518103,0.00002697207,0.00008705191,0.0008527947,0.5332021,0.00007235724,0.11221,0.00002048707,0.3532028],"study_design_scores_gemma":[0.0006758486,0.001480295,0.0001009847,0.0004383553,0.000009324533,0.0000375737,3.336407e-7,0.6284409,0.0001990885,0.367431,0.0003976761,0.000788632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007319613,0.0001031568,0.9913639,0.001420408,0.00401276,0.001394736,0.00005430951,0.0004437406,0.0004749886],"genre_scores_gemma":[0.3719106,0.000009331778,0.6247749,0.00199168,0.001078247,0.00003511236,0.00005727838,0.00008840634,0.00005445538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3711786,"threshold_uncertainty_score":0.9999712,"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."}}