{"id":"https://openalex.org/W48716063","doi":null,"title":"Better gates can make fault-tolerant computation impossible.","display_name":"Better gates can make fault-tolerant computation impossible.","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W48716063","mag":"48716063"},"language":"en","primary_location":{"id":"mag:48716063","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#Unger10","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},"volume":null,"type":"preprint","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067553771","display_name":"Falk Unger","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Falk Unger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5067553771"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":null,"first_page":"164","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6577000021934509,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6577000021934509,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.11100000143051147,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.036400001496076584,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fault-tolerant-computation","display_name":"fault-tolerant computation","score":0.9959999918937683},{"id":"https://openalex.org/keywords/boolean-formulas","display_name":"Boolean formulas","score":0.4620000123977661},{"id":"https://openalex.org/keywords/gate-noise","display_name":"gate noise","score":0.3619999885559082}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7027561664581299},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6085145473480225},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5591513514518738},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5538316965103149},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.48960334062576294},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.44269251823425293},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4422716200351715},{"id":"https://openalex.org/C10418432","wikidata":"https://www.wikidata.org/wiki/Q560370","display_name":"AND gate","level":3,"score":0.4130384922027588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39590805768966675},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.09113073348999023},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08663472533226013},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:48716063","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#Unger10","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1592648576","https://openalex.org/W1656594904","https://openalex.org/W1664437073","https://openalex.org/W1874981471","https://openalex.org/W1963494112","https://openalex.org/W1967313757","https://openalex.org/W1969801393","https://openalex.org/W1981268458","https://openalex.org/W1986575409","https://openalex.org/W1998918799","https://openalex.org/W2014633300","https://openalex.org/W2021885139","https://openalex.org/W2032147770","https://openalex.org/W2035757233","https://openalex.org/W2038435918","https://openalex.org/W2052169397","https://openalex.org/W2054104481","https://openalex.org/W2064369971","https://openalex.org/W2064684330","https://openalex.org/W2077242989","https://openalex.org/W2086652199","https://openalex.org/W2106622045","https://openalex.org/W2115551261","https://openalex.org/W2122502862","https://openalex.org/W2128020755","https://openalex.org/W2137906383","https://openalex.org/W2148533576","https://openalex.org/W2154344146","https://openalex.org/W2157147780","https://openalex.org/W2164716567","https://openalex.org/W2497735908"],"related_works":["https://openalex.org/W2064369971","https://openalex.org/W2107810558","https://openalex.org/W4294549662","https://openalex.org/W7096745853","https://openalex.org/W2164716567","https://openalex.org/W2952994937","https://openalex.org/W4403977139","https://openalex.org/W2106622045","https://openalex.org/W2086652199","https://openalex.org/W2054104481"],"abstract_inverted_index":{"We":[0],"consider":[1],"fault-tolerant":[2,85],"computation":[3,61,86],"with":[4,11,49,73,95,183],"formulas":[5],"composed":[6],"of":[7,22,26,37,161],"noisy":[8],"Boolean":[9],"gates":[10,19,47,71,93,123,182,200],"two":[12],"input":[13],"wires.":[14],"In":[15],"our":[16],"model":[17],"all":[18,46,70,82,92,150,199],"fail":[20,48,72,94],"independently":[21],"each":[23,162],"other":[24,67],"and":[25,77,103],"the":[27,35,38,66,79,97,132,158,169],"input.":[28],"When":[29],"a":[30,142,175,192],"gate":[31,164],"fails,":[32],"it":[33,116],"outputs":[34],"opposite":[36],"correct":[39],"output.":[40],"It":[41],"is":[42,62,78,87,100,130,141,165],"known":[43],"that":[44,91,115,148,198],"if":[45,69,157],"probability":[50,74,99],"at":[51,204],"least":[52],"\u03b22":[53,76,146],"=":[54],"(3\u2212":[55],"\u221a":[56],"7)/4":[57],"\u2248":[58],"8.856%,":[59],"faulttolerant":[60],"not":[63,126,131],"possible.":[64,88],"On":[65],"hand,":[68],"<":[75,145],"same":[80,98],"for":[81],"gates,":[83],"then":[84],"The":[89],"assumption":[90],"exactly":[96],"pretty":[101],"strong":[102],"unrealistic":[104],"in":[105,137,168],"real-world":[106],"scenarios.":[107],"Furthermore,":[108],"one":[109],"might":[110],"be":[111,118,153],"tempted":[112],"to":[113],"think":[114],"can":[117,187,195],"removed":[119],"easily,":[120],"since":[121],"making":[122],"\u201cbetter\u201d":[124],"should":[125],"hurt.":[127],"Surprisingly,":[128],"this":[129,138],"case,":[133],"as":[134],"we":[135],"show":[136],"work:":[139],"there":[140],"constant":[143],"\u03b12":[144,186,206],"such":[147],"almost":[149],"functions":[151],"cannot":[152],"computed":[154],"by":[155],"formulas,":[156],"noise":[159,184,202],"rate":[160,185],"individual":[163],"selected":[166],"adversarially":[167],"range":[170],"[0,":[171],"\u03b12].":[172],"Hence,":[173],"while":[174],"hardware":[176],"manufacturer":[177,193],"who":[178,194],"consistently":[179],"produces":[180],"bad":[181],"always":[188],"achieve":[189],"reliable":[190],"computation,":[191],"only":[196],"ensure":[197],"have":[201],"rates":[203],"most":[205],"cannot.":[207]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}