Scaling reconfigurable emulation of quantum algorithms at high precision and high throughput
Open Access
- 6 June 2019
- journal article
- research article
- Published by Hindawi Limited in Quantum Engineering
- Vol. 1 (2)
Abstract
The general approach for emulating quantum algorithms on classical platforms has been through representing them as gate‐based quantum circuits. However, direct implementation of quantum circuits significantly increases the hardware resource utilization and system latency of classical emulators. In this paper, we investigate multiple implementation models alternative to conventional emulation approaches, as feasible solutions to the scalability problem in classical emulation of quantum circuits. In the first model, the quantum circuit functionality is reduced to equivalent, arithmetic (multiply‐and‐accumulate) operations and combined with two computation methods, based on look‐up and dynamic generation. In the second model, a kernel operation is extracted from the quantum circuit based on its functionality, and the kernel is iterated through all input quantum states. The proposed emulation models provide space and time optimizations, significantly reducing resource utilizations and latencies and improving scalability. We use these models to develop a highly scalable hardware emulator that is based on reconfigurable technology for efficient simulations of full quantum algorithms and circuits. Our hardware implementations support single precision floating point arithmetic for improved accuracy, and contain fully pipelined designs for high throughput. We investigate quantum algorithms such as Quantum Fourier Transform (QFT) and Quantum Wavelet Transform (QWT) and explore different hardware architectures and optimizations. Experimental results and analysis are provided for the architectures in terms of resource consumption and emulation time. The experiments are carried out on a high‐performance reconfigurable computing (HPRC) system and the obtained results show that the proposed emulator is feasible for running and testing a variety of quantum algorithms.Keywords
This publication has 37 references indexed in Scilit:
- Realization of three-qubit quantum error correction with superconducting circuitsNature, 2012
- Obtaining the Quantum Fourier Transform from the classical FFT with QR decompositionJournal of Computational and Applied Mathematics, 2010
- Massively parallel quantum computer simulatorComputer Physics Communications, 2007
- General Quantum Interference Principle and Duality ComputerCommunications in Theoretical Physics, 2006
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985
- The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machinesJournal of Statistical Physics, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978