{"id":"W1643360887","doi":"10.26421/qic8.3-4-7","title":"Universal fault tolerant quantum computation on bilinear nearest neighbor arrays","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Qubit; Quantum circuit; Word error rate; Upper and lower bounds; Quantum; Computation; Quantum error correction; Fault tolerance; Computer science; Algorithm; Mathematics; Topology (electrical circuits); Physics; Quantum mechanics; Combinatorics; Mathematical analysis","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.0005553314,0.0001981952,0.0005665295,0.0003234204,0.0005741133,0.0007635684,0.0007841603,0.0005984317,0.002435879],"category_scores_gemma":[0.003400778,0.0001744467,0.0002649851,0.0003785708,0.001422862,0.001758124,0.001683546,0.0007971624,0.0003237965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006107987,"about_ca_system_score_gemma":0.0003680662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005189066,"about_ca_topic_score_gemma":0.0004944722,"domain_scores_codex":[0.9992499,0.000196482,0.00004038176,0.00009783312,0.0002485109,0.0001669278],"domain_scores_gemma":[0.9980102,0.0009712182,0.0002732445,0.0004209472,0.0002015519,0.0001228627],"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.0003518732,0.0001011059,0.0008283484,0.00008321533,0.00002006169,0.0002690438,0.0002225059,0.4012004,0.0231208,0.5500052,0.001019526,0.02277796],"study_design_scores_gemma":[0.00001766929,0.00005855018,0.0001240094,0.000006276322,0.000003480932,0.00004692102,0.00002136139,0.886502,0.008907256,0.1037444,0.000553676,0.00001435934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4978895,0.0001718208,0.4860601,0.0004328872,0.00007843506,0.00005706435,0.00008066111,0.0006270327,0.01460255],"genre_scores_gemma":[0.9766583,0.00004573847,0.02148889,0.00004832149,0.00001398676,0.00003048967,0.00002596524,0.00001995148,0.001668373],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002435879,"threshold_uncertainty_score":0.008148849,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01440491895055201,"score_gpt":0.234745910412612,"score_spread":0.22034099146206,"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."}}