The race is directly to build the 1st quantum code breaker, because the winner will carry the foremost to the complete net. From foreign, multibillion-dollar monetary transactions to top-secret executive communications, all will be liable to the secret-code-breaking skill of the quantum machine.

Written through a well known quantum physicist heavily interested by the U.S. government’s improvement of quantum details technological know-how, Schrödinger’s Killer App: Race to construct the World’s First Quantum Computer offers an within examine the government’s quest to construct a quantum desktop able to fixing complicated mathematical difficulties and hacking the public-key encryption codes used to safe the net. The "killer program" refers to Shor’s quantum factoring set of rules, which might unveil the encrypted communications of the total net if a quantum laptop may be outfitted to run the set of rules. Schrödinger’s suggestion of quantum entanglement—and his notorious cat—is on the middle of it all.

The e-book develops the idea that of entanglement within the old context of Einstein’s 30-year conflict with the physics neighborhood over the real which means of quantum conception. It discusses the therapy to the possibility posed by means of the quantum code breaker: quantum cryptography, that's unbreakable even through the quantum desktop. the writer additionally covers purposes to different vital components, equivalent to quantum physics simulators, synchronized clocks, quantum se's, quantum sensors, and imaging units. furthermore, he is taking readers on a philosophical trip that considers the longer term ramifications of quantum technologies.

Interspersed with a laugh and private anecdotes, this booklet offers quantum computing and the heavily hooked up foundations of quantum mechanics in an interesting demeanour obtainable to non-specialists. Requiring no formal education in physics or complex arithmetic, it explains tricky issues, together with quantum entanglement, Schrödinger’s cat, Bell’s inequality, and quantum computational complexity, utilizing uncomplicated analogies.