Quantum Probes Reduce Measurements: Application to Distributed Grover Algorithm

TL;DR

This paper introduces quantum probes to reduce measurement complexity in distributed quantum algorithms, demonstrated with Grover search, and suggests potential for broader application in distributed quantum computing.

Contribution

It proposes quantum probes as a novel method to minimize measurements in distributed quantum algorithms, specifically applied to Grover search.

Findings

Quantum probes effectively reduce measurement overhead.

Proposed method is efficient and generalizable to other algorithms.

Distributed Grover search benefits from reduced resource requirements.

Abstract

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.