{"id":"W2100827027","doi":"10.1007/s00037-005-0194-x","title":"Quantum Arthur–Merlin games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Quantum pseudo-telepathy; Soundness; Quantum sort; Merlin (protein); Quantum; Discrete mathematics; Mathematics; Quantum computer; Quantum information; Quantum complexity theory; Computer science; Combinatorics; Quantum mechanics; Quantum error correction; Quantum network; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.0003096665,0.0002383119,0.000248123,0.0001533533,0.0003760567,0.0002287849,0.001021805,0.00005565253,0.0000646075],"category_scores_gemma":[0.00004003304,0.0002269118,0.0001406568,0.0004383349,0.0001656769,0.0003219153,0.0003908779,0.0002910151,0.0003717035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005298756,"about_ca_system_score_gemma":0.0001200431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001583826,"about_ca_topic_score_gemma":0.000009198096,"domain_scores_codex":[0.998,0.0001232673,0.0003773466,0.0005723346,0.0005143672,0.0004126429],"domain_scores_gemma":[0.998861,0.0001981799,0.0001345857,0.0004580608,0.0001709883,0.0001772],"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.000005532504,0.0001385645,0.0001414874,0.000009485102,0.00002196395,0.0000100466,0.0004606189,0.3717431,0.00002702612,0.4916775,0.002196574,0.1335681],"study_design_scores_gemma":[0.000272987,0.00004769401,0.01924032,0.0000127097,0.000002176176,0.00006025509,0.000004127868,0.7577425,0.00003778151,0.2143363,0.008020282,0.0002229089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2083853,0.0001979906,0.7832428,0.006155135,0.000336362,0.0001221604,0.000009097856,0.0005131806,0.001038043],"genre_scores_gemma":[0.7085252,0.00000131126,0.2899043,0.001135178,0.0003400962,0.00000473027,0.00001980911,0.00001068162,0.00005864677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.50014,"threshold_uncertainty_score":0.9253196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.034762398109001,"score_gpt":0.2775044403854839,"score_spread":0.2427420422764829,"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."}}