An Improved Quantum Scheduling Algorithm

Details An Improved Quantum Scheduling Algorithm An Improved Quantum Scheduling Algorithm

2002-02-05

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

Physics

Quantum Physics

Scientific paper

The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by epsilon*N. Classically, it needs at least O(epsilon*N) bits of communication to find the common 1 (ignoring logarithmic factors). The best known quantum algorithm would require O(sqrt(N)) qubits of communication. This paper gives a modified quantum algorithm to find the common 1 with only O(sqrt(epsilon*N)) qubits of communication.

Affiliated with

Also associated with

No associations

Rating

An Improved Quantum Scheduling Algorithm 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 An Improved Quantum Scheduling Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Quantum Scheduling Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-705427