An Improved Quantum Scheduling Algorithm

Simple item page
dc.creatorGrover, Lov K.
dc.date2002-02-05
dc.date.accessioned2026-07-07T06:03:39Z
dc.date.available2026-07-07T06:03:39Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/quant-ph/0202033
dc.identifierhttp://arxiv.org/abs/quant-ph/0202033
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90020
dc.subjectQuantum Physics
dc.titleAn Improved Quantum Scheduling Algorithm
dc.typetext

Files

Collections

arXiv