Noise resilience and entanglement evolution in two nonequivalent classes of quantum algorithms
- School of Mathematics and Physics, Queen's University, Belfast BT7 1NN (United Kingdom)
The speedup 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 speedup 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 nonequivalent 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 initial preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.
- OSTI ID:
- 20982485
- Journal Information:
- Physical Review. A, Vol. 75, Issue 5; Other Information: DOI: 10.1103/PhysRevA.75.052316; (c) 2007 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Application of quantum machine learning using the quantum kernel algorithm on high energy physics analysis at the LHC
Noise resilience of variational quantum compiling