TY - JOUR
T1 - Quantum computers and unstructured search
T2 - Finding and counting items with an arbitrarily entangled initial state
AU - Carlini, A.
AU - Hosoya, A.
N1 - Funding Information:
A.H.'s research was partially supported by the Ministry of Education, Science, Sports and Culture of Japan, under grant no. 09640341. A.C.'s research was supported by the EU under the Science and Technology Fellowship Programme in Japan, grant no. ERBIC17CT970007; he also thanks the cosmology group at Tokyo Institute of Technology for the kind hospitality during this work.
PY - 2001/2/19
Y1 - 2001/2/19
N2 - 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 environment are coupled, and in general when the control over the quantum system is partial.
AB - 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 environment are coupled, and in general when the control over the quantum system is partial.
UR - http://www.scopus.com/inward/record.url?scp=0035910899&partnerID=8YFLogxK
U2 - 10.1016/S0375-9601(01)00025-1
DO - 10.1016/S0375-9601(01)00025-1
M3 - Article
SN - 0375-9601
VL - 280
SP - 114
EP - 120
JO - Physics Letters, Section A: General, Atomic and Solid State Physics
JF - Physics Letters, Section A: General, Atomic and Solid State Physics
IS - 3
ER -