Quantum Probes Reduce Measurements: Application to Distributed Grover   Algorithm
  Distributed computing seems to be a natural approach to overcome size limitations of quantum computers in terms of number of qubits. But one lacks an efficient distribution approach to deal systematically with potential algorithms. This work proposes suitable quantum probes to reduce measurements in distributed sub-systems. Probes are introduced in the context of distributed Grover search. These are shown to be indeed efficient. The latter can be generalized to be applicable to other distributed algorithms of interest. 
Iaakov Exman and Efrat Levy
quant-ph