Distributed quantum computing with classical communications allows to relieve some of the limitat... more Distributed quantum computing with classical communications allows to relieve some of the limitations on the number of qubits and mitigate the noise in quantum computers. We give an algorithm that transforms a quantum circuit on a single processor to equivalent circuits on distributed processors. We address the quantum advantage of distributed circuits for the Grover search, Simon’s and the Deutsch-Jozsa problems. In the case of Grover the quantum advantage of distributed computing remains the same, i.e. O( √ N). In the case of Simon it remains exponential, but the complexity deteriorates from O(n) to O(n), where n = log 2 (N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling: A single quantum query gives the same error as O(n) random sampling. In section 5 we describe an experiment with the IBMQ5 machines that illustrates the advantages of distributed Grover search.
Distributed quantum computing can give substantial noise reduction due to shallower circuits. An ... more Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n 2), where n = log 2 (N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.
Distributed quantum computing with classical communications allows to relieve some of the limitat... more Distributed quantum computing with classical communications allows to relieve some of the limitations on the number of qubits and mitigate the noise in quantum computers. We give an algorithm that transforms a quantum circuit on a single processor to equivalent circuits on distributed processors. We address the quantum advantage of distributed circuits for the Grover search, Simon’s and the Deutsch-Jozsa problems. In the case of Grover the quantum advantage of distributed computing remains the same, i.e. O( √ N). In the case of Simon it remains exponential, but the complexity deteriorates from O(n) to O(n), where n = log 2 (N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling: A single quantum query gives the same error as O(n) random sampling. In section 5 we describe an experiment with the IBMQ5 machines that illustrates the advantages of distributed Grover search.
Distributed quantum computing can give substantial noise reduction due to shallower circuits. An ... more Distributed quantum computing can give substantial noise reduction due to shallower circuits. An experiment illustrates the advantages in the case of Grover search. This motivates studying the quantum advantage of the distributed version of the Simon and Deutsch-Jozsa algorithm. We show that the distributed Simon algorithm retains the exponential advantage, but the complexity deteriorates from O(n) to O(n 2), where n = log 2 (N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.
Uploads
Papers by Ofer Casper