An Introduction to Quantum Computing Algorithms:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston, MA
Birkhäuser Boston
2000
|
| Series: | Progress in Computer Science and Applied Logic
19 |
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | 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 computer. Since the difficulty of the factoring problem is crucial for the security of a public key encryption system, interest (and funding) in quantum computing and quantum computation suddenly blossomed. Quantum computing had arrived. The study of the role of quantum mechanics in the theory of computation 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 perspective 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 |
| Physical Description: | 1 Online-Ressource (XII, 140 p) |
| ISBN: | 9781461213901 9781461271277 |
| DOI: | 10.1007/978-1-4612-1390-1 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042419827 | ||
| 003 | DE-604 | ||
| 005 | 20170919 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461213901 |c Online |9 978-1-4612-1390-1 | ||
| 020 | |a 9781461271277 |c Print |9 978-1-4612-7127-7 | ||
| 024 | 7 | |a 10.1007/978-1-4612-1390-1 |2 doi | |
| 035 | |a (OCoLC)863691911 | ||
| 035 | |a (DE-599)BVBBV042419827 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Pittenger, Arthur O. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An Introduction to Quantum Computing Algorithms |c by Arthur O. Pittenger |
| 264 | 1 | |a Boston, MA |b Birkhäuser Boston |c 2000 | |
| 300 | |a 1 Online-Ressource (XII, 140 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Progress in Computer Science and Applied Logic |v 19 | |
| 500 | |a 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 computer. Since the difficulty of the factoring problem is crucial for the security of a public key encryption system, interest (and funding) in quantum computing and quantum computation suddenly blossomed. Quantum computing had arrived. The study of the role of quantum mechanics in the theory of computation 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 perspective 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 | ||
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computer software | |
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Quantum theory | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Applications of Mathematics | |
| 650 | 4 | |a Math Applications in Computer Science | |
| 650 | 4 | |a Quantum Physics | |
| 650 | 4 | |a Quantum Information Technology, Spintronics | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Quantentheorie | |
| 830 | 0 | |a Progress in Computer Science and Applied Logic |v 19 |w (DE-604)BV004157568 |9 19 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4612-1390-1 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027855244 | ||
Record in the Search Index
| _version_ | 1804153090936406016 |
|---|---|
| any_adam_object | |
| author | Pittenger, Arthur O. |
| author_facet | Pittenger, Arthur O. |
| author_role | aut |
| author_sort | Pittenger, Arthur O. |
| author_variant | a o p ao aop |
| building | Verbundindex |
| bvnumber | BV042419827 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863691911 (DE-599)BVBBV042419827 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-1-4612-1390-1 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02839nmm a2200553zcb4500</leader><controlfield tag="001">BV042419827</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170919 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461213901</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4612-1390-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461271277</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4612-7127-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4612-1390-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863691911</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419827</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pittenger, Arthur O.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An Introduction to Quantum Computing Algorithms</subfield><subfield code="c">by Arthur O. Pittenger</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Birkhäuser Boston</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 140 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Progress in Computer Science and Applied Logic</subfield><subfield code="v">19</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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 computer. Since the difficulty of the factoring problem is crucial for the security of a public key encryption system, interest (and funding) in quantum computing and quantum computation suddenly blossomed. Quantum computing had arrived. The study of the role of quantum mechanics in the theory of computation 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 perspective 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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quantum theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Applications of Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Math Applications in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quantum Physics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quantum Information Technology, Spintronics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quantentheorie</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Progress in Computer Science and Applied Logic</subfield><subfield code="v">19</subfield><subfield code="w">(DE-604)BV004157568</subfield><subfield code="9">19</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4612-1390-1</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027855244</subfield></datafield></record></collection> |
| id | DE-604.BV042419827 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:05Z |
| institution | BVB |
| isbn | 9781461213901 9781461271277 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027855244 |
| oclc_num | 863691911 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XII, 140 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Birkhäuser Boston |
| record_format | marc |
| series | Progress in Computer Science and Applied Logic |
| series2 | Progress in Computer Science and Applied Logic |
| spelling | Pittenger, Arthur O. Verfasser aut An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger Boston, MA Birkhäuser Boston 2000 1 Online-Ressource (XII, 140 p) txt rdacontent c rdamedia cr rdacarrier Progress in Computer Science and Applied Logic 19 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 computer. Since the difficulty of the factoring problem is crucial for the security of a public key encryption system, interest (and funding) in quantum computing and quantum computation suddenly blossomed. Quantum computing had arrived. The study of the role of quantum mechanics in the theory of computation 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 perspective 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 Computer science Information theory Computer software Mathematics Quantum theory Computer Science Theory of Computation Applications of Mathematics Math Applications in Computer Science Quantum Physics Quantum Information Technology, Spintronics Algorithm Analysis and Problem Complexity Informatik Mathematik Quantentheorie Progress in Computer Science and Applied Logic 19 (DE-604)BV004157568 19 https://doi.org/10.1007/978-1-4612-1390-1 Verlag Volltext |
| spellingShingle | Pittenger, Arthur O. An Introduction to Quantum Computing Algorithms Progress in Computer Science and Applied Logic Computer science Information theory Computer software Mathematics Quantum theory Computer Science Theory of Computation Applications of Mathematics Math Applications in Computer Science Quantum Physics Quantum Information Technology, Spintronics Algorithm Analysis and Problem Complexity Informatik Mathematik Quantentheorie |
| title | An Introduction to Quantum Computing Algorithms |
| title_auth | An Introduction to Quantum Computing Algorithms |
| title_exact_search | An Introduction to Quantum Computing Algorithms |
| title_full | An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger |
| title_fullStr | An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger |
| title_full_unstemmed | An Introduction to Quantum Computing Algorithms by Arthur O. Pittenger |
| title_short | An Introduction to Quantum Computing Algorithms |
| title_sort | an introduction to quantum computing algorithms |
| topic | Computer science Information theory Computer software Mathematics Quantum theory Computer Science Theory of Computation Applications of Mathematics Math Applications in Computer Science Quantum Physics Quantum Information Technology, Spintronics Algorithm Analysis and Problem Complexity Informatik Mathematik Quantentheorie |
| topic_facet | Computer science Information theory Computer software Mathematics Quantum theory Computer Science Theory of Computation Applications of Mathematics Math Applications in Computer Science Quantum Physics Quantum Information Technology, Spintronics Algorithm Analysis and Problem Complexity Informatik Mathematik Quantentheorie |
| url | https://doi.org/10.1007/978-1-4612-1390-1 |
| volume_link | (DE-604)BV004157568 |
| work_keys_str_mv | AT pittengerarthuro anintroductiontoquantumcomputingalgorithms |