By the same authors

From the same journal

From the same journal

Speed-up and entanglement in quantum searching

Research output: Contribution to journalArticlepeer-review

Author(s)

Department/unit(s)

Publication details

JournalQUANTUM INFORMATION COMPUTATION
DatePublished - 1 Sep 2002
Issue number5
Volume2
Number of pages11
Pages (from-to)399-409
Original languageUndefined/Unknown

Abstract

We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations