Resilient Quantum Computation
โ Scribed by Knill, E.
- Book ID
- 121158919
- Publisher
- American Association for the Advancement of Science
- Year
- 1998
- Tongue
- English
- Weight
- 434 KB
- Volume
- 279
- Category
- Article
- ISSN
- 0036-8075
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The DNA model of computation, with test tubes of DNA molecules encoding bit sequences, is based on three primitives: Extract-A-Bit, which splits a test tube into two test tubes according to the value of a particular bit x, Merge-Two-Tubes, and Detect-Emptiness. If perfect, these operations can test
The review begins with background on theoretical computer science, Turing machines and Boolean circuits. In light of these models, I define quantum computers, and discuss the issue of universal quantum gates. Quantum algorithms, including Shor's factorization algorithm and Grover's algorithm for sea