°£Æí°áÁ¦, ½Å¿ëÄ«µå û±¸ÇÒÀÎ
ÀÎÅÍÆÄÅ© ·Ôµ¥Ä«µå 5% (92,120¿ø)
(ÃÖ´ëÇÒÀÎ 10¸¸¿ø / Àü¿ù½ÇÀû 40¸¸¿ø)
ºÏÇǴϾð ·Ôµ¥Ä«µå 30% (67,880¿ø)
(ÃÖ´ëÇÒÀÎ 3¸¸¿ø / 3¸¸¿ø ÀÌ»ó °áÁ¦)
NH¼îÇÎ&ÀÎÅÍÆÄÅ©Ä«µå 20% (77,570¿ø)
(ÃÖ´ëÇÒÀÎ 4¸¸¿ø / 2¸¸¿ø ÀÌ»ó °áÁ¦)
Close

Introduction to Quantum Computing

¼Òµæ°øÁ¦

2013³â 9¿ù 9ÀÏ ÀÌÈÄ ´©Àû¼öÄ¡ÀÔ´Ï´Ù.

ÆǸÅÁö¼ö 12
?
ÆǸÅÁö¼ö¶õ?
»çÀÌÆ®ÀÇ ÆǸŷ®¿¡ ±â¹ÝÇÏ¿© ÆǸŷ® ÃßÀ̸¦ ¹Ý¿µÇÑ ÀÎÅÍÆÄÅ© µµ¼­¿¡¼­ÀÇ µ¶¸³ÀûÀÎ ÆǸŠÁö¼öÀÔ´Ï´Ù. ÇöÀç °¡Àå Àß Æȸ®´Â »óÇ°¿¡ °¡ÁßÄ¡¸¦ µÎ¾ú±â ¶§¹®¿¡ ½ÇÁ¦ ´©Àû ÆǸŷ®°ú´Â ´Ù¼Ò Â÷ÀÌ°¡ ÀÖÀ» ¼ö ÀÖ½À´Ï´Ù. ÆǸŷ® ¿Ü¿¡µµ ´Ù¾çÇÑ °¡ÁßÄ¡·Î ±¸¼ºµÇ¾î ÃÖ±ÙÀÇ À̽´µµ¼­ È®Àνà À¯¿ëÇÒ ¼ö ÀÖ½À´Ï´Ù. ÇØ´ç Áö¼ö´Â ¸ÅÀÏ °»½ÅµË´Ï´Ù.
Close
°øÀ¯Çϱâ
Á¤°¡

96,960¿ø

  • 96,960¿ø

    2,910P (3%Àû¸³)

ÇÒÀÎÇýÅÃ
Àû¸³ÇýÅÃ
  • S-Point Àû¸³Àº ¸¶ÀÌÆäÀÌÁö¿¡¼­ Á÷Á¢ ±¸¸ÅÈ®Á¤ÇϽŠ°æ¿ì¸¸ Àû¸³ µË´Ï´Ù.
