staq -- A full-stack quantum processing toolkit

Abstract

We describe 'staq', a full-stack quantum processing toolkit written in standard C++. 'staq' is a quantum compiler toolkit, comprising of tools that range from quantum optimizers and translators to physical mappers for quantum devices with restricted connectives. The design of 'staq' is inspired from the UNIX philosophy of "less is more", i.e. 'staq' achieves complex functionality via combining (piping) small tools, each of which performs a single task using the most advanced current state-of-the-art methods. We also provide a set of illustrative benchmarks.

arXiv commentReplaced with the published version, comments are welcome

References in corpus (14)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Adiabatic Quantum Computing
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Strawberry Fields: A Software Platform for Photonic Quantum Computing
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Automated optimization of large quantum circuits with continuous parameters
• ScaffCC: Scalable Compilation and Analysis of Quantum Programs
• Towards Large-scale Functional Verification of Universal Quantum Circuits
• On the qubit routing problem
• On the CNOT-complexity of CNOT-PHASE circuits
• Sized Types for low-level Quantum Metaprogramming

Cited by in corpus (23)

• MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
• Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow
• Equivalence Checking of Quantum Circuits with the ZX-Calculus
• NetQASM -- A low-level instruction set architecture for hybrid quantum-classical programs in a quantum internet
• Generative machine learning with tensor networks: benchmarks on near-term quantum computers
• Predicting Good Quantum Circuit Compilation Options
• Revisiting the Mapping of Quantum Circuits: Entering the Multi-Core Era
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Benchmarking the performance of quantum computing software
• Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
• Architecture aware compilation of quantum circuits via lazy synthesis
• Integration of Quantum Accelerators with High Performance Computing -- A Review of Quantum Programming Tools
• Using Quantum Computers to Speed Up Dynamic Testing of Software
• Optimizing Quantum Algorithms on Bipotent Architectures
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Calibration-Aware Transpilation for Variational Quantum Optimization
• Lower T-count with faster algorithms
• On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
• Improving Qubit Routing by Using Entanglement Mediated Remote Gates
• Simulating quantum dynamics: Evolution of algorithms in the HPC context
• Quantum Circuit Unoptimization
• Composability of global phase invariant distance and its application to approximation error management
• Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation