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

DOI10.1016/S0375-9601(01)00025-1zbMath0972.81020arXivquant-ph/9909089MaRDI QIDQ1840940

A. Hosoya, A. Carlini

Publication date: 20 February 2001

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/9909089

zbMATH Keywords

coupled commputational qubitspartial quantum system controlunstructured search quantum algorithm

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (6)

From orthogonal projections to a generalized quantum search ⋮ Quantum search in a possible three-dimensional complex subspace ⋮ A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace ⋮ Experimental NMR realization of a generalized quantum search algorithm ⋮ Phase matching condition for quantum search with a generalized initial state ⋮ Algebraic analysis of quantum search with pure and mixed states

Cites Work

• Unnamed Item
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Phase matching in quantum searching.
• Quantum Computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing

This page was built for publication: Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state