Memory Efficient Quantum Circuit Simulator Based on Linked List Architecture

In this paper, we will introduce the quantum circuit simulator we developed in C++ environment. We devise a novel method for efficient memory handling using linked list structures that enables us to simulate a quantum circuit of up to 20 qubits in a reasonable time. Our package can simulate the activity of any quantum circuit constructed by the user; it will also be used to understand the robustness of certain quantum algorithms such as Simons and Shors.

[1]  Lov K. Grover,et al.  Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[2]  John Fitch,et al.  Course notes , 1975, SIGS.

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

[4]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.