Quantum Search Algorithm Based on Multi-Phase
The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the succ...
Gespeichert in:
| Veröffentlicht in: | Chinese physics letters 2014-05, Vol.31 (5), p.1-4 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4 |
|---|---|
| container_issue | 5 |
| container_start_page | 1 |
| container_title | Chinese physics letters |
| container_volume | 31 |
| creator | 李坦 鲍皖苏 林文铅 张侯 付向群 |
| description | The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the success probability and design a systematic solution of the optimal phases for an arbitrary number of phases. Based on these results, we finally propose a multi-phase quantum search algorithm whose success probability rises with the increase of the number of phases with just a single iteration, and it tends to be 100% when the fraction of target items is over a lower limit. |
| doi_str_mv | 10.1088/0256-307X/31/5/050301 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1660083247</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>49597129</cqvip_id><sourcerecordid>1660083247</sourcerecordid><originalsourceid>FETCH-LOGICAL-c312t-1c0c1416fd8ba5e34f39140bcd18ccc906ecf12f2da65cc91d15889b708a39db3</originalsourceid><addsrcrecordid>eNo9kF1LwzAUhoMoOKc_Qah33sSe0yRtcjmHXzBRUcG7kKbpWunHlrQX_ns7NnZ1eOF5DrwvIdcIdwhSxpCIlDLIfmKGsYhBAAM8ITPMOFImOJyS2ZE5Jxch_AIgSsQZoR-j6YaxjT6d8baKFs269_VQtdG9Ca6I-i56HZuhpu_VlC_JWWma4K4Od06-Hx--ls909fb0slysqGWYDBQtWOSYloXMjXCMl0whh9wWKK21ClJnS0zKpDCpmDIWKKRUeQbSMFXkbE5u9383vt-OLgy6rYN1TWM6149BY5oCSJbwbELFHrW-D8G7Um983Rr_pxH0bh69q6531TVDLfR-nsm7OXhV3623dbc-ilwJlWGi2D84zGI9</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1660083247</pqid></control><display><type>article</type><title>Quantum Search Algorithm Based on Multi-Phase</title><source>Institute of Physics Journals</source><creator>李坦 鲍皖苏 林文铅 张侯 付向群</creator><creatorcontrib>李坦 鲍皖苏 林文铅 张侯 付向群</creatorcontrib><description>The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the success probability and design a systematic solution of the optimal phases for an arbitrary number of phases. Based on these results, we finally propose a multi-phase quantum search algorithm whose success probability rises with the increase of the number of phases with just a single iteration, and it tends to be 100% when the fraction of target items is over a lower limit.</description><identifier>ISSN: 0256-307X</identifier><identifier>EISSN: 1741-3540</identifier><identifier>DOI: 10.1088/0256-307X/31/5/050301</identifier><language>eng</language><subject>Complement ; Design engineering ; Optimization ; Quantum computing ; Search algorithms ; Theorems ; 任意数 ; 多相位 ; 成功概率 ; 目标产品 ; 量子搜索算法</subject><ispartof>Chinese physics letters, 2014-05, Vol.31 (5), p.1-4</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c312t-1c0c1416fd8ba5e34f39140bcd18ccc906ecf12f2da65cc91d15889b708a39db3</citedby><cites>FETCH-LOGICAL-c312t-1c0c1416fd8ba5e34f39140bcd18ccc906ecf12f2da65cc91d15889b708a39db3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84212X/84212X.jpg</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>李坦 鲍皖苏 林文铅 张侯 付向群</creatorcontrib><title>Quantum Search Algorithm Based on Multi-Phase</title><title>Chinese physics letters</title><addtitle>Chinese Physics Letters</addtitle><description>The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the success probability and design a systematic solution of the optimal phases for an arbitrary number of phases. Based on these results, we finally propose a multi-phase quantum search algorithm whose success probability rises with the increase of the number of phases with just a single iteration, and it tends to be 100% when the fraction of target items is over a lower limit.</description><subject>Complement</subject><subject>Design engineering</subject><subject>Optimization</subject><subject>Quantum computing</subject><subject>Search algorithms</subject><subject>Theorems</subject><subject>任意数</subject><subject>多相位</subject><subject>成功概率</subject><subject>目标产品</subject><subject>量子搜索算法</subject><issn>0256-307X</issn><issn>1741-3540</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNo9kF1LwzAUhoMoOKc_Qah33sSe0yRtcjmHXzBRUcG7kKbpWunHlrQX_ns7NnZ1eOF5DrwvIdcIdwhSxpCIlDLIfmKGsYhBAAM8ITPMOFImOJyS2ZE5Jxch_AIgSsQZoR-j6YaxjT6d8baKFs269_VQtdG9Ca6I-i56HZuhpu_VlC_JWWma4K4Od06-Hx--ls909fb0slysqGWYDBQtWOSYloXMjXCMl0whh9wWKK21ClJnS0zKpDCpmDIWKKRUeQbSMFXkbE5u9383vt-OLgy6rYN1TWM6149BY5oCSJbwbELFHrW-D8G7Um983Rr_pxH0bh69q6531TVDLfR-nsm7OXhV3623dbc-ilwJlWGi2D84zGI9</recordid><startdate>20140501</startdate><enddate>20140501</enddate><creator>李坦 鲍皖苏 林文铅 张侯 付向群</creator><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7U5</scope><scope>8FD</scope><scope>H8D</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140501</creationdate><title>Quantum Search Algorithm Based on Multi-Phase</title><author>李坦 鲍皖苏 林文铅 张侯 付向群</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c312t-1c0c1416fd8ba5e34f39140bcd18ccc906ecf12f2da65cc91d15889b708a39db3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Complement</topic><topic>Design engineering</topic><topic>Optimization</topic><topic>Quantum computing</topic><topic>Search algorithms</topic><topic>Theorems</topic><topic>任意数</topic><topic>多相位</topic><topic>成功概率</topic><topic>目标产品</topic><topic>量子搜索算法</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>李坦 鲍皖苏 林文铅 张侯 付向群</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Chinese physics letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>李坦 鲍皖苏 林文铅 张侯 付向群</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quantum Search Algorithm Based on Multi-Phase</atitle><jtitle>Chinese physics letters</jtitle><addtitle>Chinese Physics Letters</addtitle><date>2014-05-01</date><risdate>2014</risdate><volume>31</volume><issue>5</issue><spage>1</spage><epage>4</epage><pages>1-4</pages><issn>0256-307X</issn><eissn>1741-3540</eissn><abstract>The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the success probability and design a systematic solution of the optimal phases for an arbitrary number of phases. Based on these results, we finally propose a multi-phase quantum search algorithm whose success probability rises with the increase of the number of phases with just a single iteration, and it tends to be 100% when the fraction of target items is over a lower limit.</abstract><doi>10.1088/0256-307X/31/5/050301</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0256-307X |
| ispartof | Chinese physics letters, 2014-05, Vol.31 (5), p.1-4 |
| issn | 0256-307X 1741-3540 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1660083247 |
| source | Institute of Physics Journals |
| subjects | Complement Design engineering Optimization Quantum computing Search algorithms Theorems 任意数 多相位 成功概率 目标产品 量子搜索算法 |
| title | Quantum Search Algorithm Based on Multi-Phase |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T00%3A07%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quantum%20Search%20Algorithm%20Based%20on%20Multi-Phase&rft.jtitle=Chinese%20physics%20letters&rft.au=%E6%9D%8E%E5%9D%A6%20%E9%B2%8D%E7%9A%96%E8%8B%8F%20%E6%9E%97%E6%96%87%E9%93%85%20%E5%BC%A0%E4%BE%AF%20%E4%BB%98%E5%90%91%E7%BE%A4&rft.date=2014-05-01&rft.volume=31&rft.issue=5&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.issn=0256-307X&rft.eissn=1741-3540&rft_id=info:doi/10.1088/0256-307X/31/5/050301&rft_dat=%3Cproquest_cross%3E1660083247%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1660083247&rft_id=info:pmid/&rft_cqvip_id=49597129&rfr_iscdi=true |