{"id":"W1953239862","doi":"10.5555/984720.984755","title":"Improved bounds for the approximate QFT","year":2004,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Quantum Fourier transform; Computation; Quantum computer; Quantum; Fourier transform; Algorithm; Computer science; Quantum algorithm; Mathematics; Quantum error correction; Quantum mechanics; Mathematical analysis; Physics","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.0002133935,0.00009238807,0.00007627338,0.00002406285,0.0003103912,0.0002320494,0.0007976315,0.0000263331,0.000002315548],"category_scores_gemma":[0.0000186689,0.00005031681,0.00007608986,0.0001563638,0.00003575493,0.00008094147,0.0001739718,0.0000860673,0.000005980354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000134689,"about_ca_system_score_gemma":0.00005194725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004178113,"about_ca_topic_score_gemma":0.000007663099,"domain_scores_codex":[0.9993015,0.000007491468,0.0001068814,0.0002340222,0.00009406718,0.0002560359],"domain_scores_gemma":[0.9993526,0.0001092868,0.00003406357,0.0004275823,0.00003458233,0.00004192055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007348937,0.00008185901,0.000006737002,0.00002169288,0.00003964844,0.000002994628,0.001272312,0.02036052,0.001854463,0.5971414,0.0008070117,0.378404],"study_design_scores_gemma":[0.0003902768,0.00008045098,0.00006668637,0.000004479571,0.000002619521,0.00001581494,0.00001164759,0.9484496,0.0018692,0.04167784,0.007331241,0.0001001102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003342991,0.00008540352,0.9880056,0.007251238,0.0004068054,0.0002216372,9.788496e-7,0.0002414995,0.0004437972],"genre_scores_gemma":[0.4453119,0.000003590235,0.5523672,0.001569107,0.0002338859,0.00003637341,8.283308e-7,0.00001064091,0.0004665199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9280891,"threshold_uncertainty_score":0.2387309,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01010461100717835,"score_gpt":0.2337483379169302,"score_spread":0.2236437269097518,"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."}}