Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State

Simple item page
dc.creatorCarlini, A.
dc.creatorHosoya, A.
dc.date1999-09-29
dc.date2001-01-22
dc.date.accessioned2026-07-07T06:16:59Z
dc.date.available2026-07-07T06:16:59Z
dc.descriptionGrover'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.
dc.descriptionCompletely revised version, accepted for publ. on PLA.; 11 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/9909089
dc.identifierhttp://arxiv.org/abs/quant-ph/9909089
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94255
dc.subjectQuantum Physics
dc.titleQuantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State
dc.typetext

Files

Collections

arXiv