Share Email Print

Proceedings Paper

A space-efficient quantum computer simulator suitable for high-speed FPGA implementation
Author(s): Michael P. Frank; Liviu Oniciuc; Uwe H. Meyer-Baese; Irinel Chiorescu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Conventional vector-based simulators for quantum computers are quite limited in the size of the quantum circuits they can handle, due to the worst-case exponential growth of even sparse representations of the full quantum state vector as a function of the number of quantum operations applied. However, this exponential-space requirement can be avoided by using general space-time tradeoffs long known to complexity theorists, which can be appropriately optimized for this particular problem in a way that also illustrates some interesting reformulations of quantum mechanics. In this paper, we describe the design and empirical space/time complexity measurements of a working software prototype of a quantum computer simulator that avoids excessive space requirements. Due to its space-efficiency, this design is well-suited to embedding in single-chip environments, permitting especially fast execution that avoids access latencies to main memory. We plan to prototype our design on a standard FPGA development board.

Paper Details

Date Published: 27 April 2009
PDF: 12 pages
Proc. SPIE 7342, Quantum Information and Computation VII, 734203 (27 April 2009); doi: 10.1117/12.817924
Show Author Affiliations
Michael P. Frank, Florida State Univ. College of Engineering (United States)
Liviu Oniciuc, Florida State Univ. College of Engineering (United States)
Uwe H. Meyer-Baese, Florida State Univ. College of Engineering (United States)
Irinel Chiorescu, National High Magnetic Field Lab. (United States)

Published in SPIE Proceedings Vol. 7342:
Quantum Information and Computation VII
Eric J. Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top