{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002360228,0.0002081004,0.0002756959,0.00005396792,0.0001273741,0.0002155564,0.0004908678,0.000007429149,0.000009737818],"category_scores_gemma":[0.00001752826,0.0001491279,0.0002020208,0.000332321,0.00003405263,0.0001152646,0.0001764385,0.0004395643,0.0003981799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004469416,"about_ca_system_score_gemma":0.00002000913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003156275,"about_ca_topic_score_gemma":1.260529e-7,"domain_scores_codex":[0.9984712,0.0001187257,0.0001773673,0.0005094087,0.0003898127,0.000333469],"domain_scores_gemma":[0.9993737,0.000132844,0.00004545107,0.000337063,0.00001048793,0.0001004003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007482005,0.0004266395,0.00005798653,0.004774708,0.000274856,0.0005678276,0.004047366,0.0186415,0.008519257,0.04341095,0.05331272,0.8659587],"study_design_scores_gemma":[0.00008831144,0.0001705647,0.00008799258,0.003621657,0.00002621438,0.00001868534,0.000001922687,0.791908,0.0002461784,0.0009396435,0.2025751,0.0003157114],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2158426,0.04356575,0.479789,0.2512877,0.003399627,0.001279561,0.000006643166,0.002645233,0.002183913],"genre_scores_gemma":[0.9636741,0.001082792,0.002073581,0.03208114,0.0009357004,0.00003993445,0.000006099179,0.00002993981,0.00007670666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.865643,"threshold_uncertainty_score":0.6081258,"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."}}