 |
|
Subscribers:
to view the full text of a paper, click on the title of the paper. If you
have any problem to access the full text, please check with your librarian
or contact
[email protected]
To subscribe to QIC, please click
Here.
|
Quantum
Information and Computation
ISSN: 1533-7146
published since 2001
|
|
Vol.2 No.5, August 2002 |
|
Speed-up
and entanglement in quantum Searching
(pp399-409)
S.L. Braunstein and A.K. Pati
doi:
https://doi.org/10.26421/QIC2.5-6
Abstracts:
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.
Key words:
computational speed-up, quantum entanglement, Grover's algorithm
Pseudo-pure states |
�� |
