Characterization of quantum workloads on SIMD architectures

There is a growing research interest in quantum computing because of its promise to provide significant performance speedups over classical computers at specialized tasks. While there have been many advances in building more capable, robust, and useful quantum algorithms and software, it is not clear how a scalable, high-performance, and area-efficient quantum architecture should be designed for efficient execution of various quantum workloads. This paper attempts to fill this gap by performing a detailed characterization of many real-world quantum algorithms on SIMDstyle quantum architectures. Specifically, we characterize the effect of size and the number of SIMD regions of a quantum SIMD architecture on various metrics such as performance, utilization, qubit (data) movement etc. We hope that the presented insights on the trade-offs and relationships between aforementioned evaluation metrics will be useful towards designing an efficient and scalable quantum architecture.

[1]  Frederic T. Chong,et al.  Datapath and control for quantum wires , 2004, TACO.

[2]  Margaret Martonosi,et al.  Compiler Management of Communication and Parallelism for Quantum Computation , 2015, ASPLOS.

[3]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Frederic T. Chong,et al.  High-level interconnect model for the quantum logic array architecture , 2008, JETC.

[5]  Frederic T. Chong,et al.  Quantum Computing for Computer Architects, Second Edition , 2011, Quantum Computing for Computer Architects.

[6]  Margaret Martonosi,et al.  Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits , 2007, ISCA '07.

[7]  Sean Hallgren,et al.  Fast quantum algorithms for computing the unit group and class group of a number field , 2005, STOC '05.

[8]  Frederic T. Chong,et al.  Building quantum wires: the long and the short of it , 2003, 30th Annual International Symposium on Computer Architecture, 2003. Proceedings..

[9]  Chen-Fu Chiang,et al.  Scaffold: Quantum Programming Language , 2012 .

[10]  John Kubiatowicz,et al.  Automated generation of layout and control for quantum circuits , 2007, CF '07.

[11]  J. Whitfield,et al.  Simulation of electronic structure Hamiltonians using quantum computers , 2010, 1001.3855.

[12]  Frederic T. Chong,et al.  Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing , 2006, ISCA 2006.

[13]  Frederic T. Chong,et al.  Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers , 2013, ISCA.

[14]  John Kubiatowicz,et al.  Interconnection Networks for Scalable Quantum Computers , 2006, 33rd International Symposium on Computer Architecture (ISCA'06).

[15]  John Kubiatowicz,et al.  Running a Quantum Circuit at the Speed of Data , 2008, 2008 International Symposium on Computer Architecture.

[16]  Margaret Martonosi,et al.  ScaffCC: a framework for compilation and analysis of quantum computing programs , 2014, Conf. Computing Frontiers.

[17]  Keisuke Fujii,et al.  A quantum algorithm for additive approximation of Ising partition functions , 2014, ArXiv.

[18]  Frederic T. Chong,et al.  A Realizable Distributed Ion-Trap Quantum Computer , 2006, HiPC.

[19]  E M Fortunato,et al.  Implementation of the quantum Fourier transform. , 2001, Physical review letters.

[20]  Frederic T. Chong,et al.  The effect of communication costs in solid-state quantum computing architectures , 2003, SPAA '03.

[21]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[22]  Margaret Martonosi,et al.  Characterizing the performance effect of trials and rotations in applications that use Quantum Phase Estimation , 2014, 2014 IEEE International Symposium on Workload Characterization (IISWC).

[23]  Frederic T. Chong,et al.  QuRE: The Quantum Resource Estimator toolbox , 2013, 2013 IEEE 31st International Conference on Computer Design (ICCD).

[24]  Frédéric Magniez,et al.  Quantum algorithms for the triangle problem , 2005, SODA '05.

[25]  John Kubiatowicz,et al.  A fault tolerant, area efficient architecture for Shor's factoring algorithm , 2009, ISCA '09.