Quantum Probes Reduce Measurements: Application to Distributed Grover Algorithm

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.

arXiv comment5 pages

References in corpus (11)

• Quantum Mechanics helps in searching for a needle in a haystack
• Grover's quantum searching algorithm is optimal
• Quantum computers can search arbitrarily large databases by a single query
• Sophisticated quantum search without entanglement
• Quantum search without entanglement
• Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
• Generalized parity measurements
• Could Grover's quantum algorithm help in searching an actual database?
• A Framework for Structured Quantum Search
• Measuring the parity of an $N$-qubit state
• A Cat-State Benchmark on a Seven Bit Quantum Computer