Introduction to Quantum Algorithms via Linear Algebra, second editionMIT Press, 06.04.2021 - 280 Seiten Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics. This introduction to quantum algorithms is concise but comprehensive, covering many key algorithms. It is mathematically rigorous but requires minimal background and assumes no knowledge of quantum theory or quantum mechanics. The book explains quantum computation in terms of elementary linear algebra; it assumes the reader will have some familiarity with vectors, matrices, and their basic properties, but offers a review of the relevant material from linear algebra. By emphasizing computation and algorithms rather than physics, it makes quantum algorithms accessible to students and researchers in computer science who have not taken courses in quantum physics or delved into fine details of quantum effects, apparatus, circuits, or theory. |
Inhalt
Introduction | 3 |
Numbers and Strings | 11 |
Basic Linear Algebra | 17 |
Boolean Functions Quantum Bits and Feasibility | 31 |
Special Matrices | 49 |
Contents ix | 59 |
Tricks | 61 |
Phils Algorithm | 73 |
Factoring Integers | 119 |
Physics of Quantum Computing | 131 |
Phase Estimation and Approximate Counting | 169 |
Quantum Walks | 177 |
Quantum Walk Search Algorithms | 189 |
Quantum Matrix Algorithms | 205 |
Quantum Computation and BQP | 225 |
Beyond | 243 |
Deutschs Algorithm | 87 |
The DeutschJozsa Algorithm | 99 |
Shors Algorithm | 107 |
| 249 | |
| 257 | |
Andere Ausgaben - Alle anzeigen
Introduction to Quantum Algorithms via Linear Algebra, second edition Richard J. Lipton,Kenneth W. Regan Eingeschränkte Leseprobe - 2021 |
Introduction to Quantum Algorithms via Linear Algebra, second edition Richard J. Lipton,Kenneth W. Regan Keine Leseprobe verfügbar - 2021 |
Häufige Begriffe und Wortgruppen
a₁ Alice and Bob Alice's amplitude analysis angle Anti-Phil applying the Hadamard basic Bloch sphere Boolean function Boolean strings cancel chapter cheese CHSH game classical random CNOT coin complex numbers constant defined definition Deutsch's algorithm Dirac notation eigenvalue entangled entries equation exponential factor feasible filter flip function f gives Grover oracle Grover's algorithm Hadamard gates Hadamard matrix Hadamard transform Hence Hilbert space initial input integer iteration label lemma linear algebra maze measurement modulo multiplication nodes nonzero operations outcome outer products output path permutation Phil polynomial Proof quantum algorithms quantum circuit quantum computation quantum coordinates quantum Fourier transform quantum walk qubit qubit line random walk rotation Shor's algorithm Show Simon's algorithm simulate sin² solution square step success probability Summary and Notes Suppose swap tensor product theorem Toffoli gate trick two-qubit unit vector unitary matrix x₁