Quantum computers and unstructured search: finding and counting items withan arbitrarily entangled initial state

Authors
Carlini, A Hosoya, A
Citation
A. Carlini et A. Hosoya, Quantum computers and unstructured search: finding and counting items withan arbitrarily entangled initial state, PHYS LETT A, 280(3), 2001, pp. 114-120
Citations number
32
Categorie Soggetti
Physics
Journal title
PHYSICS LETTERS A
ISSN journal
03759601 → ACNP
Volume
280
Issue
3
Year of publication
2001
Pages
114 - 120
Database
ISI
SICI code
0375-9601(20010219)280:3<114:QCAUSF>2.0.ZU;2-B
Abstract
Grover's quantum algorithm for an unstructured search problem and the COUNT algorithm by Brassard et al, are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum subroutines, when the computational qubits and the environmen t are coupled, and in general when the control over the quantum system is p artial. (C) 2001 Elsevier Science B.V. All rights reserved.