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.
Author: LOV K. GROVER
Institution: Alcatel-Lucent (France)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Army Research Office
OpenAlex ID: W1981532619
