Skip to main content

An updated LLVM-based quantum research compiler with further OpenQASM support

Author(s): Litteken, Andrew; Fan, Yung-Ching; Singh, Devina; Martonosi, Margaret; Chong, Frederic T.

To refer to this page use:
Abstract: Quantum computing is a rapidly growing field with the potential to change how we solve previously intractable problems. Emerging hardware is approaching a complexity that requires increasingly sophisticated programming and control. Scaffold is an older quantum programming language that was originally designed for resource estimation for far-future, large quantum machines, and ScaffCC is the corresponding LLVM-based compiler. For the first time, we provide a full and complete overview of the language itself, the compiler as well as its pass structure. While previous works Abhari et al (2015 Parallel Comput.45 2–17), Abhari et al (2012 Scaffold: quantum programming language, have piecemeal descriptions of different portions of this toolchain, we provide a more full and complete description in this paper. We also introduce updates to ScaffCC including conditional measurement and multidimensional qubit arrays designed to keep in step with modern quantum assembly languages, as well as an alternate toolchain targeted at maintaining correctness and low resource count for noisy-intermediate scale quantum (NISQ) machines, and compatibility with current versions of LLVM and Clang. Our goal is to provide the research community with a functional LLVM framework for quantum program analysis, optimization, and generation of executable code.
Publication Date: 28-May-2020
Citation: Litteken, Andrew, Fan, Yung-Ching, Singh, Devina, Martonosi, Margaret and Chong, Frederic T. "An updated LLVM-based quantum research compiler with further OpenQASM support." Quantum Science and Technology 5, no. 3 (2020): 034013. doi:10.1088/2058-9565/ab8c2c
DOI: 10.1088/2058-9565/ab8c2c
EISSN: 2058-9565
Pages: 034013
Type of Material: Journal Article
Journal/Proceeding Title: Quantum Science and Technology
Version: Final published version. This is an open access article.

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