{"id":"W2109924867","doi":"10.1007/s00453-002-0976-3","title":"Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Binary tree; Binary search tree; Element (criminal law); Binary number; Oracle; Discrete mathematics; Quantum; Sorting; Quantum algorithm; Algorithm; Computer science; Arithmetic; 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.002883134,0.0004697389,0.001536059,0.001352235,0.002592461,0.006149564,0.002443202,0.002687847,0.01384742],"category_scores_gemma":[0.02835469,0.0008592383,0.001316186,0.002476873,0.005632791,0.01733887,0.003106887,0.004946711,0.0006641675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004392822,"about_ca_system_score_gemma":0.003165139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00359758,"about_ca_topic_score_gemma":0.004040078,"domain_scores_codex":[0.9971208,0.0008209638,0.0001412097,0.0003471601,0.0009820784,0.0005878169],"domain_scores_gemma":[0.9668497,0.02766853,0.001107336,0.002723024,0.0009744275,0.000676973],"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.0001167031,0.00004268423,0.0003616508,0.00005997072,0.00001136329,0.00004479438,0.0001474199,0.01571444,0.0002963995,0.9765387,0.001737872,0.004927972],"study_design_scores_gemma":[0.00002441475,0.000008136352,0.0001974257,0.000008897598,0.000009129697,0.00003304531,0.00006810309,0.03481251,0.0002937073,0.9639542,0.0005784808,0.0000118205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6290077,0.002919957,0.2558805,0.01909755,0.0003764356,0.0001572752,0.001084034,0.0005334283,0.09094325],"genre_scores_gemma":[0.9678133,0.0008343306,0.02269004,0.0003243133,0.0002236709,0.0001203736,0.0002902342,0.0001410372,0.007562605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01384742,"threshold_uncertainty_score":0.04632419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02030524396563501,"score_gpt":0.23947494096838,"score_spread":0.219169697002745,"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."}}