Quantum advantage and noise reduction in distributed quantum computing
arXiv:2104.07817 · doi:10.1103/PhysRevA.104.052404
Abstract
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 = log2(N). The distributed Deutsch-Jozsa deteriorates to being probabilistic but retains a quantum advantage over classical random sampling.
arXiv commentv3: Changes made according to referees responses while submitting to Physical Review A
References in corpus (7)
- Elementary gates for quantum computation
- Distributed Quantum Computation over Noisy Channels
- Trading classical and quantum computational resources
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Introduction to Quantum Algorithms
- Computational speedups using small quantum devices
- Representation of Boolean functions in terms of quantum computation