Shortening Grover's search algorithm for an expectation value quantum computer

Details Shortening Grover's search algorithm for an expectation value quantum computer Shortening Grover's search algorithm for an expectation value quantum computer

2002-09-26

arxiv.org/abs/quant-ph/0209148v1

Physics

Quantum Physics

To appear in the proceedings of QCMC'02

Scientific paper

Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value implementations of quantum algorithms has been to retain the conventional formulation's unitary operations but modify its initialization and measurement steps appropriately. This naive approach is not optimal for Grover's algorithm and a shortened version for expectation value quantum computers is presented.

Affiliated with

Also associated with

No associations

Rating

Shortening Grover's search algorithm for an expectation value quantum computer 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 Shortening Grover's search algorithm for an expectation value quantum computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shortening Grover's search algorithm for an expectation value quantum computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524237