000			01958nam a22002297a 4500
008			240115s2022 |||||||| |||| 00| 0 eng d
020			_a9781009098175
022			_l9781009098175
041			_aeng
082			_a006.3843 _bHUN
100			_aHundt, Robert _9842484 _eAU
245			_aQuantum Computing for Programmers
260			_aCambridge : _bCambridge University Press, _cc2022
300			_axiii, 360 p. _b: ill
504			_aYY
520			_aSUMMARY This introduction to quantum computing from a classical programmer's perspective is meant for students and practitioners alike. Over 25 fundamental algorithms are explained with full mathematical derivations and classical code for simulation, using an open-source code base developed from the ground up in Python and C . After presenting the basics of quantum computing, the author focuses on algorithms and the infrastructure to simulate them efficiently, beginning 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.
650		0	_aQuantum computing _9662435
650		0	_aBasic Computers _9879948
856			_yTOC _uhttps://eaklibrary.neduet.edu.pk:8443/catalog/bk/books/toc/9781009098175.pdf
856			_yWEB LINK _uhttps://www.vitalsource.com/products/quantum-computing-for-programmers-robert-hundt-v9781009103206
942			_2ddc _cBOO
999			_c814566 _d814566