Noise‐induced sampling of alternative Hamiltonian paths in quantum adiabatic search
Identifieur interne : 000541 ( Istex/Curation ); précédent : 000540; suivant : 000542Noise‐induced sampling of alternative Hamiltonian paths in quantum adiabatic search
Auteurs : Frank Gaitan [États-Unis]Source :
- Complexity [ 1076-2787 ] ; 2009-07.
English descriptors
- KwdEn :
Abstract
We numerically simulate the effects of noise‐induced sampling of alternative Hamiltonian paths on the ability of quantum adiabatic search (QuAdS) to solve randomly generated instances of the NP‐complete problem N‐bit Exact Cover 3. The noise‐averaged median runtime is determined as the noise‐power and number of bits N are varied, and power‐law and exponential fits are made to the data. Noise is seen to slowdown QuAdS, though a downward shift in the scaling exponent is found for N > 12 over a range of noise‐power values. We discuss whether this shift might be connected to arguments in the literature that suggest that altering the Hamiltonian path might benefit QuAdS performance. © 2008 Wiley Periodicals, Inc. Complexity, 2009
Url:
DOI: 10.1002/cplx.20252
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000541
Links to Exploration step
ISTEX:E9D697E1350EB50FABB07933D4846298F3886097Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Noise‐induced sampling of alternative Hamiltonian paths in quantum adiabatic search</title><author><name sortKey="Gaitan, Frank" sort="Gaitan, Frank" uniqKey="Gaitan F" first="Frank" last="Gaitan">Frank Gaitan</name><affiliation wicri:level="2"><mods:affiliation>Department of Physics, Southern Illinois University, Carbondale, Illinois 62901‐4401</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Illinois</region></placeName><wicri:cityArea>Department of Physics, Southern Illinois University, Carbondale</wicri:cityArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E9D697E1350EB50FABB07933D4846298F3886097</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1002/cplx.20252</idno><idno type="url">https://api.istex.fr/document/E9D697E1350EB50FABB07933D4846298F3886097/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000541</idno><idno type="wicri:Area/Istex/Curation">000541</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Noise‐induced sampling of alternative Hamiltonian paths in quantum adiabatic search</title><author><name sortKey="Gaitan, Frank" sort="Gaitan, Frank" uniqKey="Gaitan F" first="Frank" last="Gaitan">Frank Gaitan</name><affiliation wicri:level="2"><mods:affiliation>Department of Physics, Southern Illinois University, Carbondale, Illinois 62901‐4401</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Illinois</region></placeName><wicri:cityArea>Department of Physics, Southern Illinois University, Carbondale</wicri:cityArea></affiliation></author></analytic><monogr></monogr><series><title level="j">Complexity</title><title level="j" type="abbrev">Complexity</title><idno type="ISSN">1076-2787</idno><idno type="eISSN">1099-0526</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2009-07">2009-07</date><biblScope unit="volume">14</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="21">21</biblScope><biblScope unit="page" to="27">27</biblScope></imprint><idno type="ISSN">1076-2787</idno></series><idno type="istex">E9D697E1350EB50FABB07933D4846298F3886097</idno><idno type="DOI">10.1002/cplx.20252</idno><idno type="ArticleID">CPLX20252</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1076-2787</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>NP‐Completeness</term><term>computational complexity</term><term>noise</term><term>quantum adiabatic search</term><term>quantum algorithms</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We numerically simulate the effects of noise‐induced sampling of alternative Hamiltonian paths on the ability of quantum adiabatic search (QuAdS) to solve randomly generated instances of the NP‐complete problem N‐bit Exact Cover 3. The noise‐averaged median runtime is determined as the noise‐power and number of bits N are varied, and power‐law and exponential fits are made to the data. Noise is seen to slowdown QuAdS, though a downward shift in the scaling exponent is found for N > 12 over a range of noise‐power values. We discuss whether this shift might be connected to arguments in the literature that suggest that altering the Hamiltonian path might benefit QuAdS performance. © 2008 Wiley Periodicals, Inc. Complexity, 2009</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000541 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000541 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:E9D697E1350EB50FABB07933D4846298F3886097
|texte= Noise‐induced sampling of alternative Hamiltonian paths in quantum adiabatic search
}}
| This area was generated with Dilib version V0.6.25. |  |