{"id":"W2897180663","doi":"10.1103/physrevlett.122.120504","title":"Experimental Quantum Switching for Exponentially Superior Quantum Communication Complexity","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research; Xanadu Quantum Technologies (Canada)","funders":"Australian Research Council; Chinese Academy of Sciences; National Natural Science Foundation of China; National Key Research and Development Program of China; Shanghai Science and Technology Development Foundation","keywords":"Computer science; Quantum; Quantum information science; Quantum computer; Quantum information; Communication complexity; Superposition principle; Quantum superposition; Quantum network; Quantum complexity theory; Coherence (philosophical gambling strategy); Quantum capacity; Theoretical computer science; Quantum error correction; Statistical physics; Quantum mechanics; Physics; Quantum entanglement","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.0009587429,0.0002337424,0.0001779432,0.0002593891,0.00060309,0.001033502,0.0006163245,0.000523549,0.007958372],"category_scores_gemma":[0.003603981,0.000228283,0.0001277186,0.0004142632,0.001404147,0.001833918,0.001038631,0.001836396,0.0003253192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007538555,"about_ca_system_score_gemma":0.0005122547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001754074,"about_ca_topic_score_gemma":0.0002385697,"domain_scores_codex":[0.9992908,0.0001616271,0.00005188079,0.0001191803,0.0002878661,0.00008851704],"domain_scores_gemma":[0.9977615,0.001351493,0.0001898188,0.0004470586,0.00014846,0.0001016458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004060087,0.000400454,0.0006576938,0.0002336314,0.00001951005,0.0001183281,0.0002611445,0.005048456,0.4525094,0.5202734,0.001787487,0.01828437],"study_design_scores_gemma":[0.000222658,0.0006374342,0.001093684,0.00004338585,0.00002144562,0.0001883783,0.0001417577,0.06335077,0.8243717,0.09839104,0.01148899,0.0000486517],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8660992,0.0005059239,0.07400488,0.001657424,0.000294469,0.0001608228,0.0002944086,0.0004196932,0.05656314],"genre_scores_gemma":[0.9728913,0.0001785641,0.0251618,0.0001096358,0.00003432772,0.00009906954,0.00007379868,0.000039953,0.001411565],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007958372,"threshold_uncertainty_score":0.02662343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02727242470232518,"score_gpt":0.3033709802503543,"score_spread":0.2760985555480291,"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."}}