{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:24:19Z","timestamp":1648513459298},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,10]]},"abstract":"<jats:p> 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 \u220aN. Classically, it needs \u03a9(\u220aN log <jats:sub>2<\/jats:sub> 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. <\/jats:p>","DOI":"10.1142\/s0129054103001984","type":"journal-article","created":{"date-parts":[[2003,11,24]],"date-time":"2003-11-24T04:26:19Z","timestamp":1069647979000},"page":"715-721","source":"Crossref","is-referenced-by-count":0,"title":["AN IMPROVED QUANTUM SCHEDULING ALGORITHM"],"prefix":"10.1142","volume":"14","author":[{"given":"LOV K.","family":"GROVER","sequence":"first","affiliation":[{"name":"1D435 Bell Laboratories, Lucent Technologies, 600-700 Mountain Avenue, Murray Hill, NJ 07974, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf4","first-page":"1177","volume":"9","author":"Holevo A. S.","journal-title":"Problems of Information Transmission (USSR)"},{"key":"rf5","first-page":"325","volume":"78","author":"Grover L. K.","journal-title":"Phys. Rev. Letters"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.1334"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:37:41Z","timestamp":1565123861000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":4,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,10]]}},"alternative-id":["10.1142\/S0129054103001984"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001984","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}