Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State

Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State

Physical Review A 66:062301 (2002) The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Biham, Eli, Kenigsberg, Dan
Format: Artikel
Sprache:eng
Schlagworte:
Physics - Quantum Physics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Biham, Eli
Kenigsberg, Dan
description Physical Review A 66:062301 (2002) The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states carrying high entropy, the generalized Grover algorithm is considerably faster than any classical algorithm.
doi_str_mv 10.48550/arxiv.quant-ph/0306183
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_quant_ph_0306183</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>quant_ph_0306183</sourcerecordid><originalsourceid>FETCH-arxiv_primary_quant_ph_03061833</originalsourceid><addsrcrecordid>eNpjYJA3NNAzsTA1NdBPLKrILNMrLE3MK9EtyNA3MDYwM7Qw5mRwcy_KL0stUi9WCATJleYqBKcmFiVnKDjmpOcXZZZk5Cqk5RcpJOYpOBYlZZYUJRZVKnjmZZZkJuYo-GZWpKYoBJcklqTyMLCmJeYUp_JCaW4GVTfXEGcPXbC98QVFmblAnfFg--MLMuKh9hsTqw4AZ8RBOQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State</title><source>arXiv.org</source><creator>Biham, Eli ; Kenigsberg, Dan</creator><creatorcontrib>Biham, Eli ; Kenigsberg, Dan</creatorcontrib><description>Physical Review A 66:062301 (2002) The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states carrying high entropy, the generalized Grover algorithm is considerably faster than any classical algorithm.</description><identifier>DOI: 10.48550/arxiv.quant-ph/0306183</identifier><language>eng</language><subject>Physics - Quantum Physics</subject><creationdate>2003-06</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/quant-ph/0306183$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.quant-ph/0306183$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1103/PhysRevA.66.062301$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Biham, Eli</creatorcontrib><creatorcontrib>Kenigsberg, Dan</creatorcontrib><title>Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State</title><description>Physical Review A 66:062301 (2002) The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states carrying high entropy, the generalized Grover algorithm is considerably faster than any classical algorithm.</description><subject>Physics - Quantum Physics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA3NNAzsTA1NdBPLKrILNMrLE3MK9EtyNA3MDYwM7Qw5mRwcy_KL0stUi9WCATJleYqBKcmFiVnKDjmpOcXZZZk5Cqk5RcpJOYpOBYlZZYUJRZVKnjmZZZkJuYo-GZWpKYoBJcklqTyMLCmJeYUp_JCaW4GVTfXEGcPXbC98QVFmblAnfFg--MLMuKh9hsTqw4AZ8RBOQ</recordid><startdate>20030626</startdate><enddate>20030626</enddate><creator>Biham, Eli</creator><creator>Kenigsberg, Dan</creator><scope>GOX</scope></search><sort><creationdate>20030626</creationdate><title>Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State</title><author>Biham, Eli ; Kenigsberg, Dan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_quant_ph_03061833</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Biham, Eli</creatorcontrib><creatorcontrib>Kenigsberg, Dan</creatorcontrib><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Biham, Eli</au><au>Kenigsberg, Dan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State</atitle><date>2003-06-26</date><risdate>2003</risdate><abstract>Physical Review A 66:062301 (2002) The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states carrying high entropy, the generalized Grover algorithm is considerably faster than any classical algorithm.</abstract><doi>10.48550/arxiv.quant-ph/0306183</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.quant-ph/0306183
ispartof
issn
language eng
recordid cdi_arxiv_primary_quant_ph_0306183
source arXiv.org
subjects Physics - Quantum Physics
title Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T17%3A55%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Grover's%20Quantum%20Search%20Algorithm%20for%20an%20Arbitrary%20Initial%20Mixed%20State&rft.au=Biham,%20Eli&rft.date=2003-06-26&rft_id=info:doi/10.48550/arxiv.quant-ph/0306183&rft_dat=%3Carxiv_GOX%3Equant_ph_0306183%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true