Noise resilience and entanglement evolution in two nonequivalent classes of quantum algorithms

C. Di Franco, Mauro Paternostro, Myungshik Kim

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

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.
Original languageEnglish
Article number052316
Pages (from-to)052316-052317
Number of pages2
JournalPhysical Review A
Volume75
Issue number5
DOIs
Publication statusPublished - 14 May 2007

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics
  • Physics and Astronomy(all)

Fingerprint

Dive into the research topics of 'Noise resilience and entanglement evolution in two nonequivalent classes of quantum algorithms'. Together they form a unique fingerprint.

Cite this