{"id":"W4403884712","doi":"10.48550/arxiv.2410.03628","title":"Supporting Data for PRX Quantum (Universal Adapters between quantum LDPC codes)","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; U.S. Department of Energy","keywords":"Low-density parity-check code; Computer science; Quantum; Error floor; Theoretical computer science; Physics; Algorithm; Decoding methods; Quantum mechanics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005418688,0.0009875986,0.0008588699,0.001657787,0.0008287457,0.001221401,0.002768304,0.001749025,0.5220607],"category_scores_gemma":[0.004685408,0.0005963791,0.0005098921,0.003909463,0.0004379677,0.002429616,0.001720676,0.001935099,0.07840545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001176759,"about_ca_system_score_gemma":0.0010025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002983991,"about_ca_topic_score_gemma":0.003954237,"domain_scores_codex":[0.999369,0.0000513438,0.0000380128,0.00008263846,0.0003448261,0.0001142729],"domain_scores_gemma":[0.9979578,0.0008153211,0.0001568541,0.0005148166,0.0004137508,0.0001415079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006579216,0.0001812092,0.00103324,0.001435448,0.00004259359,0.0004172137,0.0001244268,0.002698706,0.004830055,0.07879386,0.870477,0.03930823],"study_design_scores_gemma":[0.0004763409,0.000149228,0.002792063,0.0002831599,0.00001923317,0.0007142723,0.0001650631,0.01171864,0.009778819,0.1540899,0.819746,0.00006712838],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"dataset","genre_gemma":"dataset","genre_scores_codex":[0.01042175,0.000633907,0.05145041,0.002459485,0.001671405,0.0002881982,0.825102,0.0189857,0.088987],"genre_scores_gemma":[0.1040403,0.001510897,0.04503451,0.001179731,0.0005535491,0.0007257299,0.8018659,0.007698932,0.03739043],"genre_candidate":"dataset","genre_consensus":"dataset","teacher_disagreement_score":0.5220607,"threshold_uncertainty_score":0.6817224,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09568873070373073,"score_gpt":0.2430315538123722,"score_spread":0.1473428231086415,"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."}}