# An Improved Quantum Scheduling Algorithm

Source: [An Improved Quantum Scheduling Algorithm](<https://www.sota2.com/research/paper/68fa1fdd7a2b558e2932cd97>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-23T20:00:01.073Z

Authors: Lov K. Grover

Published: 2002-02-05T15:35:30.000Z

## 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 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/quant-ph/0202033>)

[PDF](<https://arxiv.org/pdf/quant-ph/0202033.pdf>)
