๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Error-resilient DNA computation
โœ Richard M. Karp; Claire Kenyon; Orli Waarts ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 212 KB

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

Quantum Computation
โœ NORMAN MARGOLUS ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 548 KB
Quantum computation
โœ Apoorva Patel ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Indian Academy of Sciences ๐ŸŒ English โš– 368 KB
Quantum computation
๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Foundation Books ๐ŸŒ English โš– 553 KB

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