¿Ü±¹µµ¼
ÄÄÇ»ÅÍ
ÀÎÅͳÝ/À¥ °³¹ß
2013³â 9¿ù 9ÀÏ ÀÌÈÄ ´©Àû¼öÄ¡ÀÔ´Ï´Ù.
Á¤°¡ |
96,960¿ø |
---|
96,960¿ø
2,910P (3%Àû¸³)
ÇÒÀÎÇýÅÃ | |
---|---|
Àû¸³ÇýÅà |
|
|
|
Ãß°¡ÇýÅÃ |
|
À̺¥Æ®/±âȹÀü
¿¬°üµµ¼(1)
»óÇ°±Ç
ÀÌ»óÇ°ÀÇ ºÐ·ù
¸ñÂ÷
Preface | p. x |
Acknowledgements | p. xi |
Introduction and Background | p. 1 |
Overview | p. 1 |
Computers and the Strong Church-Turing Thesis | p. 2 |
The Circuit Model of Computation | p. 6 |
A Linear Algebra Formulation of the Circuit Model | p. 8 |
Reversible Computation | p. 12 |
A Preview of Quantum Physics | p. 15 |
Quantum Physics and Computation | p. 19 |
Linear Algebra and the Dirac Notation | p. 21 |
The Dirac Notation and Hilbert Spaces | p. 21 |
Dual Vectors | p. 23 |
Operators | p. 27 |
The Spectral Theorem | p. 30 |
Functions of Operators | p. 32 |
Tensor Products | p. 33 |
The Schmidt Decomposition Theorem | p. 35 |
Some Comments on the Dirac Notation | p. 37 |
Qubits and the Framework of Quantum Mechanics | p. 38 |
The State of a Quantum System | p. 38 |
Time-Evolution of a Closed System | p. 43 |
Composite Systems | p. 45 |
Measurement | p. 48 |
Mixed States and General Quantum Operations | p. 53 |
Mixed States | p. 53 |
Partial Trace | p. 56 |
General Quantum Operations | p. 59 |
A Quantum Model of Computation | p. 61 |
The Quantum Circuit Model | p. 61 |
Quantum Gates | p. 63 |
1-Qubit Gates | p. 63 |
Controlled-U Gates | p. 66 |
Universal Sets of Quantum Gates | p. 68 |
Efficiency of Approximating Unitary Transformations | p. 71 |
Implementing Measurements with Quantum Circuits | p. 73 |
Superdense Coding and Quantum Teleportation | p. 78 |
Superdense Coding | p. 79 |
Quantum Teleportation | p. 80 |
An Application of Quantum Teleportation | p. 82 |
Introductory Quantum Algorithms | |
Probabilistic Versus Quantum Algorithms | p. 86 |
Phase Kick-Back | p. 91 |
The Deutsch Algorithm | p. 94 |
The Deutsch-Jozsa Algorithm | p. 99 |
Simon's Algorithm | p. 103 |
Algorithms with Superpolynomial Speed-Up | p. 110 |
Quantum Phase Estimation and the Quantum Fourier Transform | p. 110 |
Error Analysis for Estimating Arbitrary Phases | p. 117 |
Periodic States | p. 120 |
GCD, LCM, the Extended Euclidean Algorithm | p. 124 |
Eigenvalue Estimation | p. 125 |
Finding-Orders | p. 130 |
The Order-Finding Problem | p. 130 |
Some Mathematical Preliminaries | p. 131 |
The Eigenvalue Estimation Approach to Order Finding | p. 134 |
Shor's Approach to Order Finding | p. 139 |
Finding Discrete Logarithms | p. 142 |
Hidden Subgroups | p. 146 |
More on Quantum Fourier Transforms | p. 147 |
Algorithm for the Finite Abelian Hidden Subgroup Problem | p. 149 |
Related Algorithms and Techniques | p. 151 |
Algorithms Based on Amplitude Amplification | p. 152 |
Grover's Quantum Search Algorithm | p. 152 |
Amplitude Amplification | p. 163 |
Quantum Amplitude Estimation and Quantum Counting | p. 170 |
Searching Without Knowing the Success Probability | p. 175 |
Related Algorithms and Techniques | p. 178 |
Quantum Computational Complexity Theory and Lower Bounds | p. 179 |
Computational Complexity | p. 180 |
Language Recognition Problems and Complexity Classes | p. 181 |
The Black-Box Model | p. 185 |
State Distinguishability | p. 187 |
Lower Bounds for Searching in the Black-Box Model: Hybrid Method | p. 188 |
General Black-Box Lower Bounds | p. 191 |
Polynomial Method | p. 193 |
Applications to Lower Bounds | p. 194 |
Examples of Polynomial Method Lower Bounds | p. 196 |
Block Sensitivity | p. 197 |
Examples of Block Sensitivity Lower Bounds | p. 197 |
Adversary Methods | p. 198 |
Examples of Adversary Lower Bounds | p. 200 |
Generalizations | p. 203 |
Quantum Error Correction | p. 204 |
Classical Error Correction | p. 204 |
The Error Model | p. 205 |
Encoding | p. 206 |
Error Recovery | p. 207 |
The Classical Three-Bit Code | p. 207 |
Fault Tolerance | p. 211 |
Quantum Error Correction | p. 212 |
Error Models for Quantum Computing | p. 213 |
Encoding | p. 216 |
Error Recovery | p. 217 |
Three- and Nine-Qubit Quantum Codes | p. 223 |
The Three-Qubit Code for Bit-Flip Errors | p. 223 |
The Three-Qubit Code for Phase-Flip Errors | p. 225 |
Quantum Error Correction Without Decoding | p. 226 |
The Nine-Qubit Shor Code | p. 230 |
Fault-Tolerant Quantum Computation | p. 234 |
Concatenation of Codes and the Threshold Theorem | p. 237 |
p. 241 | |
Tools for Analysing Probabilistic Algorithms | p. 241 |
Solving the Discrete Logarithm Problem When the Order of a Is Composite | p. 243 |
How Many Random Samples Are Needed to Generate a Group? | p. 245 |
Finding r Given k/r for Random k | p. 247 |
Adversary Method Lemma | p. 248 |
Black-Boxes for Group Computations | p. 250 |
Computing Schmidt Decompositions | p. 253 |
General Measurements | p. 255 |
Optimal Distinguishing of Two States | p. 258 |
A Simple Procedure | p. 258 |
Optimality of This Simple Procedure | p. 258 |
Bibliography | p. 260 |
Index | p. 270 |
Table of Contents provided by Ingram. All Rights Reserved. |
Ã¥¼Ò°³
The authors provide an introduction to quantum computing. Aimed at advanced undergraduate and beginning graduate students in these disciplines, this text is illustrated with diagrams and exercises.
ÀúÀÚ¼Ò°³
»ý³â¿ùÀÏ | - |
---|
ÇØ´çÀÛ°¡¿¡ ´ëÇÑ ¼Ò°³°¡ ¾ø½À´Ï´Ù.
ÁÖ°£·©Å·
´õº¸±â»óÇ°Á¤º¸Á¦°ø°í½Ã
À̺¥Æ® ±âȹÀü
ÄÄÇ»ÅÍ ºÐ¾ß¿¡¼ ¸¹Àº ȸ¿øÀÌ ±¸¸ÅÇÑ Ã¥
ÆǸÅÀÚÁ¤º¸
»óÈ£ |
(ÁÖ)±³º¸¹®°í |
---|---|
´ëÇ¥ÀÚ¸í |
¾Èº´Çö |
»ç¾÷ÀÚµî·Ï¹øÈ£ |
102-81-11670 |
¿¬¶ôó |
1544-1900 |
ÀüÀÚ¿ìÆíÁÖ¼Ò |
callcenter@kyobobook.co.kr |
Åë½ÅÆǸž÷½Å°í¹øÈ£ |
01-0653 |
¿µ¾÷¼ÒÀçÁö |
¼¿ïƯº°½Ã Á¾·Î±¸ Á¾·Î 1(Á¾·Î1°¡,±³º¸ºôµù) |
±³È¯/ȯºÒ
¹ÝÇ°/±³È¯ ¹æ¹ý |
¡®¸¶ÀÌÆäÀÌÁö > Ãë¼Ò/¹ÝÇ°/±³È¯/ȯºÒ¡¯ ¿¡¼ ½Åû ¶Ç´Â 1:1 ¹®ÀÇ °Ô½ÃÆÇ ¹× °í°´¼¾ÅÍ(1577-2555)¿¡¼ ½Åû °¡´É |
---|---|
¹ÝÇ°/±³È¯°¡´É ±â°£ |
º¯½É ¹ÝÇ°ÀÇ °æ¿ì Ãâ°í¿Ï·á ÈÄ 6ÀÏ(¿µ¾÷ÀÏ ±âÁØ) À̳»±îÁö¸¸ °¡´É |
¹ÝÇ°/±³È¯ ºñ¿ë |
º¯½É ȤÀº ±¸¸ÅÂø¿À·Î ÀÎÇÑ ¹ÝÇ°/±³È¯Àº ¹Ý¼Û·á °í°´ ºÎ´ã |
¹ÝÇ°/±³È¯ ºÒ°¡ »çÀ¯ |
·¼ÒºñÀÚÀÇ Ã¥ÀÓ ÀÖ´Â »çÀ¯·Î »óÇ° µîÀÌ ¼Õ½Ç ¶Ç´Â ÈÑ¼ÕµÈ °æ¿ì ·¼ÒºñÀÚÀÇ »ç¿ë, Æ÷Àå °³ºÀ¿¡ ÀÇÇØ »óÇ° µîÀÇ °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì ·º¹Á¦°¡ °¡´ÉÇÑ »óÇ° µîÀÇ Æ÷ÀåÀ» ÈѼÕÇÑ °æ¿ì ·½Ã°£ÀÇ °æ°ú¿¡ ÀÇÇØ ÀçÆǸŰ¡ °ï¶õÇÑ Á¤µµ·Î °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì ·ÀüÀÚ»ó°Å·¡ µî¿¡¼ÀÇ ¼ÒºñÀÚº¸È£¿¡ °üÇÑ ¹ý·üÀÌ Á¤ÇÏ´Â ¼ÒºñÀÚ Ã»¾àöȸ Á¦ÇÑ ³»¿ë¿¡ ÇØ´çµÇ´Â °æ¿ì |
»óÇ° Ç°Àý |
°ø±Þ»ç(ÃâÆÇ»ç) Àç°í »çÁ¤¿¡ ÀÇÇØ Ç°Àý/Áö¿¬µÉ ¼ö ÀÖÀ½ |
¼ÒºñÀÚ ÇÇÇغ¸»ó |
·»óÇ°ÀÇ ºÒ·®¿¡ ÀÇÇÑ ±³È¯, A/S, ȯºÒ, Ç°Áúº¸Áõ ¹× ÇÇÇغ¸»ó µî¿¡ °üÇÑ »çÇ×Àº¼ÒºñÀÚºÐÀïÇØ°á ±âÁØ (°øÁ¤°Å·¡À§¿øȸ °í½Ã)¿¡ ÁØÇÏ¿© ó¸®µÊ ·´ë±Ý ȯºÒ ¹× ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó±Ý Áö±Þ Á¶°Ç, ÀýÂ÷ µîÀº ÀüÀÚ»ó°Å·¡ µî¿¡¼ÀǼҺñÀÚ º¸È£¿¡ °üÇÑ ¹ý·ü¿¡ µû¶ó ó¸®ÇÔ |
(ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º´Â ȸ¿ø´ÔµéÀÇ ¾ÈÀü°Å·¡¸¦ À§ÇØ ±¸¸Å±Ý¾×, °áÁ¦¼ö´Ü¿¡ »ó°ü¾øÀÌ (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º¸¦ ÅëÇÑ ¸ðµç °Å·¡¿¡ ´ëÇÏ¿©
(ÁÖ)KGÀ̴Ͻýº°¡ Á¦°øÇÏ´Â ±¸¸Å¾ÈÀü¼ºñ½º¸¦ Àû¿ëÇÏ°í ÀÖ½À´Ï´Ù.
¹è¼Û¾È³»
±³º¸¹®°í »óÇ°Àº Åùè·Î ¹è¼ÛµÇ¸ç, Ãâ°í¿Ï·á 1~2Àϳ» »óÇ°À» ¹Þ¾Æ º¸½Ç ¼ö ÀÖ½À´Ï´Ù.
Ãâ°í°¡´É ½Ã°£ÀÌ ¼·Î ´Ù¸¥ »óÇ°À» ÇÔ²² ÁÖ¹®ÇÒ °æ¿ì Ãâ°í°¡´É ½Ã°£ÀÌ °¡Àå ±ä »óÇ°À» ±âÁØÀ¸·Î ¹è¼ÛµË´Ï´Ù.
±ººÎ´ë, ±³µµ¼Ò µî ƯÁ¤±â°üÀº ¿ìü±¹ Åù踸 ¹è¼Û°¡´ÉÇÕ´Ï´Ù.
¹è¼Ûºñ´Â ¾÷ü ¹è¼Ûºñ Á¤Ã¥¿¡ µû¸¨´Ï´Ù.