{"id":"W4396545135","doi":"10.1103/physrevlett.132.180805","title":"Tight Bounds on Pauli Channel Learning without Entanglement","year":2024,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"NTT Research; Air Force Office of Scientific Research; Government of Canada; David and Lucile Packard Foundation; Ministry of Colleges and Universities; Multidisciplinary University Research Initiative; Army Research Office; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Office of Science; U.S. Department of Energy; California Institute of Technology; Massachusetts Institute of Technology; National Science Foundation","keywords":"Quantum entanglement; Pauli exclusion principle; Upper and lower bounds; Physics; Quantum mechanics; Qubit; Topology (electrical circuits); Squashed entanglement; Channel (broadcasting); Eigenvalues and eigenvectors; Computer science; Statistical physics; Quantum; Mathematics; Combinatorics; Telecommunications; Mathematical analysis","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.01034178,0.002838091,0.002837052,0.002215576,0.002641696,0.006040097,0.004114249,0.002796412,0.007777202],"category_scores_gemma":[0.07238509,0.00138627,0.0014544,0.002422317,0.00882744,0.01683446,0.008187387,0.01265828,0.001821616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005057883,"about_ca_system_score_gemma":0.003339231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001479778,"about_ca_topic_score_gemma":0.00169563,"domain_scores_codex":[0.988653,0.002702218,0.000441303,0.002253574,0.00378479,0.002165119],"domain_scores_gemma":[0.9054276,0.0755665,0.002946252,0.009866958,0.004065719,0.002127103],"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.000569554,0.0002726698,0.001595948,0.0005430946,0.0001038524,0.0001709443,0.0003377303,0.1867553,0.007006504,0.7486002,0.007483799,0.04656037],"study_design_scores_gemma":[0.00004284734,0.0001159064,0.0004251773,0.0001410483,0.00003175328,0.0001157657,0.00005630178,0.4162211,0.005218809,0.5748347,0.002739225,0.0000574953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05635894,0.005481157,0.8897951,0.006565243,0.0005557399,0.0001565513,0.0007083021,0.001217367,0.03916158],"genre_scores_gemma":[0.8537355,0.004301559,0.1285261,0.001951405,0.001297338,0.0007724771,0.0009281316,0.0008000041,0.007687543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01034178,"threshold_uncertainty_score":0.05469322,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01238530267485451,"score_gpt":0.282883719110549,"score_spread":0.2704984164356945,"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."}}