Price
specifications: [[item.skuinfo]]
price: [[item.currency]][[item.price]]
This introduction to quantum computing from a classical programmer's perspective is intended for both students and practitioners. Developed from the ground up in Python and C++, an open-source code base is used to explain over 25 fundamental algorithms with full mathematical derivations and classical code for simulation. Beginning with the basics of quantum computing, the author focuses on algorithms and the infrastructure to simulate them efficiently, starting with quantum teleportation, superdense coding, and Deutsch-Jozsa. Coverage of advanced algorithms includes the quantum supremacy experiment, quantum Fourier transform, phase estimation, Shor's algorithm, Grover's algorithm with derivatives, quantum random walks, and the Solovay–Kitaev algorithm for gate approximation. Quantum simulation is explored with the variational quantum eigensolver, quantum approximate optimization, and the Max-Cut and Subset-Sum algorithms. The book also discusses issues around programmer productivity, quantum noise, error correction, and challenges for quantum programming languages, compilers, and tools, with a final section on compiler techniques for transpilation.
product information:
Attribute | Value | ||||
---|---|---|---|---|---|
publisher | Cambridge University Press; New edition (March 31, 2022) | ||||
language | English | ||||
hardcover | 350 pages | ||||
isbn_10 | 1009098179 | ||||
isbn_13 | 978-1009098175 | ||||
item_weight | 1.65 pounds | ||||
dimensions | 6.5 x 1 x 9.5 inches | ||||
best_sellers_rank | #332,181 in Books (See Top 100 in Books) #30 in Artificial Intelligence (Books) #527 in Artificial Intelligence & Semantics #10,610 in Unknown | ||||
customer_reviews |
|