HOME > Detail View

Detail View

Introduction to classical and quantum computing

Introduction to classical and quantum computing (Loan 1 times)

Material type
단행본
Personal Author
Wong, Thomas G.
Title Statement
Introduction to classical and quantum computing / Thomas G. Wong.
Publication, Distribution, etc
Omaha, Nebraska :   Rooted Grove,   2022.  
Physical Medium
xii, 388 p. : ill. ; 23 cm.
ISBN
9798985593105 (pbk.)
Bibliography, Etc. Note
Includes bibliographical references and index.
Subject Added Entry-Topical Term
Quantum computing.
000 00000nam u2200205 a 4500
001 000046116817
005 20220531154221
008 220525s2022 nbua b 001 0 eng d
020 ▼a 9798985593105 (pbk.)
040 ▼a 211009 ▼c 211009 ▼d 211009
082 0 4 ▼a 006.3/843 ▼2 23
084 ▼a 006.3843 ▼2 DDCK
090 ▼a 006.3843 ▼b W872i
100 1 ▼a Wong, Thomas G.
245 1 0 ▼a Introduction to classical and quantum computing / ▼c Thomas G. Wong.
260 ▼a Omaha, Nebraska : ▼b Rooted Grove, ▼c 2022.
300 ▼a xii, 388 p. : ▼b ill. ; ▼c 23 cm.
504 ▼a Includes bibliographical references and index.
650 0 ▼a Quantum computing.
945 ▼a ITMT

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Main Library/Western Books/ Call Number 006.3843 W872i Accession No. 111867566 Availability In loan Due Date 2022-11-02 Make a Reservation Available for Reserve R Service M
No. 2 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 006.3843 W872i Accession No. 121260100 Availability Available Due Date Make a Reservation Service B M
No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Main Library/Western Books/ Call Number 006.3843 W872i Accession No. 111867566 Availability In loan Due Date 2022-11-02 Make a Reservation Available for Reserve R Service M
No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 006.3843 W872i Accession No. 121260100 Availability Available Due Date Make a Reservation Service B M

Contents information

Book Introduction

Introduction to Classical and Quantum Computing is for students who want to learn quantum computing beyond a conceptual level, but who lack advanced training in mathematics. The only prerequisite is trigonometry, and mathematics beyond that will be covered, including linear algebra. This book is suitable as a course textbook or for independent study.

The text begins with a significant overview of classical computing, from how they add numbers to their computational limits, and it mirrors many of the quantum computing topics that are covered later. Then, the investigation of quantum computing begins with a single qubit and quantum gates acting on it, first using geometry and elementary algebra, and later using linear algebra. Computer algebra systems are utilized, and code for both Mathematica and SageMath is included. After one qubit, multi-qubit systems are covered, including how quantum computers add numbers, universal gate sets, and error correction. After this, readers learn how to program quantum circuits on actual quantum processors using IBM Quantum Experience. Afterward, entanglement and quantum protocols are explored. Finally, quantum algorithms are examined, culminating in Shor's algorithm for factoring. Abundant use of the Quirk quantum simulator is used throughout. Finally, a short discussion of careers in quantum computing is provided, along with some possible technical topics to learn next.


Information Provided By: : Aladin

Table of Contents

1 Classical Information and Computation

1.1 Bits
1.2 Logic Gates
1.3 Adders and Verilog
1.4 Circuit Simplification and Boolean Algebra
1.5 Reversible Logic Gates
1.6 Error Correction
1.7 Computational Complexity
1.8 Turing Machines
1.9 Summary

2 One Quantum Bit
2.1 Qubit Touchdown : A Quantum Computing Board Game
2.2 Superposition
2.3 Measurement
2.4 Bloch Sphere Mapping
2.5 Physical Qubits
2.6 Quantum Gates
2.7 Quantum Circuits
2.8 Summary

3 Linear Algebra
3.1 Quantum States
3.2 Inner Products
3.3 Quantum Gates
3.4 Outer Products
3.5 Summary

4. Multiple Quantum Bits
4.1 Entanglion: A Quantum Computing Board Game
4.2 States and Measurement
4.3 Entanglement
4.4 Quantum Gates
4.5 Quantum Adders
4.6 Universal Quantum Gates
4.7 Quantum Error Correction
4.8 Summary

5 Quantum Programming
5.1 IBM Quantum Experience
5.2 Quantum Assembly Language
5.3 Qiskit
5.4 Other Quantum Programming Languages
5.5 Summay

6 Entanglement and Quantum Protocols
6.1 Measurements
6.2 Bell Inequalities
6.3 Monogamy of Entanglement
6.4 Superdense Coding
6.5 Quantum Teleportation
6.6 Quantum Ket Distribution
6.7 Summary

7 Quantum Algorithms
7.1 Circuit vs Query Complexity
7.2 Parity
7.3 Constant cs BalancedFunctions
7.4 Secret Dot Product String
7.5 Secret XOR Mask
7.6 Brute-Force Searching
7.7 Discrete Fourier Transform
7.8 Phase / Eigenvalue Estimation
7.9 period of Modular Exponentiation
7.10 Factoring
7.11 Summary

8 Next Step
8.1 Careers in Quantum Computing
8.2 Technical Next Steps
8.3 Questions
8.4 Parting Words

Answers to Exercises

Index

New Arrivals Books in Related Fields

Alexopoulos, Panos (2022)