Quantum Computing
Home > Computing and Information Technology > Computer science > Quantum Computing
Quantum Computing

Quantum Computing

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

In quantum computing, we witness an exciting and very promising merge of two of the deepest and most successful scientific and technological developments of this century: quantum physics and computer science. In spite of the fact that its experimental developments are in their infancy, there has already been a variety of concepts, models, methods and results obtained at the theoretical level that clearly have lasting value.These concepts, methods and results are the main subject of the book. Knowledge from two areas is of importance for understanding the basic developments in quantum computing: namely, quantum physics and theoretical computer science. The book provides elements of both, and concentrates on the presentation of concepts, models, methods and results mainly from a computing point of view. No previous knowledge of quantum mechanics is required. Supporting material for the book can be found on the Authors Web Site, http://www.fi.muni.cz/usr/gruska/foundations.html.

Table of Contents:
FUNDAMENTALS Prehistory of quantum computing; From randomized to quantum computing; Probabilistic Turing machines; Quantum Turing machines; Hilbert space basics; Basic concepts; Orthogonality, bases and subspaces; Evolution; Mixed states and density matrices; Tensor products; Experiments; Classical experiments; Quantum experiment; Quantum principles; Amplitudes and states; Measurement ; a projection approach; Evolution of quantum systems; Quantum measurements -interpretations; Classical reversible gates and computing; Reversible gates; Reversible Turing machines; Billiard ball model. ALGORITHMS; Quantum bits and registers; Qubits; Quantum registers; Quantum entanglement; Communication speed-up through entanglement; Quantum networks; Quantum gates; Measurement gates; Universality of quantum gates; Networks for arithmetical operations; Quantum parallelism and simple algorithms; Deutsch'||'''s XOR problem; Deutsch-Jozsa'||'''s problem; Simon'||'''s XOR problem; Fast quantum algorithms; Number theory basics; Quantum Fourier transform; Shor'||'''s factorization algorithm; Shor'||'''s discrete logarithm algorithm ; Grover'||'''s search algorithm; Limitations of quantum algorithms. AUTOMATA; Quantum finite automata; One-way quantum automata; Two-way quantum automata; Quantum Turing machines; Basic concepts; Mutual simulation of QTM; Quantum cellular automata; Basic concepts; Partitioned quantum cellular automata; Universality in quantum cellular automata; Quantum cellular automata versus quantum Turing machines. COMPLEXITY; Quantum computational complexity; Quantum communication complexity. COMMUNICATIONS; Quantum information theory; Classical information theory; Quantum information theory; Quantum data compression; Shannon'||'''s noiseless coding theorem; Schumacher'||'''s noiseless coding theorem; Communication through noisy quantum channel ; Quantum cryptography; Key distribution in classical cryptography ; Quantum key distribution (QKD) protocols; Unconditional security of QKD; Other quantum cryptographic systems; Quantum cryptographic protocols; Classical cryptographic protocols; Quantum coin tossing, bit commitment and oblivious transfer; Quantum teleportation. PROCESSORS; Quantum decoherence ; Quantum error correcting codes; Simulation of quantum algorithms; Experimental quantum processors; A quantum computer. EXERCISES. Historical and bibliographical references. Appendix; Quantum theory; Prehistory of quantum theory; Quantum theory and physical reality ; Quantum measurements; Quantum paradoxes; Interpretations of quantum theory; Hilbert space framework for quantum computing; Hilbert spaces ; Linear operators; Pure and mixed states; Observables and probabilities; Spectral measures in finite dimensional Hilbert spaces; Spectral measures in infinite dimensional Hilbert spaces ; Evolution in quantum systems; Compound systems; Unitary matrices; Complexity theory; Computational models and resources ; Complexity classes; Computational theses. Bibliography


Best Sellers


Product Details
  • ISBN-13: 9780077095031
  • Publisher: McGraw-Hill Education - Europe
  • Publisher Imprint: Osborne/McGraw-Hill
  • Language: English
  • ISBN-10: 0077095030
  • Publisher Date: 16 Apr 1999
  • Binding: Paperback


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Quantum Computing
McGraw-Hill Education - Europe -
Quantum Computing
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Quantum Computing

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!