Skip to main content

ScaffCC: Scalable compilation and analysis of quantum programs

Author(s): Javadiabhari, A; Patil, S; Kudrow, D; Heckey, J; Lvov, A; et al

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1768q
Abstract: Abstract We present ScaffCC, a scalable compilation and analysis framework based on LLVM (Lattner and Adve, 2004), which can be used for compiling quantum computing applications at the logical level. Drawing upon mature compiler technologies, we discuss similarities and differences between compilation of classical and quantum programs, and adapt our methods to optimizing the compilation time and output for the quantum case. Our work also integrates a reversible-logic synthesis tool in the compiler to facilitate coding of quantum circuits. Lastly, we present some useful quantum program analysis scenarios and discuss their implications, specifically with an elaborate discussion of timing analysis for critical path estimation. Our work focuses on bridging the gap between high-level quantum algorithm specifications and low-level physical implementations, while providing good scalability to larger and more interesting problems
Publication Date: 2015
Electronic Publication Date: 10-Dec-2014
Citation: Javadiabhari, A, Patil, S, Kudrow, D, Heckey, J, Lvov, A, Chong, FT, Martonosi, M. (2015). ScaffCC: Scalable compilation and analysis of quantum programs. Parallel Computing, 45 (2 - 17. doi:10.1016/j.parco.2014.12.001
DOI: doi:10.1016/j.parco.2014.12.001
Pages: 2 - 17
Type of Material: Journal Article
Journal/Proceeding Title: Parallel Computing
Version: Author's manuscript



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.