{"id":"W2159862444","doi":"10.1109/sfcs.2000.892140","title":"Fast parallel circuits for the quantum Fourier transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Binary logarithm; Mathematics; Log-log plot; Bounded function; Quantum Fourier transform; Circuit complexity; Polynomial; Fourier transform; Combinatorics; Omega; Constant (computer programming); Discrete mathematics; Quantum computer; Electronic circuit; Quantum; Physics; Mathematical analysis; Quantum mechanics; Quantum gate; Computer science","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.0007075982,0.0009549519,0.0005136188,0.0007543942,0.0009723072,0.001643216,0.001152243,0.001111184,0.01389748],"category_scores_gemma":[0.004174201,0.0004397282,0.0009669716,0.0009425154,0.001250967,0.005035437,0.001670598,0.002923237,0.001729902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00237534,"about_ca_system_score_gemma":0.001014541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00119052,"about_ca_topic_score_gemma":0.002146449,"domain_scores_codex":[0.9989612,0.000145863,0.00005618829,0.0001857204,0.0005207188,0.0001301775],"domain_scores_gemma":[0.9983253,0.0009137343,0.0001258558,0.0003255801,0.0002608255,0.00004864836],"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.000240203,0.0001025301,0.0003273226,0.0002422135,0.00003888804,0.0001467509,0.0002278412,0.03685255,0.02052389,0.8101881,0.01115685,0.1199529],"study_design_scores_gemma":[0.00008025612,0.0001406351,0.000268763,0.00007474453,0.00006143833,0.0002673686,0.00006299171,0.2875535,0.03035675,0.6328037,0.04828441,0.00004552093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0448953,0.001877466,0.8870806,0.002932633,0.0006678435,0.0002337355,0.0004754704,0.002283983,0.05955304],"genre_scores_gemma":[0.513567,0.001697027,0.4544245,0.001180641,0.0005440574,0.0004878835,0.0006128116,0.0004407109,0.02704527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01389748,"threshold_uncertainty_score":0.04649168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0235292123793545,"score_gpt":0.2300955484066118,"score_spread":0.2065663360272574,"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."}}