Équipe de Recherche en Physique de l'Information Quantique


Abstract = { We present an efficient quantum algorithm to measure the average
fidelity decay of a quantum map under perturbation using a single
bit of quantum information. Our algorithm scales only as the
complexity of the map under investigation, so for those maps
admitting an efficient gate decomposition, it provides an
exponential speed up over known classical procedures. Fidelity
decay is important in the study of complex dynamical systems, where
it is conjectured to be a signature of eigenvector statistics. Our
result also illustrates the role of chaos in the process of
Author = {Poulin, D. and Blume-Kohout, R. and Laflamme, R. and Ollivier, H.},
Correct_Ref = {Yes},
Date-Added = {2006-01-05 17:11:02 -0500},
Date-Modified = {2010-05-06 13:58:48 -0400},
Eprint = {quant-ph/0310038},
Journal = {Phys. Rev. Lett.},
Keywords = {Quantum chaos; Quantum simulation},
Local-Url = {PBLO04b.pdf},
Number = {17},
Pages = {177906},
Read = {Yes},
Source = {H. Ollivier, 2006-01-05},
Title = {Exponential Speedup with a Single Bit of Quantum Information: Measuring the Average Fidelity Decay},
Volume = {92},
Year = {2004}}