
How To Code For Quantum Computers
By Nivio Dos SantosLength2h 18m
About this audiobook
As quantum computing rapidly evolves, professionals and tech enthusiasts are seeking ways to stay ahead of the curve. Traditional programming knowledge isn't enough, and understanding quantum computing concepts is becoming essential for future tech leaders. However, many find learning quantum computing intimidating due to its complexity, lack of clear resources, and steep learning curve. Existing materials are either too theoretical or overly technical, making it difficult to get started. Without the right guide, aspiring developers risk falling behind in a field that will soon revolutionize industries. Missing out on understanding quantum programming could mean losing competitive advantage in tech-driven careers. How to code for Quantum Computers offers a clear, step-by-step approach, breaking down complex concepts into manageable, practical examples. With Cirq code examples and hands-on projects, this book empowers readers to master quantum programming, opening doors to cutting-edge opportunities and career advancements, it do this using three classic algorithms, Deutsch–Jozsa, Grover, and Shor as a foundation for study, along with the famous quantum teleportation protocol, taking care of starting from basic concepts such as qubits and gates and circuit. The complete source codes for sample programs using Cirq from Google Research and Python on Jupyter Notebook are available in a public Bitbucket repository.
Audiobook details
GenreTechnology
Length2 hrs 18 mins
Narrated byListen with 1,000+ voices
FormateBook with Audio
Publish dateOct 20, 2024
LanguageEnglish
Table of contents
1First Edition
56Scenario when f(x) is a constant function.
2Introduction to Quantum Computing
57Scenario when f(x) is a balanced function.
3Required background
58Conclusion
4Code examples: Cirq
59Grover algorithm
5The illustration
60Algorithm Summary
Show all chaptersShow less
6Conventional Bit vs Qubit
61Understanding the algorithm
7Double-slit experiment
62Let's start with the problem definition
8Bra Ket Notation
63Additional Definitions
9Probabilities: What Are Complex Numbers?
64Starting algorithm analysis
10Why are amplitudes complex Numbers?: Quick view in a Qubit
65Initializing
11What more?
66Oracle phase flip
12Real-Valued vs. Complex-Valued Quantum Theories
67Grover Diffusion Operator
13Quantum Entanglement
68Conclusion
14Entanglement Exchange Experiment
69Shor Algorithm I
15Navascués' Proposal
70Fundamental mathematics
16Conclusion about Complex Numbers
71The structure of our algorithm
17Unitary matrix
72The quantum portion of our algorithm
18Visual representation
73Quantum Fourier Transform
19Bloch Sphere: Where does this equation come from?
74Discrete Fourier Transform (DFT)
20Circle Notation: Circle Notation for multi-Qubit scenarios
75Quantum Fourier Transform (QFT)
21Choosing the Right Tool
76Quantum Fourier Transform Circuit
22Qubits and Quantum Gates
77Exemplifying QFT with 1 Qubit
23Basic Gates with a single Qubit
78Exemplifying QFT with 2 Qubits
24The Identity Gate
79Exemplifying QFT with 4 Qubits
25Pauli Gates - Pauli X
80Conclusion
26Pauli Gates - Pauli Y
81Quantum Phase Estimation
27Pauli Gates - Pauli Z
82Concept
28Hadamard Gate
83Phase Representation
29Phase Gate
84Quantum phase estimation
30RXGate
85The quantum phase estimation circuit example
31RYGate
86Conclusion
32Read/Measurement
87Shor Algorithm II
33Get down to business:
88From QPE to Order Finding
34Notation used with Google Cirq
89QPE
35Code example to achieve a specific state |Ψ>
90Order-finding
36Gates for Multiple Qubits
91Explaining the operator Ux = |gx mod N>
37CNOT Gate
92Using the operator Ux = |gx mod N>
38Bell State
93Example of Shor's Algorithm: N = 15, g = 7
39Investigating |Θ+> Bell state
94Building Ux = |7x mod 15>
40Toffoli - CCNOT
95Analyzing Order Finding for N=15 and g = 7
41CPhase and CZ: Phase KickBack
96Applying the invQFT operation
42SWAP
97For those curious, where is e2π i j/2 ?
43Combining Gates
98Conclusion
44Quantum Teleportation
99Concluding thoughts
45Short fictional story: The Teleportation Process
100We're off and running, now what?
46The Math Behind this Quantum Teleportation
101My Inspiration
47Sending/modulating
102It's time to say see you later
48Receiving/demodulating
103Appendix
49Conclusion
104XOR - ⊕
50Deutsch–Jozsa algorithm
105The notation X ∈ {0,1}n: Exemplifying
51Steps of the algorithm:
106HAD|X>´s alternative mathematical expression: Exemplifying
52Algorithm examples
107Sum of the bitwise product: Exemplifying
53Balanced function with 3 Qubits (n=3)
108Grover’s Oracle Flip Phase
54Constant function with 3 Qubits (n=3)
109Number of Grover’s Iterations: GCD Euclidean algorithm
55The Math Behind Deutsch–Jozsa algorithm
110Unitarity of the QFT