Quantum computers and unstructured search: Finding and counting items with an arbitrarily entangled initial state

A. Carlini; A. Hosoya

doi:10.1016/S0375-9601(01)00025-1

Quantum computers and unstructured search: Finding and counting items with an arbitrarily entangled initial state

A. Carlini
, A. Hosoya

Risultato della ricerca: Contributo su rivista › Articolo in rivista › peer review

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 environment are coupled, and in general when the control over the quantum system is partial.

Lingua originale	Inglese
pagine (da-a)	114-120
Numero di pagine	7
Rivista	Physics Letters, Section A: General, Atomic and Solid State Physics
Volume	280
Numero di pubblicazione	3
DOI	https://doi.org/10.1016/S0375-9601(01)00025-1
Stato di pubblicazione	Pubblicato - 19 feb 2001
Pubblicato esternamente	Sì

Accesso al documento

10.1016/S0375-9601(01)00025-1

Altri file e collegamenti

Link to publication in Scopus

Cita questo

@article{6f8787ccad514653a52eeb359145d3ba,

title = "Quantum computers and unstructured search: Finding and counting items with an arbitrarily entangled initial state",

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 environment are coupled, and in general when the control over the quantum system is partial.",

author = "A. Carlini and A. Hosoya",

note = "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. ",

year = "2001",

month = feb,

day = "19",

doi = "10.1016/S0375-9601(01)00025-1",

language = "English",

volume = "280",

pages = "114--120",

journal = "Physics Letters, Section A: General, Atomic and Solid State Physics",

issn = "0375-9601",

publisher = "Elsevier BV",

number = "3",

}

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 - https://www.scopus.com/pages/publications/0035910899

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 -

Quantum computers and unstructured search: Finding and counting items with an arbitrarily entangled initial state

Abstract

Accesso al documento

Altri file e collegamenti

Fingerprint

Cita questo