{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002571266,0.0002933214,0.000268335,0.0004045904,0.0007049906,0.0003163281,0.0003223829,0.0001145842,0.000004723705],"category_scores_gemma":[0.0000462745,0.0002689436,0.00008666405,0.0006091085,0.0001069747,0.001521659,0.0001190771,0.0003039663,0.0001459986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006185126,"about_ca_system_score_gemma":0.000135737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006889177,"about_ca_topic_score_gemma":0.000001784909,"domain_scores_codex":[0.998048,0.0001168399,0.0005941178,0.0003462153,0.0005462987,0.0003485438],"domain_scores_gemma":[0.9987912,0.0002039698,0.000332681,0.000241889,0.0002518958,0.0001783277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007421629,0.0001321644,0.0001495709,0.00006267396,0.00002923569,0.0000269205,0.007527675,0.7461613,0.00005515241,0.09851101,0.001764633,0.1455054],"study_design_scores_gemma":[0.001000994,0.0004428229,0.005273223,0.00004728891,0.000005274625,0.000137721,0.000190657,0.9867711,0.0000689691,0.002799217,0.002926712,0.0003360284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.34783,0.00002415012,0.6495168,0.001224425,0.0004661597,0.0002171439,0.000007192023,0.0003564906,0.0003576865],"genre_scores_gemma":[0.9802517,0.00003090681,0.0185079,0.0009628851,0.0001053623,0.000006223057,0.0001113979,0.00001239138,0.00001120118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6324217,"threshold_uncertainty_score":0.9999763,"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."}}