Ãß°¡ÇýÅÃ
  • 5/7(È­) À̳» ¹ß¼Û ¿¹Á¤  (¼­¿ï½Ã °­³²±¸ »ï¼º·Î 512)
  • ¹«·á¹è¼Û
  • ÁÖ¹®¼ö·®
    °¨¼Ò Áõ°¡
    • À̺¥Æ®/±âȹÀü

    • ¿¬°üµµ¼­(1)

    • »óÇ°±Ç

    AD

    ¸ñÂ÷

    Prefacep. x
    Acknowledgementsp. xi
    Introduction and Backgroundp. 1
    Overviewp. 1
    Computers and the Strong Church-Turing Thesisp. 2
    The Circuit Model of Computationp. 6
    A Linear Algebra Formulation of the Circuit Modelp. 8
    Reversible Computationp. 12
    A Preview of Quantum Physicsp. 15
    Quantum Physics and Computationp. 19
    Linear Algebra and the Dirac Notationp. 21
    The Dirac Notation and Hilbert Spacesp. 21
    Dual Vectorsp. 23
    Operatorsp. 27
    The Spectral Theoremp. 30
    Functions of Operatorsp. 32
    Tensor Productsp. 33
    The Schmidt Decomposition Theoremp. 35
    Some Comments on the Dirac Notationp. 37
    Qubits and the Framework of Quantum Mechanicsp. 38
    The State of a Quantum Systemp. 38
    Time-Evolution of a Closed Systemp. 43
    Composite Systemsp. 45
    Measurementp. 48
    Mixed States and General Quantum Operationsp. 53
    Mixed Statesp. 53
    Partial Tracep. 56
    General Quantum Operationsp. 59
    A Quantum Model of Computationp. 61
    The Quantum Circuit Modelp. 61
    Quantum Gatesp. 63
    1-Qubit Gatesp. 63
    Controlled-U Gatesp. 66
    Universal Sets of Quantum Gatesp. 68
    Efficiency of Approximating Unitary Transformationsp. 71
    Implementing Measurements with Quantum Circuitsp. 73
    Superdense Coding and Quantum Teleportationp. 78
    Superdense Codingp. 79
    Quantum Teleportationp. 80
    An Application of Quantum Teleportationp. 82
    Introductory Quantum Algorithms
    Probabilistic Versus Quantum Algorithmsp. 86
    Phase Kick-Backp. 91
    The Deutsch Algorithmp. 94
    The Deutsch-Jozsa Algorithmp. 99
    Simon's Algorithmp. 103
    Algorithms with Superpolynomial Speed-Upp. 110
    Quantum Phase Estimation and the Quantum Fourier Transformp. 110
    Error Analysis for Estimating Arbitrary Phasesp. 117
    Periodic Statesp. 120
    GCD, LCM, the Extended Euclidean Algorithmp. 124
    Eigenvalue Estimationp. 125
    Finding-Ordersp. 130
    The Order-Finding Problemp. 130
    Some Mathematical Preliminariesp. 131
    The Eigenvalue Estimation Approach to Order Findingp. 134
    Shor's Approach to Order Findingp. 139
    Finding Discrete Logarithmsp. 142
    Hidden Subgroupsp. 146
    More on Quantum Fourier Transformsp. 147
    Algorithm for the Finite Abelian Hidden Subgroup Problemp. 149
    Related Algorithms and Techniquesp. 151
    Algorithms Based on Amplitude Amplificationp. 152
    Grover's Quantum Search Algorithmp. 152
    Amplitude Amplificationp. 163
    Quantum Amplitude Estimation and Quantum Countingp. 170
    Searching Without Knowing the Success Probabilityp. 175
    Related Algorithms and Techniquesp. 178
    Quantum Computational Complexity Theory and Lower Boundsp. 179
    Computational Complexityp. 180
    Language Recognition Problems and Complexity Classesp. 181
    The Black-Box Modelp. 185
    State Distinguishabilityp. 187
    Lower Bounds for Searching in the Black-Box Model: Hybrid Methodp. 188
    General Black-Box Lower Boundsp. 191
    Polynomial Methodp. 193
    Applications to Lower Boundsp. 194
    Examples of Polynomial Method Lower Boundsp. 196
    Block Sensitivityp. 197
    Examples of Block Sensitivity Lower Boundsp. 197
    Adversary Methodsp. 198
    Examples of Adversary Lower Boundsp. 200
    Generalizationsp. 203
    Quantum Error Correctionp. 204
    Classical Error Correctionp. 204
    The Error Modelp. 205
    Encodingp. 206
    Error Recoveryp. 207
    The Classical Three-Bit Codep. 207
    Fault Tolerancep. 211
    Quantum Error Correctionp. 212
    Error Models for Quantum Computingp. 213
    Encodingp. 216
    Error Recoveryp. 217
    Three- and Nine-Qubit Quantum Codesp. 223
    The Three-Qubit Code for Bit-Flip Errorsp. 223
    The Three-Qubit Code for Phase-Flip Errorsp. 225
    Quantum Error Correction Without Decodingp. 226
    The Nine-Qubit Shor Codep. 230
    Fault-Tolerant Quantum Computationp. 234
    Concatenation of Codes and the Threshold Theoremp. 237
    p. 241
    Tools for Analysing Probabilistic Algorithmsp. 241
    Solving the Discrete Logarithm Problem When the Order of a Is Compositep. 243
    How Many Random Samples Are Needed to Generate a Group?p. 245
    Finding r Given k/r for Random kp. 247
    Adversary Method Lemmap. 248
    Black-Boxes for Group Computationsp. 250
    Computing Schmidt Decompositionsp. 253
    General Measurementsp. 255
    Optimal Distinguishing of Two Statesp. 258
    A Simple Procedurep. 258
    Optimality of This Simple Procedurep. 258
    Bibliographyp. 260
    Indexp. 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.

    ÀúÀÚ¼Ò°³

    Kaye, Phillip/ Laflamme, Raymond/ Mosca, Michele [Àú] ½ÅÀ۾˸² SMS½Åû
    »ý³â¿ùÀÏ -

    ÇØ´çÀÛ°¡¿¡ ´ëÇÑ ¼Ò°³°¡ ¾ø½À´Ï´Ù.

    ÄÄÇ»ÅÍ ºÐ¾ß¿¡¼­ ¸¹Àº ȸ¿øÀÌ ±¸¸ÅÇÑ Ã¥

      ¸®ºä

      0.0 (ÃÑ 0°Ç)

      100ÀÚÆò

      ÀÛ¼º½Ã À¯ÀÇ»çÇ×

      ÆòÁ¡
      0/100ÀÚ
      µî·ÏÇϱâ

      100ÀÚÆò

      0.0
      (ÃÑ 0°Ç)

      ÆǸÅÀÚÁ¤º¸

      • ÀÎÅÍÆÄÅ©µµ¼­¿¡ µî·ÏµÈ ¿ÀǸ¶ÄÏ »óÇ°Àº ±× ³»¿ë°ú Ã¥ÀÓÀÌ ¸ðµÎ ÆǸÅÀÚ¿¡°Ô ÀÖÀ¸¸ç, ÀÎÅÍÆÄÅ©µµ¼­´Â ÇØ´ç »óÇ°°ú ³»¿ë¿¡ ´ëÇØ Ã¥ÀÓÁöÁö ¾Ê½À´Ï´Ù.

      »óÈ£

      (ÁÖ)±³º¸¹®°í

      ´ëÇ¥ÀÚ¸í

      ¾Èº´Çö

      »ç¾÷ÀÚµî·Ï¹øÈ£

      102-81-11670

      ¿¬¶ôó

      1544-1900

      ÀüÀÚ¿ìÆíÁÖ¼Ò

      callcenter@kyobobook.co.kr

      Åë½ÅÆǸž÷½Å°í¹øÈ£

      01-0653

      ¿µ¾÷¼ÒÀçÁö

      ¼­¿ïƯº°½Ã Á¾·Î±¸ Á¾·Î 1(Á¾·Î1°¡,±³º¸ºôµù)

      ±³È¯/ȯºÒ

      ¹ÝÇ°/±³È¯ ¹æ¹ý

      ¡®¸¶ÀÌÆäÀÌÁö > Ãë¼Ò/¹ÝÇ°/±³È¯/ȯºÒ¡¯ ¿¡¼­ ½Åû ¶Ç´Â 1:1 ¹®ÀÇ °Ô½ÃÆÇ ¹× °í°´¼¾ÅÍ(1577-2555)¿¡¼­ ½Åû °¡´É

      ¹ÝÇ°/±³È¯°¡´É ±â°£

      º¯½É ¹ÝÇ°ÀÇ °æ¿ì Ãâ°í¿Ï·á ÈÄ 6ÀÏ(¿µ¾÷ÀÏ ±âÁØ) À̳»±îÁö¸¸ °¡´É
      ´Ü, »óÇ°ÀÇ °áÇÔ ¹× °è¾à³»¿ë°ú ´Ù¸¦ °æ¿ì ¹®Á¦Á¡ ¹ß°ß ÈÄ 30ÀÏ À̳»

      ¹ÝÇ°/±³È¯ ºñ¿ë

      º¯½É ȤÀº ±¸¸ÅÂø¿À·Î ÀÎÇÑ ¹ÝÇ°/±³È¯Àº ¹Ý¼Û·á °í°´ ºÎ´ã
      »óÇ°À̳ª ¼­ºñ½º ÀÚüÀÇ ÇÏÀÚ·Î ÀÎÇÑ ±³È¯/¹ÝÇ°Àº ¹Ý¼Û·á ÆǸÅÀÚ ºÎ´ã

      ¹ÝÇ°/±³È¯ ºÒ°¡ »çÀ¯

      ·¼ÒºñÀÚÀÇ Ã¥ÀÓ ÀÖ´Â »çÀ¯·Î »óÇ° µîÀÌ ¼Õ½Ç ¶Ç´Â ÈÑ¼ÕµÈ °æ¿ì
      (´ÜÁö È®ÀÎÀ» À§ÇÑ Æ÷Àå ÈѼÕÀº Á¦¿Ü)

      ·¼ÒºñÀÚÀÇ »ç¿ë, Æ÷Àå °³ºÀ¿¡ ÀÇÇØ »óÇ° µîÀÇ °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì
      ¿¹) È­ÀåÇ°, ½ÄÇ°, °¡ÀüÁ¦Ç°(¾Ç¼¼¼­¸® Æ÷ÇÔ) µî

      ·º¹Á¦°¡ °¡´ÉÇÑ »óÇ° µîÀÇ Æ÷ÀåÀ» ÈѼÕÇÑ °æ¿ì
      ¿¹) À½¹Ý/DVD/ºñµð¿À, ¼ÒÇÁÆ®¿þ¾î, ¸¸È­Ã¥, ÀâÁö, ¿µ»ó È­º¸Áý

      ·½Ã°£ÀÇ °æ°ú¿¡ ÀÇÇØ ÀçÆǸŰ¡ °ï¶õÇÑ Á¤µµ·Î °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì

      ·ÀüÀÚ»ó°Å·¡ µî¿¡¼­ÀÇ ¼ÒºñÀÚº¸È£¿¡ °üÇÑ ¹ý·üÀÌ Á¤ÇÏ´Â ¼ÒºñÀÚ Ã»¾àöȸ Á¦ÇÑ ³»¿ë¿¡ ÇØ´çµÇ´Â °æ¿ì

      »óÇ° Ç°Àý

      °ø±Þ»ç(ÃâÆÇ»ç) Àç°í »çÁ¤¿¡ ÀÇÇØ Ç°Àý/Áö¿¬µÉ ¼ö ÀÖÀ½

      ¼ÒºñÀÚ ÇÇÇغ¸»ó
      ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó

      ·»óÇ°ÀÇ ºÒ·®¿¡ ÀÇÇÑ ±³È¯, A/S, ȯºÒ, Ç°Áúº¸Áõ ¹× ÇÇÇغ¸»ó µî¿¡ °üÇÑ »çÇ×Àº ¼ÒºñÀÚºÐÀïÇØ°á ±âÁØ (°øÁ¤°Å·¡À§¿øȸ °í½Ã)¿¡ ÁØÇÏ¿© 󸮵Ê

      ·´ë±Ý ȯºÒ ¹× ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó±Ý Áö±Þ Á¶°Ç, ÀýÂ÷ µîÀº ÀüÀÚ»ó°Å·¡ µî¿¡¼­ÀÇ ¼ÒºñÀÚ º¸È£¿¡ °üÇÑ ¹ý·ü¿¡ µû¶ó ó¸®ÇÔ

      (ÁÖ)KGÀ̴Ͻýº ±¸¸Å¾ÈÀü¼­ºñ½º¼­ºñ½º °¡ÀÔ»ç½Ç È®ÀÎ

      (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º´Â ȸ¿ø´ÔµéÀÇ ¾ÈÀü°Å·¡¸¦ À§ÇØ ±¸¸Å±Ý¾×, °áÁ¦¼ö´Ü¿¡ »ó°ü¾øÀÌ (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º¸¦ ÅëÇÑ ¸ðµç °Å·¡¿¡ ´ëÇÏ¿©
      (ÁÖ)KGÀ̴Ͻýº°¡ Á¦°øÇÏ´Â ±¸¸Å¾ÈÀü¼­ºñ½º¸¦ Àû¿ëÇÏ°í ÀÖ½À´Ï´Ù.

      ¹è¼Û¾È³»

      • ±³º¸¹®°í »óÇ°Àº Åùè·Î ¹è¼ÛµÇ¸ç, Ãâ°í¿Ï·á 1~2Àϳ» »óÇ°À» ¹Þ¾Æ º¸½Ç ¼ö ÀÖ½À´Ï´Ù.

      • Ãâ°í°¡´É ½Ã°£ÀÌ ¼­·Î ´Ù¸¥ »óÇ°À» ÇÔ²² ÁÖ¹®ÇÒ °æ¿ì Ãâ°í°¡´É ½Ã°£ÀÌ °¡Àå ±ä »óÇ°À» ±âÁØÀ¸·Î ¹è¼ÛµË´Ï´Ù.

      • ±ººÎ´ë, ±³µµ¼Ò µî ƯÁ¤±â°üÀº ¿ìü±¹ Åù踸 ¹è¼Û°¡´ÉÇÕ´Ï´Ù.

      • ¹è¼Ûºñ´Â ¾÷ü ¹è¼Ûºñ Á¤Ã¥¿¡ µû¸¨´Ï´Ù.

      • - µµ¼­ ±¸¸Å ½Ã 15,000¿ø ÀÌ»ó ¹«·á¹è¼Û, 15,000¿ø ¹Ì¸¸ 2,500¿ø - »óÇ°º° ¹è¼Ûºñ°¡ ÀÖ´Â °æ¿ì, »óÇ°º° ¹è¼Ûºñ Á¤Ã¥ Àû¿ë