A Fast Quantum Computer Simulator Based on Register Reordering

Masaki NAKANISHI  Miki MATSUYAMA  Yumi YOKOO  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E99-D   No.2   pp.332-340
Publication Date: 2016/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2015EDP7260
Type of Manuscript: PAPER
Category: Computer System
Keyword: 
quantum computer simulator,  hardware implementation,  register reordering,  

Full Text: PDF(568.7KB)>>
Buy this Article




Summary: 
Quantum computer simulators play an important role when we evaluate quantum algorithms. Quantum computation can be regarded as parallel computation in some sense, and thus, it is suitable to implement a simulator on hardware that can process a lot of operations in parallel. In this paper, we propose a hardware quantum computer simulator. The proposed simulator is based on the register reordering method that shifts and swaps registers containing probability amplitudes so that the probability amplitudes of target basis states can be quickly selected. This reduces the number of large multiplexers and improves clock frequency. We implement the simulator on an FPGA. Experiments show that the proposed simulator has scalability in terms of the number of quantum bits, and can simulate quantum algorithms faster than software simulators.