{"id":"W4387075175","doi":"10.48550/arxiv.2309.13461","title":"Tight bounds on Pauli channel learning without entanglement","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute","funders":"Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Government of Canada; Ministry of Colleges and Universities; MediaTek; Office of Science; U.S. Department of Energy; California Institute of Technology; Massachusetts Institute of Technology; Multidisciplinary University Research Initiative; Army Research Office; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; National Science Foundation","keywords":"Quantum entanglement; Pauli exclusion principle; Upper and lower bounds; Physics; Quantum mechanics; Qubit; Topology (electrical circuits); Eigenvalues and eigenvectors; Squashed entanglement; Channel (broadcasting); Mathematics; Quantum; Statistical physics; Computer science; Combinatorics; Mathematical analysis; Telecommunications","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.01094715,0.00329924,0.003020694,0.002523173,0.00299163,0.006878537,0.004785394,0.003258826,0.009490441],"category_scores_gemma":[0.08143244,0.001498307,0.001785276,0.002847164,0.009329789,0.01919442,0.009307115,0.0147486,0.002247764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005691161,"about_ca_system_score_gemma":0.004136478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001676015,"about_ca_topic_score_gemma":0.00208665,"domain_scores_codex":[0.9865773,0.003242418,0.0005368212,0.002795852,0.004359413,0.002488235],"domain_scores_gemma":[0.8871995,0.08989957,0.003349241,0.01241019,0.004620938,0.002520424],"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.0006710341,0.0003251322,0.002019762,0.0006198335,0.0001327287,0.000175681,0.0003976102,0.1934465,0.006722639,0.7372351,0.009046895,0.04920703],"study_design_scores_gemma":[0.00004681838,0.0001097432,0.0004631578,0.0001397807,0.00003774022,0.0001035628,0.00005749836,0.3924192,0.004957293,0.598982,0.002626313,0.00005691478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05823268,0.004985118,0.887316,0.007471553,0.0005385096,0.0001766736,0.000855306,0.001455848,0.0389682],"genre_scores_gemma":[0.835586,0.004175997,0.1438987,0.002233804,0.001438181,0.0009671953,0.001200286,0.001105048,0.009394856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01094715,"threshold_uncertainty_score":0.05789477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06445716229593078,"score_gpt":0.2001081463854928,"score_spread":0.1356509840895621,"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."}}