{"id":"W2917061129","doi":"10.4230/lipics.ccc.2019.20","title":"Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quantum entanglement; Quantum information science; Bipartite graph; LOCC; Communication complexity; Mathematics; Discrete mathematics; Quantum mechanics; Bounded function; Physics; Quantum","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004233032,0.00151927,0.00147076,0.001511388,0.00149551,0.003590263,0.003601946,0.002779451,0.007310594],"category_scores_gemma":[0.03998371,0.0007861632,0.002366148,0.00209545,0.008705634,0.01704204,0.005931741,0.007884002,0.000814341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004622174,"about_ca_system_score_gemma":0.001783018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001036035,"about_ca_topic_score_gemma":0.0007339015,"domain_scores_codex":[0.9937853,0.002182665,0.000248154,0.001509102,0.001390321,0.000884484],"domain_scores_gemma":[0.9345901,0.05319877,0.002439469,0.007335275,0.00136171,0.00107467],"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.0004687277,0.0002120705,0.0018945,0.0003566028,0.00008667408,0.0002276313,0.0003958303,0.1157929,0.005556942,0.845401,0.003362403,0.02624457],"study_design_scores_gemma":[0.0000476819,0.0001184402,0.0009944278,0.00008101447,0.00005854182,0.0002130713,0.0000954216,0.3260809,0.003990373,0.6656715,0.002595054,0.00005365787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.261393,0.004082031,0.6678496,0.01309133,0.0003279943,0.0002593017,0.0007710957,0.0006286011,0.0515971],"genre_scores_gemma":[0.9062666,0.001728946,0.08119822,0.0008481009,0.0005317123,0.0006275375,0.0003266044,0.0003489201,0.008123255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007310594,"threshold_uncertainty_score":0.03353637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03117126209909912,"score_gpt":0.270374066514773,"score_spread":0.2392028044156738,"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."}}