An FPGA-Based Quantum Computing Emulation Framework Based on Serial-Parallel Architecture

Y H Lee,M Khalil-Hani,M N Marsono

doi:10.1155/2016/5718124

Abstract

Hardware emulation of quantum systems can mimic more efficiently the parallel behaviour of quantum computations, thus allowing higher processing speed-up than software simulations. In this paper, an efficient hardware emulation method that employs a serial-parallel hardware architecture targeted for field programmable gate array (FPGA) is proposed. Quantum Fourier transform and Grover’s search are chosen as case studies in this work since they are the core of many useful quantum algorithms. Experimental work shows that, with the proposed emulation architecture, a linear reduction in resource utilization is attained against the pipeline implementations proposed in prior works. The proposed work contributes to the formulation of a proof-of-concept baseline FPGA emulation framework with optimization on datapath designs that can be extended to emulate practical large-scale quantum circuits.

Highlights

Quantum computing is based on the properties of quantum mechanics, namely, superposition and entanglement
We propose an accurate modelling of quantum system for field programmable gate array (FPGA) emulation, targeting efficient resource utilization while maintaining significant speed-up over the equivalent simulation approach
Since the discrete Fourier transform (DFT) is a linear transformation that can be defined in unitary matrix form, the functional correctness of our quantum Fourier transform (QFT) hardware emulation model can be conveniently verified against the DFT matrix

Summary

Introduction

Quantum computing is based on the properties of quantum mechanics, namely, superposition and entanglement. Superposition and entanglement facilitate massive parallelism which enables exponential speed-ups to be achieved in the well-known integer factoring and discrete logarithms algorithms [1] and quadratic speed-ups in solving classically intractable brute-force searching and optimization problems [2, 3]. In 1994, Shor proposed the integer factoring and discrete logarithms algorithms [1] that brought the world’s attention to the enormous potential of quantum computing. An example of this is the RivestShamir-Adleman (RSA) security scheme [4] which is widely applied in current public key cryptosystem. Quantum equivalents for random walks [6], genetic algorithms [3], and NAND tree evaluation [7] have been developed

Methods

Results

Conclusion