|
|
|
|
| LEADER |
05918nam a2200625 a 4500 |
| 001 |
3379 |
| 005 |
20081216144059.0 |
| 006 |
m e d |
| 007 |
cr cn |||m|||a |
| 008 |
081203s2009 caua fsab 000 0 eng d |
| 020 |
# |
# |
|a 9781598297331 (electronic bk.)
|
| 020 |
# |
# |
|a 9781598297324 (pbk.)
|
| 024 |
7 |
# |
|a 10.2200/S00159ED1V01Y200810QMC002
|2 doi
|
| 035 |
# |
# |
|a 270769971 (OCLC)
|
| 035 |
# |
# |
|a (CaBNvSL)gtp00532199
|
| 040 |
# |
# |
|a CaBNvSL
|c CaBNvSL
|d CaBNvSL
|
| 050 |
# |
4 |
|a QA76.889
|b .L256 2009
|
| 082 |
0 |
4 |
|a 004.1
|2 22
|
| 100 |
1 |
# |
|a Lanzagorta, Marco.
|
| 245 |
1 |
0 |
|a Quantum computer science
|c Marco Lanzagorta, Jeffrey Uhlmann.
|h [electronic resource] /
|
| 260 |
# |
# |
|a San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) :
|b Morgan & Claypool Publishers,
|c c2009.
|
| 300 |
# |
# |
|a 1 electronic text (xiv, 108 p. : ill.) :
|b digital file.
|
| 490 |
1 |
# |
|a Synthesis lectures on quantum computing ;
|v # 2
|
| 500 |
# |
# |
|a Part of: Synthesis digital library of engineering and computer science.
|
| 500 |
# |
# |
|a Title from PDF t.p. (viewed on December 3, 2008).
|
| 500 |
# |
# |
|a Series from website.
|
| 504 |
# |
# |
|a Includes bibliographical references (p. 103-107).
|
| 505 |
0 |
# |
|a The algorithmic structure of quantum computing -- Understanding quantum algorithmics -- Quantum computing property #1 -- Quantum computing property #2 -- Quantum computing property #3 -- Quantum computing property #4 -- Quantum computing property #5 -- Quantum computing property #6 -- Quantum computing property #7 -- Quantum computing property #8 -- Summary -- Advantages and limitations of quantum computing -- Quantum computability -- Classical and quantum complexity classes -- Advantages and disadvantages of the quantum computational model -- Hybrid computing -- The QRAM architecture -- Algorithmic considerations -- Quantum algorithm design -- Quantum building blocks -- Summary -- Amplitude amplification -- Quantum search -- Quantum oracles -- Searching data in a quantum register -- Grover's algorithm -- Generalized quantum search -- Grover's algorithm with multiple solutions -- Further applications of amplitude amplification -- Summary -- Case study: computational geometry -- General spatial search problems -- QMOS for object-object intersection identification -- QMOS for batch intersection identification -- Quantum rendering -- Z-buffering -- Ray tracing -- Radiosity -- Level of detail -- Summary -- The quantum Fourier transform -- The classical Fourier transform -- The quantum Fourier transform -- Matrix representation -- Circuit representation -- Computational complexity -- Algorithmic restrictions -- Normalization -- Initialization -- Output -- Summary -- Case study: the hidden subgroup -- Phase estimation -- Period finding -- The hidden subgroup problem -- Quantum cryptoanalysis -- Summary -- Circuit complexity analysis of quantum algorithms -- Quantum parallelism -- Algorithmic equity assumptions -- Classical and quantum circuit complexity analysis -- Comparing classical and quantum algorithms -- Summary -- Conclusions.
|
| 506 |
# |
# |
|a Abstract freely available; full-text restricted to subscribers or individual document purchasers.
|
| 510 |
0 |
# |
|a Compendex
|
| 510 |
0 |
# |
|a INSPEC
|
| 510 |
0 |
# |
|a Google scholar
|
| 510 |
0 |
# |
|a Google book search
|
| 520 |
# |
# |
|a In this text we present a technical overview of the emerging field of quantum computation along with new research results by the authors.What distinguishes our presentation from that of others is our focus on the relationship between quantum computation and computer science. Specifically, our emphasis is on the computational model of quantum computing rather than on the engineering issues associated with its physical implementation.We adopt this approach for the same reason that a book on computer programming doesn't cover the theory and physical realization of semiconductors. Another distinguishing feature of this text is our detailed discussion of the circuit complexity of quantum algorithms. To the extent possible we have presented the material in a form that is accessible to the computer scientist, but in many cases we retain the conventional physics notation so that the reader will also be able to consult the relevant quantum computing literature. Although we expect the reader to have a solid understanding of linear algebra, we do not assume a background in physics. This text is based on lectures given as short courses and invited presentations around the world, and it has been used as the primary text for a graduate course at George Mason University. In all these cases our challenge has been the same: how to present to a general audience a concise introduction to the algorithmic structure and applications of quantum computing on an extremely short period of time. The feedback from these courses and presentations has greatly aided in making our exposition of challenging concepts more accessible to a general audience.
|
| 530 |
# |
# |
|a Also available in print.
|
| 538 |
# |
# |
|a Mode of access: World Wide Web.
|
| 538 |
# |
# |
|a System requirements: Adobe Acrobat reader.
|
| 650 |
# |
0 |
|a Quantum computers.
|
| 650 |
# |
0 |
|a Computer algorithms.
|
| 690 |
# |
# |
|a Quantum computing.
|
| 690 |
# |
# |
|a Quantum algorithms.
|
| 690 |
# |
# |
|a Quantum information.
|
| 690 |
# |
# |
|a Computer science.
|
| 690 |
# |
# |
|a Grover's algorithm.
|
| 690 |
# |
# |
|a Shor's algorithm.
|
| 690 |
# |
# |
|a Quantum Fourier transform.
|
| 690 |
# |
# |
|a Circuit complexity.
|
| 690 |
# |
# |
|a Computational geometry.
|
| 690 |
# |
# |
|a Computer graphics.
|
| 690 |
# |
# |
|a Hidden sub-group problem.
|
| 690 |
# |
# |
|a Cryptoanalysis.
|
| 700 |
1 |
# |
|a Uhlmann, Jeffrey K.
|
| 730 |
0 |
# |
|a Synthesis digital library of engineering and computer science.
|
| 830 |
# |
0 |
|a Synthesis lectures on quantum computing (Online) ;
|v # 2.
|
| 856 |
4 |
2 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.2200/S00159ED1V01Y200810QMC002
|3 Abstract with links to full text
|