Quipper

Green, Alexander S.; Lumsdaine, Peter LeFanu; Ross, Neil J.; Selinger, Peter; Valiron, Benoît

doi:10.1145/2499370.2462177

Cited by 120 publications

(26 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quipper is a functional programming language for quantum computing [3,4]. What distinguishes Quipper from earlier quantum programming languages, such as the quantum lambda calculus [10], is that it is a circuit description language.…”

Section: Introductionmentioning

confidence: 99%

A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)

Rios

Selinger

2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Quipper is a practical programming language for describing families of quantum circuits. In this paper, we formalize a small, but useful fragment of Quipper called Proto-Quipper-M. Unlike its parent Quipper, this language is type-safe and has a formal denotational and operational semantics. Proto-Quipper-M is also more general than Quipper, in that it can describe families of morphisms in any symmetric monoidal category, of which quantum circuits are but one example. We design Proto-Quipper-M from the ground up, by first giving a general categorical model of parameters and state. The distinction between parameters and state is also known from hardware description languages. A parameter is a value that is known at circuit generation time, whereas a state is a value that is known at circuit execution time. After finding some interesting categorical structures in the model, we then define the programming language to fit the model. We cement the connection between the language and the model by proving type safety, soundness, and adequacy properties.

show abstract

Section: Introductionmentioning

confidence: 99%

A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)

Rios

Selinger

2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many quantum programming languages and compilers have been developed with the goal of simplifying and abstracting quantum programming from the low level details of the hardware. These includes works such as Quipper [12,13], which is a domain specific language embedded in Haskell, and LIQUi| [14] which uses the F# language. These languages offer functionality for quantum circuit description, classical control and compilation and circuit generation.…”

Section: Related Workmentioning

confidence: 99%

Formal constraint-based compilation for noisy intermediate-scale quantum systems

Murali

Javadi-Abhari

Chong

et al. 2019

Microprocessors and Microsystems

View full text Add to dashboard Cite

Noisy, intermediate-scale quantum (NISQ) systems are expected to have a few hundred qubits, minimal or no error correction, limited connectivity and limits on the number of gates that can be performed within the short coherence window of the machine. The past decade's research on quantum programming languages and compilers is directed towards large systems with thousands of qubits. For near term quantum systems, it is crucial to design tool flows which make efficient use of the hardware resources without sacrificing the ease and portability of a high-level programming environment. In this paper, we present a compiler for the Scaffold quantum programming language in which aggressive optimization specifically targets NISQ machines with hundreds of qubits. Our compiler extracts gates from a Scaffold program, and formulates a constrained optimization problem which considers both program characteristics and machine constraints. Using the Z3 SMT solver, the compiler maps program qubits to hardware qubits, schedules gates, and inserts CNOT routing operations while optimizing the overall execution time. The output of the optimization is used to produce target code in the OpenQASM language, which can be executed on existing quantum hardware such as the 16-qubit IBM machine. Using real and synthetic benchmarks, we show that it is feasible to synthesize near-optimal compiled code for current and small NISQ systems. For large programs and machine sizes, the SMT optimization approach can be used to synthesize compiled code that is guaranteed to finish within the coherence window of the machine.

show abstract

“…One possible approach is to implement the algorithm in a quantum programming language, as this also enables testing and debugging. To this end, a host of software packages, programming languages, methodologies, and compilers for quantum computing have been developed [Chong et al 2017;Green et al 2013; Quantum logic Classical logic Extracted information:…”

Section: Introductionmentioning

confidence: 99%

Assertion-based optimization of Quantum programs

Häner

Hoefler

Troyer

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Quantum computers promise to perform certain computations exponentially faster than any classical device. Precise control over their physical implementation and proper shielding from unwanted interactions with the environment become more difficult as the space/time volume of the computation grows. Code optimization is thus crucial in order to reduce resource requirements to the greatest extent possible. Besides manual optimization, previous work has adapted classical methods such as constant-folding and common subexpression elimination to the quantum domain. However, such classically-inspired methods fail to exploit certain optimization opportunities across subroutine boundaries, limiting the effectiveness of software reuse. To address this insufficiency, we introduce an optimization methodology which employs annotations that describe how subsystems are entangled in order to exploit these optimization opportunities. We formalize our approach, prove its correctness, and present benchmarks: Without any prior manual optimization, our methodology is able to reduce, e.g., the qubit requirements of a 64-bit floating-point subroutine by 34×.

show abstract

Quipper

Cited by 120 publications

References 15 publications

A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)

A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)

Formal constraint-based compilation for noisy intermediate-scale quantum systems

Assertion-based optimization of Quantum programs

Contact Info

Product

Resources

About