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

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×.

[1]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  Maurício L. Pilla,et al.  GPU-aware distributed quantum simulation , 2014, SAC.

[3]  Emilio L. Zapata,et al.  Quantum computer simulation using the CUDA programming model , 2010, Comput. Phys. Commun..

[4]  Krysta Marie Svore,et al.  LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing , 2014, ArXiv.

[5]  Maurício L. Pilla,et al.  Optimizing D-GM quantum computing by exploring parallel and distributed quantum simulations under GPUs arquitecture , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[6]  Maurício L. Pilla,et al.  Quantum computing simulation through reduction and decomposition optimizations with a case study of Shor's algorithm , 2017, Concurr. Comput. Pract. Exp..

[7]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[8]  Stefano Mancini,et al.  On Grovers search algorithm from a quantum information geometry viewpoint , 2011, 1110.6713.

[9]  Benjamín R. C. Bedregal,et al.  Correlations from conjugate and dual intuitionistic fuzzy triangular norms and conorms , 2013, 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS).

[10]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[11]  Renata Reiser,et al.  Optimizing Quantum Simulation for Heterogeneous Computing: a Hadamard Transformation Study , 2015 .

[12]  Thomas Lippert,et al.  Massively parallel quantum computer simulator , 2006, Comput. Phys. Commun..

[13]  Maurício L. Pilla,et al.  Quantum processes: A new interpretation for quantum transformations in the VPE-qGM environment , 2012, 2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI).

[14]  Maurício L. Pilla,et al.  Scalable quantum simulation by reductions and decompositions through the Id-operator , 2016, SAC.

[15]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[16]  Stéphane Beauregard.  Circuit for Shor's algorithm using 2n+3 qubits , 2003, Quantum Inf. Comput..

[17]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[18]  Jyh-Ching Juang,et al.  Quantum-inspired space search algorithm (QSSA) for global numerical optimization , 2011, Appl. Math. Comput..

[19]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.