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

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

1999-09-29

arxiv.org/abs/quant-ph/9909089v3

Physics

Quantum Physics

Completely revised version, accepted for publ. on PLA.; 11 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548756