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

Physics Letters, Section A: General, Atomic and Solid State Physics

Volumn 280, Issue 3, 2001, Pages 114-120

  Carlini, A ^a   Hosoya, A ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM OPTICS; QUBITS;

INITIAL STATE; QUANTUM ALGORITHMS; QUANTUM SYSTEM; SEARCH PROBLEM;

QUANTUM ENTANGLEMENT;

ALGORITHM; ARTICLE; FOURIER TRANSFORMATION; MATHEMATICAL ANALYSIS; QUANTUM MECHANICS; QUANTUM THEORY;

EID: 0035910899     PISSN: 03759601     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0375-9601(01)00025-1     Document Type: Article

References (35)

1. Algorithms for quantum computation: Discrete logarithms and factoring
2. A fast quantum mechanical algorithm for database search
3. Tight bounds on quantum searching