Advantages of a modular high-level quantum programming framework

Abstract

We review some of the features of the ProjectQ software framework and quantify their impact on the resulting circuits. The concise high-level language facilitates implementing even complex algorithms in a very time-efficient manner while, at the same time, providing the compiler with additional information for optimization through code annotation - so-called meta-instructions. We investigate the impact of these annotations for the example of Shor's algorithm in terms of logical gate counts. Furthermore, we analyze the effect of different intermediate gate sets for optimization and how the dimensions of the resulting circuit depend on a smart choice thereof. Finally, we demonstrate the benefits of a modular compilation framework by implementing mapping procedures for one- and two-dimensional nearest neighbor architectures which we then compare in terms of overhead for different problem sizes.

References in corpus (20)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Roads towards fault-tolerant universal quantum computation
• Semiclassical Fourier Transform for Quantum Computation
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Cryogenic Control Architecture for Large-Scale Quantum Computing
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
• Addition on a Quantum Computer
• 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
• A Software Methodology for Compiling Quantum Programs
• LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quipper: A Scalable Quantum Programming Language
• High Performance Emulation of Quantum Circuits
• Shor's algorithm on a nearest-neighbor machine
• Factoring with n+2 clean qubits and n-1 dirty qubits
• Optimal Quantum Circuits for Nearest-Neighbor Architectures
• Routing and Sorting Via Matchings On Graphs

Cited by in corpus (3)

• Surface code compilation via edge-disjoint paths
• Using Reinforcement Learning to find Efficient Qubit Routing Policies for Deployment in Near-term Quantum Computers
• Scheduler of quantum circuits based on dynamical pattern improvement and its application to hardware design