Ultimate Zero and One: Computing at the Quantum FrontierAs miniaturization deepens, and nanotechnology and its machines become more prevalent in the real world, the need to consider using quantum mechanical concepts to perform various tasks in computation increases. Such talks include: the teleporting of information, breaking heretofore "unbreakable" codes, communicating with messages that betray eavesdropping, and the generation of random munbers. To date, there has been no book written which applies quantum physics to the basic operations of a computer. This one does, thus presenting us with the ideal vehicle for explaining the complexities of quantum mechanics to students, researchers and computer engineers, alike, as they prepare to design and create the computing and information delivery systems for the future. Both authors have solid backgrounds in the subject matter at the theoretical and research level, as well as experience on a more practical plane. While also intended for use as a text for senior/grad level students in computer science/physics/engineering, this book has its primary use as an up-to-date reference work in the emerging interdisciplinary field of quantum computing. It does require knowledge of calculus and familiarity with the concept of the Turing machine. |
Contents
Computing at the Edge of Nature | 1 |
Quantum Computing | 23 |
What Can Computers Do? | 45 |
Breaking Unbreakable Codes | 89 |
The Crapshoot Universe | 117 |
The Keys to Quantum Secrets | 143 |
Teleportation The Ultimate Ticket to Ride | 157 |
Swatting Quantum Bugs | 173 |
GenerationQ Computing Where Do You Want to Go Tomorrow? | 191 |
It Is Now Safe to Turn Off Your Quantum Computer | 217 |
Quantum Technologies in the TwentyFirst Century | 233 |
237 | |
247 | |
Other editions - View all
Ultimate Zero and One: Computing at the Quantum Frontier Colin P. Williams,Scott H. Clearwater Limited preview - 2012 |
Common terms and phrases
1-qubit Alamos preprint archive Alice and Bob amplitude answer atom beam splitter bit string bomb Chapter classical computer classical physics computer science controlled-NOT cryptosystem decrypt deterministic Turing machine digits effect efficiently electron encode encrypted energy entangled example exponential factor function halt Hence horizontal initial input integers interaction-free measurement interactions interferometer Jozsa key pad laser logic mathematical molecule nuclear spins one-time pad operation orientation outcomes output pair particle particular perform photon polarized photons polynomial possible predict prefix-free prime private key probabilistic probability problem public key pulses puter quan quantum algorithm quantum circuit quantum computer Quantum Cryptography quantum gates quantum mechanics quantum memory register quantum parallelism quantum physics quantum system quantum theory quantum Turing machine qubit random numbers Register1 result rotation scheme sequence Shor's algorithm simulate solve step superposition tape teleportation tion vertical Walsh-Hadamard gate