Hardcover. Condition: 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!
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: 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.
Published by Birkhäuser, Boston, Basel, Berlin, 2001
ISBN 10: 0817641270 ISBN 13: 9780817641276
Language: English
Seller: Shadyside Books, Pittsburgh, PA, U.S.A.
Hardcover. Condition: Very Good. Second Printing. 2001 Second Printing. Hardcover. Very Good. No Dust Jacket. Clean, unmarked copy. 138p.
Condition: Very Good. Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy.
Hard Cover. Condition: Very Good. No Jacket.
Published by Springer-Verlag New York Inc., New York, 2012
ISBN 10: 1461271274 ISBN 13: 9781461271277
Language: English
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. 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.
Condition: New.
US$ 86.03
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Birkhauser Boston Inc, Secaucus, 1999
ISBN 10: 0817641270 ISBN 13: 9780817641276
Language: English
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
First Edition
Hardcover. Condition: 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.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 85.02
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 93.98
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Condition: New.
Seller: Aragon Books Canada, OTTAWA, ON, Canada
US$ 77.00
Convert currencyQuantity: 1 available
Add to basketCondition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 86.27
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 87.99
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Published by Birkh�user 1999-11-12, 1999
ISBN 10: 1461271274 ISBN 13: 9781461271277
Language: English
Seller: Chiron Media, Wallingford, United Kingdom
US$ 86.66
Convert currencyQuantity: 10 available
Add to basketPaperback. Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 87.98
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Condition: New. pp. 156.
Condition: new.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 99.32
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Condition: New. pp. 160.
US$ 78.81
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
US$ 78.81
Convert currencyQuantity: Over 20 available
Add to basketGebunden. Condition: New.
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
US$ 133.47
Convert currencyQuantity: 15 available
Add to basketCondition: New. 2001. Hardcover. . . . . .
Published by Birkhäuser, Birkhäuser, 2012
ISBN 10: 1461271274 ISBN 13: 9781461271277
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 94.60
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Published by Birkhäuser Boston, Birkhäuser Boston, 1999
ISBN 10: 0817641270 ISBN 13: 9780817641276
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 95.79
Convert currencyQuantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Condition: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 144.08
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 155.05
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
Condition: As New. Unread book in perfect condition.