{"id":"W3082756794","doi":"10.4230/lipics.itcs.2021.32","title":"Bounds on the QAC$^0$ Complexity of Approximating Parity","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Toffoli gate; Upper and lower bounds; Electronic circuit; Parity (physics); Qubit; Mathematics; Physics; Discrete mathematics; Quantum; Combinatorics; Quantum gate; Quantum mechanics; Mathematical analysis","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":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001372612,0.0007713476,0.00108808,0.0002127996,0.000668664,0.0009039167,0.004445896,0.0004152862,0.00001159401],"category_scores_gemma":[0.0003547558,0.0005557802,0.0006953281,0.0004212023,0.0004728296,0.0003306949,0.004720992,0.002336103,0.00004248416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001122535,"about_ca_system_score_gemma":0.0002475869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004866764,"about_ca_topic_score_gemma":0.000007180254,"domain_scores_codex":[0.9953706,0.0001649438,0.001945094,0.0006437572,0.001019511,0.0008560466],"domain_scores_gemma":[0.9949729,0.0005739222,0.001743423,0.00212248,0.0003466628,0.0002405436],"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.0002613079,0.001627873,0.001607049,0.01166388,0.001552654,0.0000244748,0.08102262,0.02776946,0.00009738553,0.7843111,0.02043377,0.06962842],"study_design_scores_gemma":[0.0007293167,0.0002652728,0.0004728645,0.0006328529,0.00003426648,0.00002074656,0.0002681498,0.9359809,0.0005434285,0.05425896,0.006175234,0.0006180599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1481175,0.00006524517,0.8322081,0.007684433,0.002499097,0.002653826,0.001232871,0.0006077166,0.004931204],"genre_scores_gemma":[0.8043574,0.00001330673,0.1921075,0.002510444,0.0004168686,0.0001272493,0.0003703739,0.000061785,0.00003509775],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9082114,"threshold_uncertainty_score":0.9999655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0579366486334525,"score_gpt":0.2758983058560783,"score_spread":0.2179616572226258,"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."}}