{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003323474,0.001883274,0.001196703,0.001341606,0.001417534,0.004127854,0.004122784,0.002582371,0.01395062],"category_scores_gemma":[0.02917127,0.0009944495,0.002029316,0.001505935,0.004259432,0.01053086,0.005486566,0.006664943,0.002726328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005756403,"about_ca_system_score_gemma":0.003388772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004142058,"about_ca_topic_score_gemma":0.00413401,"domain_scores_codex":[0.9954189,0.0007876134,0.0002165466,0.0009023894,0.001899814,0.0007748071],"domain_scores_gemma":[0.9698175,0.0231312,0.000815547,0.004303801,0.001346189,0.0005858267],"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.002512474,0.0004486225,0.007039925,0.001370771,0.0002194581,0.0003409636,0.0007284216,0.242965,0.05235837,0.5176569,0.02975846,0.1446006],"study_design_scores_gemma":[0.0001877588,0.0002575082,0.00200406,0.0002159737,0.0001458558,0.0003302266,0.0001212736,0.6540856,0.02856116,0.3034214,0.01057955,0.00008970914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2711852,0.00516691,0.5942835,0.01367847,0.0006307953,0.0005384747,0.003467241,0.006032187,0.1050172],"genre_scores_gemma":[0.7668728,0.002798831,0.2065412,0.003021352,0.00063223,0.001000611,0.00310077,0.001004715,0.01502751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01395062,"threshold_uncertainty_score":0.04666948,"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."}}