In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]’ [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
"Pittenger's book, as the title suggests, explains the mathematics at the basis of quantum computing and the fundamental algorithms, including Shor's factoring, Grover's search and error correction algorithms....
Since quantum computing is a highly interdisciplinary science, the author has tried to capture the attention of a large variety of readers and he has mostly achieved this objective. The book can be used as a formal introductory text for graduate students as well as a fascinating, but still engaging resource for interested readers who are comfortable with linear algebra.... Pittenger helps the reader into focusing attention on the algorithmic aspects rather than the formal content and uses examples as [an] integral part of the book, illustrating the substantial meaning of quantum theory applied to computing. He also proposes some exercises to stimulate an insightful reading.... The bibliography is complete and the interested reader can improve the understanding of the book and of the entire matter by following the numerous references, acquiring in this way more tools for the comprehension of a subject of such complexity...." ―SIGACT News
"An Introduction to Quantum Computing Algorithms reflects its author's own experience in learning the mathematics and theoretical physics required for the subject, as he writes in the acknowledgements. It is generally written in a pleasant and informal style, with much motivation in between the mathematics.... In just 150 pages this book manages to explain much of the core of quantum computing, and to explain it well." ―Quantum Information and Computation (QIC)
"If you have a general (fuzzy) background on quantum physics and on computer science, I recommend reading this book.... It is well written, easy to read, with many illustrating examples, and many exercises." ―Zentralblatt Math
In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 3,22 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerEUR 2,27 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerAnbieter: HPB-Red, Dallas, TX, USA
Hardcover. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_300083161
Anzahl: 1 verfügbar
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
Zustand: Fine. First edition, first printing, 152 pp., Hardcover, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Bestandsnummer des Verkäufers ZB1333315
Anzahl: 1 verfügbar
Anbieter: Shadyside Books, Pittsburgh, PA, USA
Hardcover. Zustand: Very Good. Second Printing. 2001 Second Printing. Hardcover. Very Good. No Dust Jacket. Clean, unmarked copy. 138p. Bestandsnummer des Verkäufers 12121
Anzahl: 1 verfügbar
Anbieter: Moe's Books, Berkeley, CA, USA
Hard Cover. Zustand: Very Good. No Jacket. Bestandsnummer des Verkäufers 1113301
Anzahl: 1 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 206907-n
Anzahl: Mehr als 20 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Hardcover. Zustand: new. Hardcover. The purpose of this monograph is to provide the mathematically literate reader with an accessible introduction to the theory of quantum computing algorithms, one component of a fascinating and rapidly developing area which involves topics from physics, mathematics, and computer science. The author briefly describes the historical context of quantum computing and provides the motivation, notation, and assumptions appropriate for quantum statics, a non-dynamical, finite dimensional model of quantum mechanics. This model is then used to define and illustrate quantum logic gates and representative subroutines required for quantum algorithms. A discussion of the basic algorithms of Simon and of Deutsch and Jozsa sets the stage for the presentation of Grover's search algorithm and Shor's factoring algorithm, key algorithms which crystallized interest in the practicality of quantum computers. A group theoretic abstraction of Shor's algorithms completes the discussion of algorithms.The last third of the book briefly elaborates the need for error- correction capabilities and then traces the theory of quantum error- correcting codes from the earliest examples to an abstract formulation in Hilbert space. This text is a good self-contained introductory resource for newcomers to the field of quantum computing algorithms, as well as a useful self-study guide for the more specialized scientist, mathematician, graduate student, or engineer. Readers interested in following the ongoing developments of quantum algorithms will benefit particularly from this presentation of the notation and basic theory. In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9780817641276
Anzahl: 1 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Bestandsnummer des Verkäufers I-9780817641276
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 206907
Anzahl: Mehr als 20 verfügbar
Anbieter: Aragon Books Canada, OTTAWA, ON, Kanada
Zustand: New. Bestandsnummer des Verkäufers QCAO--0085
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9780817641276_new
Anzahl: Mehr als 20 verfügbar