{"id":"W2952032150","doi":"10.48550/arxiv.quant-ph/0006004","title":"Fast parallel circuits for the quantum Fourier transform","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Binary logarithm; Mathematics; Bounded function; Polynomial; Circuit complexity; Logarithm; Quantum Fourier transform; Fourier transform; Constant (computer programming); Combinatorics; Quantum computer; Discrete mathematics; Quantum circuit; Quantum; Electronic circuit; Quantum mechanics; Mathematical analysis; Physics; Quantum error correction; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005187693,0.000525278,0.0004849472,0.0001127918,0.0005732976,0.0003230391,0.003170514,0.00031621,0.00002718105],"category_scores_gemma":[0.00003395622,0.0003654975,0.0005327798,0.0002451809,0.0001238887,0.0001206763,0.0006005693,0.001116149,0.00008019815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000441917,"about_ca_system_score_gemma":0.0002526312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000740516,"about_ca_topic_score_gemma":0.00001599062,"domain_scores_codex":[0.9971335,0.00007906891,0.0005067677,0.001087683,0.0004209249,0.0007720841],"domain_scores_gemma":[0.997373,0.0004362965,0.0001999885,0.001731813,0.00009812766,0.0001608153],"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.0000242669,0.0001725199,0.001359165,0.0002196503,0.0003092139,0.00003972425,0.004414689,0.09527218,0.00003516254,0.006196714,0.003429508,0.8885272],"study_design_scores_gemma":[0.0005347236,0.0001171937,0.01056153,0.0001548444,0.00005289745,0.00003484997,0.00002275192,0.9261026,0.00008707566,0.02132598,0.04035002,0.0006555128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1310091,0.001121699,0.8538015,0.009523414,0.002222414,0.001111754,0.00004316768,0.000427858,0.0007389915],"genre_scores_gemma":[0.9718205,0.0003086155,0.02301538,0.001614861,0.001638054,0.0003243877,0.0000353206,0.00008946558,0.001153462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8878717,"threshold_uncertainty_score":0.9998797,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03433781165195882,"score_gpt":0.2603485672887043,"score_spread":0.2260107556367454,"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."}}