{"id":"W2065276051","doi":"10.1142/s0219749904000109","title":"EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS","year":2004,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo; St. Jerome's University","funders":"","keywords":"Quantum Fourier transform; Quantum algorithm; Logarithm; Algorithm; Quantum phase estimation algorithm; Discrete Fourier transform (general); Quantum computer; Fourier transform; Discrete logarithm; Quantum; Quantum error correction; Mathematics; Computer science; Discrete mathematics; Quantum mechanics; Fourier analysis; Fractional Fourier transform; Physics; Mathematical analysis; Public-key cryptography","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.0006298085,0.0001912279,0.0002267239,0.0004720958,0.0001207566,0.00050157,0.0009412267,0.00008348185,0.000006816433],"category_scores_gemma":[0.00009482518,0.0001457099,0.000149264,0.0001982408,0.00007157288,0.003772254,0.0001317722,0.0003717178,0.00001767762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001064062,"about_ca_system_score_gemma":0.0001702726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000387468,"about_ca_topic_score_gemma":0.000001470618,"domain_scores_codex":[0.9978591,0.00003166472,0.0008204649,0.0001306461,0.0009168182,0.0002413342],"domain_scores_gemma":[0.998477,0.00007313521,0.0005808916,0.0001763027,0.0005370737,0.0001556082],"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.0001186218,0.0001324163,0.0001655279,0.0000396021,0.000275191,0.0001579495,0.009218772,0.04065785,0.0001980021,0.3423603,0.0003044694,0.6063713],"study_design_scores_gemma":[0.002501996,0.0005138134,0.003207387,0.0002095588,0.00001585191,0.002485999,0.0002114318,0.893995,0.0007926025,0.08534719,0.01039575,0.0003233697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.102467,0.0001069249,0.8892174,0.006058471,0.001803001,0.00008539751,0.00001097978,0.00005023608,0.0002004949],"genre_scores_gemma":[0.9439074,0.0001476241,0.05490794,0.0006568845,0.0003537255,0.000001898625,0.0000098337,0.000008548975,0.000006185893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8533372,"threshold_uncertainty_score":0.5941876,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007846436893072413,"score_gpt":0.2488456276524128,"score_spread":0.2409991907593404,"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."}}