Physics – Quantum Physics
Scientific paper
2007-01-27
Phys. Rev. A 75, 052316 (2007)
Physics
Quantum Physics
10 pages, 9 figures, RevTeX4
Scientific paper
10.1103/PhysRevA.75.052316
The speed-up provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speed-up are not yet completely understood and deserve further attention. In this context, the classical simulation of quantum algorithms is a useful tool that can help us in gaining insight. Starting from the study of general conditions for classical simulation, we highlight several important differences between two non-equivalent classes of quantum algorithms. We investigate their performance under realistic conditions by quantitatively studying their resilience with respect to static noise. This latter refers to errors affecting the inital preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.
Franco C. Di
Kim Min-Soo
Paternostro Mauro
No associations
LandOfFree
Noise resilience and entanglement evolution in two non-equivalent classes of quantum algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Noise resilience and entanglement evolution in two non-equivalent classes of quantum algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noise resilience and entanglement evolution in two non-equivalent classes of quantum algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-494011