{"id":"W2950695032","doi":"10.48550/arxiv.0907.5149","title":"High performance single-error-correcting quantum codes for amplitude damping","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Block code; Code word; Luby transform code; Linear code; Dimension (graph theory); Quantum; Construct (python library); Encoding (memory); Expander code; Decoding methods; Algorithm; Computer science; Mathematics; Physics; Quantum mechanics; Combinatorics","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.0005435266,0.0003720158,0.000347309,0.0007493672,0.0006553665,0.0006568606,0.0006813243,0.0005358684,0.001889413],"category_scores_gemma":[0.002178289,0.0001709556,0.0002892496,0.0005823999,0.001052774,0.0008239492,0.0008310169,0.0008607067,0.0004514504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006852442,"about_ca_system_score_gemma":0.0007237142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005518113,"about_ca_topic_score_gemma":0.0008821818,"domain_scores_codex":[0.9995309,0.00008853916,0.00002283032,0.00006056739,0.0002315022,0.0000656379],"domain_scores_gemma":[0.9987004,0.0004785995,0.0001737282,0.0002935936,0.0002770088,0.00007664635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005513881,0.0002095835,0.003274729,0.0003351083,0.00008294008,0.0003361772,0.0004774484,0.09968475,0.128862,0.6592349,0.005469222,0.1014817],"study_design_scores_gemma":[0.000125243,0.000324577,0.001194365,0.00007886521,0.00005020259,0.0003775467,0.00006067155,0.6507489,0.1979489,0.1366019,0.01240914,0.00007958486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6513907,0.0007444675,0.3230269,0.0006760262,0.0001450948,0.0001399962,0.0002490741,0.00114335,0.0224843],"genre_scores_gemma":[0.9243109,0.0001968511,0.07176259,0.00007824693,0.00002812141,0.00008374856,0.0001597306,0.00005812678,0.003321639],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001889413,"threshold_uncertainty_score":0.006320715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04792537121981303,"score_gpt":0.2761056043847968,"score_spread":0.2281802331649838,"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."}}