An Improved Quantum Scheduling Algorithm

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 ∊N. Classically, it needs Ω(∊N log2 N) bits of communication to find the common 1. The best known quantum algorithms require about qubits of communication. This paper gives a quantum algorithm to find the common 1 with only qubits of communication.