Work

An Improved Quantum Scheduling Algorithm

Year: 2003
Type: article
Abstract: 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 log 2 N) bits of communication to find the common 1. The best known quantum algorithms require about [Formula: see text] qubits of communication. This paper gives a quantum algorithm to find the common 1 with only [Formula: see text] qubits of communication.
Language: English
Open Access status: green
OpenAlex ID: W1981532619
FWCI: 0.567
Cites: 8
Cited by: 7
Related to: 10