{"id":"W7110192836","doi":"10.4230/lipics.mfcs.2025.85","title":"Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Parameterized complexity; Equivalence (formal languages); Modulo; Electronic circuit; Quantum gate; Quantum circuit; Quantum algorithm; Probabilistic logic; Quantum; Formal equivalence checking","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.006814173,0.0009414573,0.001447512,0.001909423,0.001668313,0.004381299,0.003482074,0.001914994,0.007513155],"category_scores_gemma":[0.03912726,0.0008422615,0.002812508,0.001892693,0.005993627,0.01299833,0.005078213,0.008016774,0.0007084936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00446467,"about_ca_system_score_gemma":0.002244848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001482867,"about_ca_topic_score_gemma":0.001146839,"domain_scores_codex":[0.9894235,0.002930344,0.0009462925,0.002640099,0.002995414,0.001064397],"domain_scores_gemma":[0.9470828,0.0399319,0.001935679,0.008334562,0.002077352,0.0006376408],"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.0001937885,0.0001648287,0.00120765,0.0001181744,0.00004720927,0.0001245301,0.0003730402,0.03017221,0.004033882,0.9221909,0.001184623,0.0401892],"study_design_scores_gemma":[0.00005368381,0.00004931309,0.0002372604,0.00002131242,0.00002163772,0.00005240548,0.00003583149,0.09795456,0.003860738,0.8964791,0.001213096,0.00002122034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06641605,0.0002139347,0.9238253,0.0006092241,0.0000479704,0.0001783272,0.0002927034,0.001061334,0.007355188],"genre_scores_gemma":[0.7489876,0.0003383592,0.2440284,0.0006288161,0.0001618682,0.0005690993,0.000992328,0.0005378139,0.003755676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007513155,"threshold_uncertainty_score":0.03603721,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01443888230544496,"score_gpt":0.2711900122484945,"score_spread":0.2567511299430495,"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."}}