Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers

Abstract

Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and 2-qubit (quantum bit) gates. Quantum compiler frameworks translate this quantum assembly to electric signals (called control pulses) that implement the specified computation on specific physical devices. However, there is a mismatch between the operations defined by the 1- and 2-qubit logical ISA and their underlying physical implementation, so the current practice of directly translating logical instructions into control pulses results in inefficient, high-latency programs. To address this inefficiency, we propose a universal quantum compilation methodology that aggregates multiple logical operations into larger units that manipulate up to 10 qubits at a time. Our methodology then optimizes these aggregates by (1) finding commutative intermediate operations that result in more efficient schedules and (2) creating custom control pulses optimized for the aggregate (instead of individual 1- and 2-qubit operations). Compared to the standard gate-based compilation, the proposed approach realizes a deeper vertical integration of high-level quantum software and low-level, physical quantum hardware. We evaluate our approach on important near-term quantum applications on simulations of superconducting quantum architectures. Our proposed approach provides a mean speedup of $5\times$, with a maximum of $10\times$. Because latency directly affects the feasibility of quantum computation, our results not only improve performance but also have the potential to enable quantum computation sooner than otherwise possible.

13 pages, to apper in ASPLOS

References in corpus (35)

• Quantum Computing in the NISQ era and beyond
• Quantum Computation with Quantum Dots
• A variational eigenvalue solver on a quantum processor
• Charge insensitive qubit design derived from the Cooper pair box
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• The theory of variational hybrid quantum-classical algorithms
• QuTiP: An open-source Python framework for the dynamics of open quantum systems
• A Quantum Approximate Optimization Algorithm
• NMR Techniques for Quantum Control and Computation
• Characterizing Quantum Supremacy in Near-Term Devices
• Towards Quantum Chemistry on a Quantum Computer
• Demonstration of a small programmable quantum computer with atomic qubits
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Training Schrödinger's cat: quantum optimal control
• A Superconducting Persistent Current Qubit
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Generation of Three-Qubit Entangled States using Superconducting Phase Qubits
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Implementing a Universal Gate Set on a Logical Qubit Encoded in an Oscillator
• Second order gradient ascent pulse engineering
• Blueprint for a microwave trapped-ion quantum computer
• Demonstration of quantum error correction and universal gate set on a binomial bosonic logical qubit
• Quantum Circuit Simplification and Level Compaction
• Natural two-qubit gate for quantum computation using the XY interaction
• Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
• Automated optimization of large quantum circuits with continuous parameters
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• A Software Methodology for Compiling Quantum Programs
• Experimental demonstration of a resonator-induced phase gate in a multi-qubit circuit QED system
• Speedup for quantum optimal control from automatic differentiation based on graphics processing units
• An Experimental Microarchitecture for a Superconducting Quantum Processor
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Driven Geometric Phase Gates with Trapped Ions
• Quantum CISC Compilation by Optimal Control and Scalable Assembly of Complex Instruction Sets beyond Two-Qubit Gates

Cited by in corpus (40)

• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Qiskit Pulse: Programming Quantum Computers Through the Cloud with Pulses
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Timing and resource-aware mapping of quantum circuits to superconducting processors
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation
• Distributed Quantum Computing and Network Control for Accelerated VQE
• Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
• Effects of Dynamical Decoupling and Pulse-level Optimizations on IBM Quantum Computers
• Quantum Computing: An Overview Across the System Stack
• QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation
• Resource-Efficient Quantum Computing by Breaking Abstractions
• Modeling Noisy Quantum Circuits Using Experimental Characterization
• JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
• Suppressing ZZ Crosstalk of Quantum Computers through Pulse and Scheduling Co-Optimization
• Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer
• HAMMER: boosting fidelity of noisy Quantum circuits by exploiting Hamming behavior of erroneous outcomes
• Logical Clifford Synthesis for Stabilizer Codes
• Simulating nonnative cubic interactions on noisy quantum machines
• Quantum circuit synthesis using Householder transformations
• Model predictive control for robust quantum state preparation
• Discrete Adjoints for Accurate Numerical Optimization with Application to Quantum Control
• 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
• Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling
• Time-Efficient Qudit Gates through Incremental Pulse Re-seeding
• CertiQ: A Mostly-automated Verification of a Realistic Quantum Compiler
• QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
• Quantum Vulnerability Analysis to Accurate Estimate the Quantum Algorithm Success Rate
• Robust and Resource-Efficient Quantum Circuit Approximation
• Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
• Towards Efficient Superconducting Quantum Processor Architecture Design
• Enabling Multi-threading in Heterogeneous Quantum-Classical Programming Models
• Classical Coding Approaches to Quantum Applications
• Exploiting Different Levels of Parallelism in the Quantum Control Microarchitecture for Superconducting Qubits
• DisQ: A Novel Quantum Output State Classification Method on IBM Quantum Computers using OpenPulse
• Towards a pulse-level intermediate representation for diverse quantum control systems
• Using optimal control to guide neural-network interpolation of continuously-parameterized gates
• AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation
• POPQC: Parallel Optimization for Quantum Circuits (Extended Version)