An Improved Quantum Scheduling Algorithm
Lov K. Grover
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.
Create a lesson
Related papers
Generative learning of time series with holographic quantum circuit sampling
Bingzhi Zhang, Matthew W. Lee, Tom Finke et al.
Entanglement detection in dynamical quantum systems
Xingjian Zhang, Jiayi Wu, Jue Xu et al.
Partial-coherence weak measurement of polarization qubits with a temporal pointer: theory and experiment
Shane P. Gervais, Lambert Giner
A complete classification of operator controllability for closed three-level quantum systems driven by a single control
Sergey Kuznetsov, Alexander Pechen
Entanglement generation from degeneracy breaking of superradiant Liouvillian steady states by local operations
Adam Burgess, Erik M. Gauger
Classical Communication Helps Single-Shot Quantum Compression
Omri Farber, Gilad Gour