Distributed Quantum Computing – Classical and Quantum

This chapter consider three of distributed quantum computing algorithms: the distributed three‐party product problem, the distributed Deutsch–Jozsa promise problem, and the distributed intersection problem. It explains how quantum information can enable fewer bits of communication to be used for a distributed computing solution, as opposed to using just classical information. The chapter briefly considers several other quantum versions of distributed system protocols, including quantum coin flipping, quantum leader election, quantum key distribution, quantum voting, quantum oblivious transfer, and the quantum Byzantine Generals solution. Quantum keys are bit strings used for securing data, using encryption and decryption. Quantum voting is a key concept in democratic societies and quantum electronic voting protocols. The general idea is to use a quantum state as a kind of “ballot paper” where a voter can register a vote, and the voting result is obtained by counting the number of 1s and 0s obtained.