Quantum computer science:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
[San Rafael, Calif.]
Morgan & Claypool
[2008]
|
Schriftenreihe: | Synthesis lectures on quantum computing
#2 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XIV, 121 Seiten |
ISBN: | 1598297325 9781598297324 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV047396791 | ||
003 | DE-604 | ||
005 | 20210909 | ||
007 | t | ||
008 | 210802s2008 xxu |||| 00||| eng d | ||
020 | |a 1598297325 |c pbk |9 1-59829-732-5 | ||
020 | |a 9781598297324 |c : pbk |9 978-1-59829-732-4 | ||
035 | |a (OCoLC)1268181177 | ||
035 | |a (DE-599)GBV670610968 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a xxu |c XD-US | ||
049 | |a DE-739 | ||
084 | |a ST 152 |0 (DE-625)143596: |2 rvk | ||
084 | |a 54.10 |2 bkl | ||
084 | |a 33.23 |2 bkl | ||
100 | 1 | |a Lanzagorta, Marco |e Verfasser |0 (DE-588)1124546111 |4 aut | |
245 | 1 | 0 | |a Quantum computer science |c Marco Lanzagorta; Jeffrey Uhlmann |
264 | 1 | |a [San Rafael, Calif.] |b Morgan & Claypool |c [2008] | |
300 | |a XIV, 121 Seiten | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Synthesis lectures on quantum computing |v #2 | |
650 | 0 | 7 | |a Quantencomputer |0 (DE-588)4533372-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Quantencomputer |0 (DE-588)4533372-5 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Uhlmann, Jeffrey |e Verfasser |0 (DE-588)1240859953 |4 aut | |
830 | 0 | |a Synthesis lectures on quantum computing |v #2 |w (DE-604)BV047438611 |9 2 | |
856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032797975&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-032797975 |
Datensatz im Suchindex
_version_ | 1804182654035165184 |
---|---|
adam_text | Contents Prefece..............................................................................................................................xiii Acknowledgments............................................................................................................xv Introduction........................................................................................................................1 1 The Algorithmic Structure of Quantum Computing................................................... 3 1.1 Understanding Quantum Algorithmics................................................................... 4 1.1.1 Quantum Computing Property #1............................................................... 4 1.1.2 Quantum Computing Property #2............................................................. 8 1.1.3 Quantum Computing Property #3..............................................................10 1.1.4 Quantum Computing Property #4........................................................... 11 1.1.5 Quantum Computing Property #5..............................................................12 1.1.6 Quantum Computing Property #6........................................................... 16 1.1.7 Quantum Computing Property #7............................................................. 17 1.1.8 Quantum Computing Property #8..............................................................19 1.2 2 Summary................................................................................................................. 21 Advantages and Limitations of Quantum
Computing............................................. 23 2.1 Quantum Computability........................................................................ 23 2.2 Classical and Quantum Complexity Classes...................... 24 2.3 Advantages and Disadvantages of the Quantum Computational Model............................................................................25 2.4 Hybrid Computing.................................................................................................28 2.5 The QRAM Architecture....................................................................................... 28 2.5.1 Algorithmic Considerations........................................................................ 29 2.5.2 Quantum Algorithm Design.......................................................................31 2.6 Quantum Building Blocks..................................................................................... 32 2.7 Summary................................................................................................................. 33
x 3 4 5 Amplitude Amplification................................................................................................ 35 3.1 Quantum Search .........................................................................................................36 3.1.1 Quantum Oracles ........................................................................................... 36 3.1.2 Searching Data in a Quantum Register......................................................... 38 3.1.3 Grover’s Algorithm......................................................................................... 39 3.1.4 Generalized Quantum Search........................................................................ 48 3.2 Grover’s Algorithm with Multiple Solutions............................................................ 49 3.3 Further Applications of Amplitude Amplification ..............................................................................................................52 3.4 Summary...................................................................................................................... 52 Case Study: Computational Geometry.........................................................................53 4.1 General Spatial Search Problems................................................................................55 4.1.1 QMOS for Object-Object Intersection Identification................................. 59 4.1.2 QMOS for Batch IntersectionIdentification ................................................ 61 4.2 Quantum
Rendering................................................................................................... 62 4.2.1 Z-Buffering..................................................................................................... 62 4.2.2 Ray Tracing.......................................................................................................63 4.2.3 Radiosity...........................................................................................................68 4.2.4 Level of Detail................................................................................................. 70 4.3 Summary...................................................................................................................... 71 The Quantum Fourier Transform.............................................................................. 73 5.1 The Classical Fourier Transform................................................ 5.2 The Quantum Fourier Transform..............................................................................74 5.3 Matrix Representation................................................................................................. 75 5.4 Circuit Representation ............................................................................................... 76 5.5 Computational Complexity..................................................................................... 80 5.6 Algorithmic Restrictions........................................................................................... 80 5.6.1 Normalization
................................................................................................. 81 5.6.2 Initialization..................................................................................................... 81 5.6.3 Output...............................................................................................................81 Summary...................................................................................................................... 82 5.7 6 73 Case Study: The Hidden Subgroup............................................................................ 83 6.1 Phase Estimation......................................................................................................... 83 6.2 Period Finding.............................................................................................................86
Xl 7 8 6.3 The Hidden Subgroup Problem............................................................................... 88 6.4 6.5 Quantum Cryptoanalysis...........................................................................................89 Summary...................................................................................................................... 92 Computational Complexity and Quantum Computing........................................... 95 7.1 Quantum Parallelism.................................................................................................. 96 7.2 Circuit Complexity Analysis ..................................................................................... 97 7.3 Algorithmic Equity Assumptions............................................................................. 99 7.4 Comparing Classical and Quantum Algorithms...................................................... 99 7.5 Circuit Complexity with Noisy Gates......................................................................100 7.5.1 Fault Tolerant Classical Computing............................................................ 101 7.5.2 Quantum Error Correction..........................................................................101 7.5.3 Fault Tolerant Quantum Computing.......................................................... 103 7.6 Circuit Complexity Analysis of Quantum Algorithms in Noisy Environments . 103 7.6.1 Probability amplification............................................................................... 103 7.6.2 Error Probability Analysis
............................................................................104 7.6.3 The Classical Case......................................................................................... 106 7.6.4 Scaling of the Probability of Uncorrected Errors .......................................107 7.7 Revisiting the Threshold Theorem..........................................................................108 7.7.1 Space Complexity Overhead........................................................................110 7.8 Error Models ............................................................................................................ Ill 7.9 Summary.................................................................................................................... 112 Conclusions.................................................................................................................113 Bibliography................................................................................................................. 115 Authors’Biographies ................................................................................................. 121
|
adam_txt |
Contents Prefece.xiii Acknowledgments.xv Introduction.1 1 The Algorithmic Structure of Quantum Computing. 3 1.1 Understanding Quantum Algorithmics. 4 1.1.1 Quantum Computing Property #1. 4 1.1.2 Quantum Computing Property #2. 8 1.1.3 Quantum Computing Property #3.10 1.1.4 Quantum Computing Property #4. 11 1.1.5 Quantum Computing Property #5.12 1.1.6 Quantum Computing Property #6. 16 1.1.7 Quantum Computing Property #7. 17 1.1.8 Quantum Computing Property #8.19 1.2 2 Summary. 21 Advantages and Limitations of Quantum
Computing. 23 2.1 Quantum Computability. 23 2.2 Classical and Quantum Complexity Classes. 24 2.3 Advantages and Disadvantages of the Quantum Computational Model.25 2.4 Hybrid Computing.28 2.5 The QRAM Architecture. 28 2.5.1 Algorithmic Considerations. 29 2.5.2 Quantum Algorithm Design.31 2.6 Quantum Building Blocks. 32 2.7 Summary. 33
x 3 4 5 Amplitude Amplification. 35 3.1 Quantum Search .36 3.1.1 Quantum Oracles . 36 3.1.2 Searching Data in a Quantum Register. 38 3.1.3 Grover’s Algorithm. 39 3.1.4 Generalized Quantum Search. 48 3.2 Grover’s Algorithm with Multiple Solutions. 49 3.3 Further Applications of Amplitude Amplification .52 3.4 Summary. 52 Case Study: Computational Geometry.53 4.1 General Spatial Search Problems.55 4.1.1 QMOS for Object-Object Intersection Identification. 59 4.1.2 QMOS for Batch IntersectionIdentification . 61 4.2 Quantum
Rendering. 62 4.2.1 Z-Buffering. 62 4.2.2 Ray Tracing.63 4.2.3 Radiosity.68 4.2.4 Level of Detail. 70 4.3 Summary. 71 The Quantum Fourier Transform. 73 5.1 The Classical Fourier Transform. 5.2 The Quantum Fourier Transform.74 5.3 Matrix Representation. 75 5.4 Circuit Representation . 76 5.5 Computational Complexity. 80 5.6 Algorithmic Restrictions. 80 5.6.1 Normalization
. 81 5.6.2 Initialization. 81 5.6.3 Output.81 Summary. 82 5.7 6 73 Case Study: The Hidden Subgroup. 83 6.1 Phase Estimation. 83 6.2 Period Finding.86
Xl 7 8 6.3 The Hidden Subgroup Problem. 88 6.4 6.5 Quantum Cryptoanalysis.89 Summary. 92 Computational Complexity and Quantum Computing. 95 7.1 Quantum Parallelism. 96 7.2 Circuit Complexity Analysis . 97 7.3 Algorithmic Equity Assumptions. 99 7.4 Comparing Classical and Quantum Algorithms. 99 7.5 Circuit Complexity with Noisy Gates.100 7.5.1 Fault Tolerant Classical Computing. 101 7.5.2 Quantum Error Correction.101 7.5.3 Fault Tolerant Quantum Computing. 103 7.6 Circuit Complexity Analysis of Quantum Algorithms in Noisy Environments . 103 7.6.1 Probability amplification. 103 7.6.2 Error Probability Analysis
.104 7.6.3 The Classical Case. 106 7.6.4 Scaling of the Probability of Uncorrected Errors .107 7.7 Revisiting the Threshold Theorem.108 7.7.1 Space Complexity Overhead.110 7.8 Error Models . Ill 7.9 Summary. 112 Conclusions.113 Bibliography. 115 Authors’Biographies . 121 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Lanzagorta, Marco Uhlmann, Jeffrey |
author_GND | (DE-588)1124546111 (DE-588)1240859953 |
author_facet | Lanzagorta, Marco Uhlmann, Jeffrey |
author_role | aut aut |
author_sort | Lanzagorta, Marco |
author_variant | m l ml j u ju |
building | Verbundindex |
bvnumber | BV047396791 |
classification_rvk | ST 152 |
ctrlnum | (OCoLC)1268181177 (DE-599)GBV670610968 |
discipline | Informatik |
discipline_str_mv | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01563nam a2200397 cb4500</leader><controlfield tag="001">BV047396791</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210909 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">210802s2008 xxu |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1598297325</subfield><subfield code="c">pbk</subfield><subfield code="9">1-59829-732-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781598297324</subfield><subfield code="c">: pbk</subfield><subfield code="9">978-1-59829-732-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1268181177</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV670610968</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 152</subfield><subfield code="0">(DE-625)143596:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">33.23</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lanzagorta, Marco</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1124546111</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Quantum computer science</subfield><subfield code="c">Marco Lanzagorta; Jeffrey Uhlmann</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[San Rafael, Calif.]</subfield><subfield code="b">Morgan & Claypool</subfield><subfield code="c">[2008]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 121 Seiten</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Synthesis lectures on quantum computing</subfield><subfield code="v">#2</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Quantencomputer</subfield><subfield code="0">(DE-588)4533372-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Quantencomputer</subfield><subfield code="0">(DE-588)4533372-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Uhlmann, Jeffrey</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1240859953</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Synthesis lectures on quantum computing</subfield><subfield code="v">#2</subfield><subfield code="w">(DE-604)BV047438611</subfield><subfield code="9">2</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032797975&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032797975</subfield></datafield></record></collection> |
id | DE-604.BV047396791 |
illustrated | Not Illustrated |
index_date | 2024-07-03T17:51:16Z |
indexdate | 2024-07-10T09:10:59Z |
institution | BVB |
isbn | 1598297325 9781598297324 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032797975 |
oclc_num | 1268181177 |
open_access_boolean | |
owner | DE-739 |
owner_facet | DE-739 |
physical | XIV, 121 Seiten |
publishDate | 2008 |
publishDateSearch | 2008 |
publishDateSort | 2008 |
publisher | Morgan & Claypool |
record_format | marc |
series | Synthesis lectures on quantum computing |
series2 | Synthesis lectures on quantum computing |
spelling | Lanzagorta, Marco Verfasser (DE-588)1124546111 aut Quantum computer science Marco Lanzagorta; Jeffrey Uhlmann [San Rafael, Calif.] Morgan & Claypool [2008] XIV, 121 Seiten txt rdacontent n rdamedia nc rdacarrier Synthesis lectures on quantum computing #2 Quantencomputer (DE-588)4533372-5 gnd rswk-swf Quantencomputer (DE-588)4533372-5 s DE-604 Uhlmann, Jeffrey Verfasser (DE-588)1240859953 aut Synthesis lectures on quantum computing #2 (DE-604)BV047438611 2 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032797975&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Lanzagorta, Marco Uhlmann, Jeffrey Quantum computer science Synthesis lectures on quantum computing Quantencomputer (DE-588)4533372-5 gnd |
subject_GND | (DE-588)4533372-5 |
title | Quantum computer science |
title_auth | Quantum computer science |
title_exact_search | Quantum computer science |
title_exact_search_txtP | Quantum computer science |
title_full | Quantum computer science Marco Lanzagorta; Jeffrey Uhlmann |
title_fullStr | Quantum computer science Marco Lanzagorta; Jeffrey Uhlmann |
title_full_unstemmed | Quantum computer science Marco Lanzagorta; Jeffrey Uhlmann |
title_short | Quantum computer science |
title_sort | quantum computer science |
topic | Quantencomputer (DE-588)4533372-5 gnd |
topic_facet | Quantencomputer |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032797975&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV047438611 |
work_keys_str_mv | AT lanzagortamarco quantumcomputerscience AT uhlmannjeffrey quantumcomputerscience |