Nonadiabatic Quantum Search Algorithm with Analytical Success Rate

In nonadiabatic quantum search algorithm, it is difficult to calculate the success rate analytically. We develop the nonadiabatic quantum search algorithm by adding a counterdiabatic driving term to the original time-dependent Hamiltonian. The Hamiltonian we structured is diagonal in eigen picture a...

Full description

Saved in:
Bibliographic Details
Published in:International journal of theoretical physics 2019-03, Vol.58 (3), p.939-949
Main Authors: Li, Feng-Guang, Bao, Wan-Su, Li, Tan, Huang, He-liang, Zhang, Shuo, Fu, Xiang-Qun
Format: Article
Language:English
Subjects:
Algorithms
Elementary Particles
Mathematical analysis
Mathematical and Computational Physics
Physics
Physics and Astronomy
Quantum computing
Quantum Field Theory
Quantum Physics
Schrodinger equation
Search algorithms
Success
Theoretical
Time dependence
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c316t-20426873fc9ac2867620dab6fe7d48df52d30a8a3f38cc88847eeb51685b1c843
cites cdi_FETCH-LOGICAL-c316t-20426873fc9ac2867620dab6fe7d48df52d30a8a3f38cc88847eeb51685b1c843
container_end_page 949
container_issue 3
container_start_page 939
container_title International journal of theoretical physics
container_volume 58
creator Li, Feng-Guang
Bao, Wan-Su
Li, Tan
Huang, He-liang
Zhang, Shuo
Fu, Xiang-Qun
description In nonadiabatic quantum search algorithm, it is difficult to calculate the success rate analytically. We develop the nonadiabatic quantum search algorithm by adding a counterdiabatic driving term to the original time-dependent Hamiltonian. The Hamiltonian we structured is diagonal in eigen picture and the time-independent Schrödinger equation is solved analytically. Then, we get an accurate analytical expression of success rate in nonadiabatic quantum search algorithm. Utilizing this expression, a sufficient condition, which can ensure the success rate be one with arbitrary evolution time, was found. Moreover, we can choose the better parameters by calculating the precise success rate according to the expression.
doi_str_mv 10.1007/s10773-018-3986-x
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2185102591</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2185102591</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-20426873fc9ac2867620dab6fe7d48df52d30a8a3f38cc88847eeb51685b1c843</originalsourceid><addsrcrecordid>eNp1kMtOwzAQRS0EEqXwAewisTaM7dieLEvFS6pAUFhbjuO0qdKk2Ilo_56gILFiM3dz7tXoEHLJ4JoB6JvIQGtBgSEVGSq6PyITJjWnmdTymEwAOFCtUzwlZzFuACCDFCfk9rltbFHZ3HaVS15723T9Nll6G9w6mdWrNlTdept8DTeZNbY-DJitk2XvnI8xebOdPycnpa2jv_jNKfm4v3ufP9LFy8PTfLagTjDVUQ4pV6hF6TLrOCqtOBQ2V6XXRYpFKXkhwKIVpUDnEDHV3ueSKZQ5c5iKKbkad3eh_ex97Mym7cPwUzScoWTAZcYGio2UC22MwZdmF6qtDQfDwPyoMqMqM6gyP6rMfujwsRMHtln58Lf8f-kb9jBryA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2185102591</pqid></control><display><type>article</type><title>Nonadiabatic Quantum Search Algorithm with Analytical Success Rate</title><source>Springer Nature</source><creator>Li, Feng-Guang ; Bao, Wan-Su ; Li, Tan ; Huang, He-liang ; Zhang, Shuo ; Fu, Xiang-Qun</creator><creatorcontrib>Li, Feng-Guang ; Bao, Wan-Su ; Li, Tan ; Huang, He-liang ; Zhang, Shuo ; Fu, Xiang-Qun</creatorcontrib><description>In nonadiabatic quantum search algorithm, it is difficult to calculate the success rate analytically. We develop the nonadiabatic quantum search algorithm by adding a counterdiabatic driving term to the original time-dependent Hamiltonian. The Hamiltonian we structured is diagonal in eigen picture and the time-independent Schrödinger equation is solved analytically. Then, we get an accurate analytical expression of success rate in nonadiabatic quantum search algorithm. Utilizing this expression, a sufficient condition, which can ensure the success rate be one with arbitrary evolution time, was found. Moreover, we can choose the better parameters by calculating the precise success rate according to the expression.</description><identifier>ISSN: 0020-7748</identifier><identifier>EISSN: 1572-9575</identifier><identifier>DOI: 10.1007/s10773-018-3986-x</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Elementary Particles ; Mathematical analysis ; Mathematical and Computational Physics ; Physics ; Physics and Astronomy ; Quantum computing ; Quantum Field Theory ; Quantum Physics ; Schrodinger equation ; Search algorithms ; Success ; Theoretical ; Time dependence</subject><ispartof>International journal of theoretical physics, 2019-03, Vol.58 (3), p.939-949</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-20426873fc9ac2867620dab6fe7d48df52d30a8a3f38cc88847eeb51685b1c843</citedby><cites>FETCH-LOGICAL-c316t-20426873fc9ac2867620dab6fe7d48df52d30a8a3f38cc88847eeb51685b1c843</cites><orcidid>0000-0002-2693-4018</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Li, Feng-Guang</creatorcontrib><creatorcontrib>Bao, Wan-Su</creatorcontrib><creatorcontrib>Li, Tan</creatorcontrib><creatorcontrib>Huang, He-liang</creatorcontrib><creatorcontrib>Zhang, Shuo</creatorcontrib><creatorcontrib>Fu, Xiang-Qun</creatorcontrib><title>Nonadiabatic Quantum Search Algorithm with Analytical Success Rate</title><title>International journal of theoretical physics</title><addtitle>Int J Theor Phys</addtitle><description>In nonadiabatic quantum search algorithm, it is difficult to calculate the success rate analytically. We develop the nonadiabatic quantum search algorithm by adding a counterdiabatic driving term to the original time-dependent Hamiltonian. The Hamiltonian we structured is diagonal in eigen picture and the time-independent Schrödinger equation is solved analytically. Then, we get an accurate analytical expression of success rate in nonadiabatic quantum search algorithm. Utilizing this expression, a sufficient condition, which can ensure the success rate be one with arbitrary evolution time, was found. Moreover, we can choose the better parameters by calculating the precise success rate according to the expression.</description><subject>Algorithms</subject><subject>Elementary Particles</subject><subject>Mathematical analysis</subject><subject>Mathematical and Computational Physics</subject><subject>Physics</subject><subject>Physics and Astronomy</subject><subject>Quantum computing</subject><subject>Quantum Field Theory</subject><subject>Quantum Physics</subject><subject>Schrodinger equation</subject><subject>Search algorithms</subject><subject>Success</subject><subject>Theoretical</subject><subject>Time dependence</subject><issn>0020-7748</issn><issn>1572-9575</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp1kMtOwzAQRS0EEqXwAewisTaM7dieLEvFS6pAUFhbjuO0qdKk2Ilo_56gILFiM3dz7tXoEHLJ4JoB6JvIQGtBgSEVGSq6PyITJjWnmdTymEwAOFCtUzwlZzFuACCDFCfk9rltbFHZ3HaVS15723T9Nll6G9w6mdWrNlTdept8DTeZNbY-DJitk2XvnI8xebOdPycnpa2jv_jNKfm4v3ufP9LFy8PTfLagTjDVUQ4pV6hF6TLrOCqtOBQ2V6XXRYpFKXkhwKIVpUDnEDHV3ueSKZQ5c5iKKbkad3eh_ex97Mym7cPwUzScoWTAZcYGio2UC22MwZdmF6qtDQfDwPyoMqMqM6gyP6rMfujwsRMHtln58Lf8f-kb9jBryA</recordid><startdate>20190315</startdate><enddate>20190315</enddate><creator>Li, Feng-Guang</creator><creator>Bao, Wan-Su</creator><creator>Li, Tan</creator><creator>Huang, He-liang</creator><creator>Zhang, Shuo</creator><creator>Fu, Xiang-Qun</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-2693-4018</orcidid></search><sort><creationdate>20190315</creationdate><title>Nonadiabatic Quantum Search Algorithm with Analytical Success Rate</title><author>Li, Feng-Guang ; Bao, Wan-Su ; Li, Tan ; Huang, He-liang ; Zhang, Shuo ; Fu, Xiang-Qun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-20426873fc9ac2867620dab6fe7d48df52d30a8a3f38cc88847eeb51685b1c843</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Elementary Particles</topic><topic>Mathematical analysis</topic><topic>Mathematical and Computational Physics</topic><topic>Physics</topic><topic>Physics and Astronomy</topic><topic>Quantum computing</topic><topic>Quantum Field Theory</topic><topic>Quantum Physics</topic><topic>Schrodinger equation</topic><topic>Search algorithms</topic><topic>Success</topic><topic>Theoretical</topic><topic>Time dependence</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Feng-Guang</creatorcontrib><creatorcontrib>Bao, Wan-Su</creatorcontrib><creatorcontrib>Li, Tan</creatorcontrib><creatorcontrib>Huang, He-liang</creatorcontrib><creatorcontrib>Zhang, Shuo</creatorcontrib><creatorcontrib>Fu, Xiang-Qun</creatorcontrib><collection>CrossRef</collection><jtitle>International journal of theoretical physics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Feng-Guang</au><au>Bao, Wan-Su</au><au>Li, Tan</au><au>Huang, He-liang</au><au>Zhang, Shuo</au><au>Fu, Xiang-Qun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Nonadiabatic Quantum Search Algorithm with Analytical Success Rate</atitle><jtitle>International journal of theoretical physics</jtitle><stitle>Int J Theor Phys</stitle><date>2019-03-15</date><risdate>2019</risdate><volume>58</volume><issue>3</issue><spage>939</spage><epage>949</epage><pages>939-949</pages><issn>0020-7748</issn><eissn>1572-9575</eissn><abstract>In nonadiabatic quantum search algorithm, it is difficult to calculate the success rate analytically. We develop the nonadiabatic quantum search algorithm by adding a counterdiabatic driving term to the original time-dependent Hamiltonian. The Hamiltonian we structured is diagonal in eigen picture and the time-independent Schrödinger equation is solved analytically. Then, we get an accurate analytical expression of success rate in nonadiabatic quantum search algorithm. Utilizing this expression, a sufficient condition, which can ensure the success rate be one with arbitrary evolution time, was found. Moreover, we can choose the better parameters by calculating the precise success rate according to the expression.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10773-018-3986-x</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0002-2693-4018</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0020-7748
ispartof International journal of theoretical physics, 2019-03, Vol.58 (3), p.939-949
issn 0020-7748
1572-9575
language eng
recordid cdi_proquest_journals_2185102591
source Springer Nature
subjects Algorithms
Elementary Particles
Mathematical analysis
Mathematical and Computational Physics
Physics
Physics and Astronomy
Quantum computing
Quantum Field Theory
Quantum Physics
Schrodinger equation
Search algorithms
Success
Theoretical
Time dependence
title Nonadiabatic Quantum Search Algorithm with Analytical Success Rate
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T22%3A57%3A16IST&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=Nonadiabatic%20Quantum%20Search%20Algorithm%20with%20Analytical%20Success%20Rate&rft.jtitle=International%20journal%20of%20theoretical%20physics&rft.au=Li,%20Feng-Guang&rft.date=2019-03-15&rft.volume=58&rft.issue=3&rft.spage=939&rft.epage=949&rft.pages=939-949&rft.issn=0020-7748&rft.eissn=1572-9575&rft_id=info:doi/10.1007/s10773-018-3986-x&rft_dat=%3Cproquest_cross%3E2185102591%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c316t-20426873fc9ac2867620dab6fe7d48df52d30a8a3f38cc88847eeb51685b1c843%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2185102591&rft_id=info:pmid/&rfr_iscdi=true