{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002048278,0.00005697431,0.00006213435,0.00006063945,0.0002791658,0.0001672902,0.0001671593,0.00002063363,2.801212e-7],"category_scores_gemma":[0.00002631343,0.00004065846,0.00001871938,0.0002443521,0.0000754366,0.0005040687,0.00007888261,0.00006751547,0.000005769911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001296865,"about_ca_system_score_gemma":0.00004700535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003642106,"about_ca_topic_score_gemma":0.000004336514,"domain_scores_codex":[0.9994447,0.00001993542,0.0002322931,0.00005801541,0.0001511822,0.0000938868],"domain_scores_gemma":[0.999559,0.00006279893,0.0001489002,0.00009440036,0.0001074545,0.00002745206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003600751,0.00001006373,0.00005344177,0.00001885045,0.000005969725,2.462811e-7,0.003021696,0.1143641,0.00001800952,0.391871,0.00003659794,0.4905964],"study_design_scores_gemma":[0.0003551045,0.000051327,0.007423207,0.00002158448,0.000001270307,0.00001896094,0.0001194168,0.9135114,0.0002232597,0.07713838,0.001063834,0.00007228493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1341272,0.00003148287,0.863745,0.001358589,0.0001511399,0.00006989025,7.642153e-7,0.00006307263,0.0004527815],"genre_scores_gemma":[0.939118,0.000009201936,0.06066627,0.0001828195,0.00001434828,0.00000151083,0.000004677435,0.000001233324,0.000001884339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8049908,"threshold_uncertainty_score":0.2147146,"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."}}