{"id":"W1973682419","doi":"10.1016/j.ic.2004.04.001","title":"The query complexity of order-finding","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Permutation (music); Constant (computer programming); Order (exchange); Mathematics; Combinatorics; Exponential function; Probabilistic logic; Time complexity; Polynomial; Discrete mathematics; Computer science; Statistics","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.007228386,0.0009981005,0.00372835,0.002041149,0.002937513,0.008686011,0.005518695,0.003924584,0.01555168],"category_scores_gemma":[0.07276886,0.001212668,0.001790211,0.005032846,0.005800918,0.02717644,0.004275991,0.005833408,0.001428369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007393413,"about_ca_system_score_gemma":0.006337033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007494465,"about_ca_topic_score_gemma":0.005164004,"domain_scores_codex":[0.9891583,0.003245439,0.0005331431,0.001528401,0.003840241,0.001694639],"domain_scores_gemma":[0.8746242,0.1066035,0.00288433,0.0100887,0.003611973,0.002187313],"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.002811344,0.0004347537,0.004985244,0.000691634,0.0002302139,0.0003174629,0.001061363,0.1481153,0.004781732,0.7264121,0.02975396,0.08040483],"study_design_scores_gemma":[0.000184882,0.00007327074,0.0009476284,0.00003456005,0.00009310414,0.0002075829,0.0002153485,0.3497246,0.001552103,0.6450539,0.0018662,0.00004679834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4610665,0.007321529,0.4277036,0.03783026,0.0007536077,0.0003785444,0.004032085,0.001632974,0.0592808],"genre_scores_gemma":[0.9433627,0.002229917,0.04233414,0.0008786524,0.0009258942,0.000181934,0.001377066,0.0005241615,0.0081856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01555168,"threshold_uncertainty_score":0.05364329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01917764641239443,"score_gpt":0.2557719705680923,"score_spread":0.2365943241556978,"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."}}