0601116v1

related topics
{state, algorithm, problem}
{light, field, probe}
{time, wave, function}
{time, decoherence, evolution}
{error, code, errors}
{algorithm, log, probability}
{key, protocol, security}
{temperature, thermal, energy}
{entanglement, phys, rev}

Simulation of Quantum Adiabatic Search in the Presence of Noise

Frank Gaitan

abstract: Results are presented of a large-scale simulation of the quantum adiabatic search (QuAdS) algorithm in the presence of noise. The algorithm is applied to the NP-Complete problem Exact Cover 3 (EC3). The noise is assumed to Zeeman-couple to the qubits and its effects on the algorithm's performance is studied for various levels of noise power, and for 4 different types of noise polarization. We examine the scaling relation between the number of bits N (EC3 problem size) and the algorithm's noise-averaged median run-time . Clear evidence is found of the algorithm's sensitivity to noise. Two fits to the simulation results were done: (1) power-law scaling = aN**b; and (2) exponential scaling = a[exp(bN) - 1]. Both types of scaling relations provided excellent fits. We demonstrate how noise leads to decoherence in QuAdS, estimate the amount of decoherence in our simulations, and derive an upper bound for the noise-averaged QuAdS success probability in the weak noise limit appropriate for our simulations.

oai_identifier:
oai:arXiv.org:quant-ph/0601116
categories:
quant-ph
comments:
15 pages, 13 figures, 6 tables
arxiv_id:
quant-ph/0601116
journal_ref:
Int. J. Q. Info. vol. 4, 843-870 (2006)
report_no:
SIUC-1LPG: 06-01
created:
2006-01-17

Full article ▸

related documents
0001106v1
0108048v1
0206059v2
0504101v1
0405168v2
0301023v2
0212094v2
0611140v3
0605244v3
0702007v2
0609125v1
0611097v4
0611181v2
0612169v2
0606051v4
0701229v1
0702234v2
0701096v2
0612070v1
0602135v1
0608170v1
0608104v2
0610105v1
0606077v1
0602077v2