{"id":"W2905811380","doi":"10.1103/physrevlett.124.090505","title":"Efficiently Computable Bounds for Magic State Distillation","year":2020,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Advanced Scientific Computing Research; U.S. Department of Defense; U.S. Department of Energy; Canadian Institute for Advanced Research; Office of Science; National Science Foundation","keywords":"Computer science; MAGIC (telescope); Distillation; Exploit; Quantum; Computation; Upper and lower bounds; Statistical physics; Theoretical computer science; Mathematics; Algorithm; Quantum mechanics; Physics; Chemistry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000123961,0.0001564721,0.0003018567,0.00001657924,0.0001006131,0.0001176971,0.0004939383,0.000004493904,0.000001469074],"category_scores_gemma":[0.00004826847,0.0001260456,0.0001726652,0.0003711339,0.00003505509,0.0001077615,0.0001500792,0.0001259898,0.00005253356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700856,"about_ca_system_score_gemma":0.00001827965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002119222,"about_ca_topic_score_gemma":5.692429e-8,"domain_scores_codex":[0.9988198,0.00005529912,0.0001966524,0.0004103066,0.0002283498,0.0002896113],"domain_scores_gemma":[0.9993194,0.0001640358,0.00009914405,0.000243426,0.00003702076,0.000136997],"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.00002135558,0.000270817,0.0001024281,0.004817767,0.00008881604,0.00002722772,0.002234201,0.358469,0.009142545,0.01174929,0.05797348,0.5551031],"study_design_scores_gemma":[0.0001550444,0.00007590585,0.0001199984,0.0002102934,0.00001145489,0.000001921457,5.010427e-7,0.9624258,0.00007775741,0.0007710314,0.03598588,0.0001644192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.061331,0.001338083,0.889836,0.04673986,0.0001424339,0.000398301,0.000007175695,0.0001723321,0.00003489022],"genre_scores_gemma":[0.8687533,0.0001608445,0.03770068,0.09272259,0.0005879101,0.00002270589,0.00001792018,0.00002565074,0.000008358768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8521352,"threshold_uncertainty_score":0.5139989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01626199067788696,"score_gpt":0.2712716907128671,"score_spread":0.2550097000349801,"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."}}