Work

Better gates can make fault-tolerant computation impossible.

Year: 2010

Type: preprint

Source: Electronic colloquium on computational complexity

Author: Falk Unger

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W48716063

Cites: 31

Cited by: 4

Related to: 10