Parallel simulation of Shor's and Grover's algorithms in the distributed geometric machine | IEEE Conference Publication | IEEE Xplore

Parallel simulation of Shor's and Grover's algorithms in the distributed geometric machine


Abstract:

The exponential increase and global access to read/write memory states in quantum computing simulation limit both the number of qubits and quantum transformations that ca...Show More

Abstract:

The exponential increase and global access to read/write memory states in quantum computing simulation limit both the number of qubits and quantum transformations that can be currently simulated. Although quantum computing simulation is parallel by nature, spatial complexity and memory access patterns are major performance hazards. A new methodology employs reduction and decomposition optimizations, exploring properties such as the sparsity of the Id-Operator and the partiality of dense unitary transformations to improve storage and distribution of quantum states. In this work, Shor's and Grover's algorithms are simulated in both CPU and GPU in the Distributed Geometric Machine environment. Additionally, they are compared to LIQUi|〉's results. In all cases, our simulation was faster and allowed for an improved number of qubits when compared to the academic release version of LIQUi|〉, with relative speedups up to 118×.
Date of Conference: 29-31 July 2017
Date Added to IEEE Xplore: 25 June 2018
ISBN Information:
Conference Location: Guilin, China

References

References is not available for this document.