{"id":"W3100707651","doi":"10.1103/prxquantum.2.040345","title":"Fault-Tolerant Qubit from a Constant Number of Components","year":2021,"lang":"en","type":"preprint","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Australian Research Council; Canadian Institute for Advanced Research; Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley; Simons Foundation; National Science Foundation","keywords":"Quantum computer; Quantum error correction; Qubit; Computer science; Fault tolerance; Computation; Coherence time; Error detection and correction; Coherence (philosophical gambling strategy); Overhead (engineering); Quantum; Algorithm; Topology (electrical circuits); Quantum mechanics; Physics; Mathematics; Distributed computing","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003610305,0.0005779666,0.001116642,0.000129234,0.0001418553,0.0003776715,0.002336201,0.0003636318,0.00009247708],"category_scores_gemma":[0.00007042901,0.0005365888,0.000458149,0.0003272119,0.0001686022,0.0001174842,0.004080378,0.001233331,0.00005741745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006053095,"about_ca_system_score_gemma":0.0004204254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001700008,"about_ca_topic_score_gemma":0.00002104351,"domain_scores_codex":[0.9959431,0.0003295164,0.0009441791,0.001349899,0.0008504289,0.0005828625],"domain_scores_gemma":[0.9965224,0.0003529091,0.0006780417,0.001934387,0.0002926579,0.0002195756],"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.0004976263,0.009632523,0.03349734,0.005943791,0.006999344,0.007663847,0.07561628,0.1653235,0.04192796,0.3756376,0.01057174,0.2666884],"study_design_scores_gemma":[0.0005843288,0.00003729443,0.003036198,0.00102642,0.00004362414,0.00006712379,0.00006762928,0.9538919,0.001257669,0.03817787,0.001104649,0.0007052975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7200986,0.001153452,0.2736996,0.0006979315,0.003016466,0.0003225383,0.0001423764,0.0002848116,0.0005842585],"genre_scores_gemma":[0.9206938,0.00007031899,0.0785139,0.0002429015,0.0002340356,0.00002091982,0.0001461529,0.0000406794,0.00003728993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7885684,"threshold_uncertainty_score":0.9997086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0203825415793998,"score_gpt":0.2630896423541278,"score_spread":0.242707100774728,"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."}}