2019
Grover search under localized dephasing
REITZNER, Daniel a Mark HILLERYZákladní údaje
Originální název
Grover search under localized dephasing
Autoři
REITZNER, Daniel (703 Slovensko, domácí) a Mark HILLERY (840 Spojené státy)
Vydání
Physical Review A, MD USA, AMERICAN PHYSICAL SOCIETY, 2019, 2469-9926
Další údaje
Jazyk
angličtina
Typ výsledku
Článek v odborném periodiku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Spojené státy
Utajení
není předmětem státního či obchodního tajemství
Odkazy
Impakt faktor
Impact factor: 2.777
Kód RIV
RIV/00216224:14330/19:00108144
Organizační jednotka
Fakulta informatiky
UT WoS
000456481200001
Klíčová slova česky
kvantova informace; kvantové vyhledávání
Klíčová slova anglicky
quantum information; quantum search
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 14. 6. 2022 11:54, RNDr. Pavel Šmerk, Ph.D.
Anotace
V originále
Decoherence in quantum searches, and in the Grover search, in particular, has already been extensively studied, leading very quickly to the loss of the quadratic speedup over the classical case, when searching for some target (marked) element within a set of size N. The noise models used were, however, almost always global. In this paper, we study Grover search under the influence of localized partially dephasing noise of rate p. We find that, in the case when the size k of the affected subspace is much smaller than N and the target is unaffected by the noise, namely when kp << root N, the quadratic speedup is retained. Once these restrictions are not met, the quadratic speedup is lost. If the target is affected by the noise, the noise rate needs to scale as 1/root N to keep the speedup. We also observe an intermediate region, where if k similar to N-mu and the target is unaffected, the speedup seems to obey N-mu, which for mu > 0.5 is worse than the quantum, but better than the classical case. We also put obtained results for quantum searches into perspective of quantum walks and searches on graphs.
Návaznosti
GA16-22211S, projekt VaV |
|