Resource-Efficient Quantum Computing by Breaking Abstractions

Abstract

Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing applications that might save years of engineering effort. Current quantum software stacks follow a layered approach similar to the stack of classical computers, which was designed to manage the complexity. In this review, we point out that greater efficiency of quantum computing systems can be achieved by breaking the abstractions between these layers. We review several works along this line, including two hardware-aware compilation optimizations that break the quantum Instruction Set Architecture (ISA) abstraction and two error-correction/information-processing schemes that break the qubit abstraction. Last, we discuss several possible future directions.

Invited paper by Proceedings of IEEE special issue

References in corpus (22)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Charge insensitive qubit design derived from the Cooper pair box
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• A Quantum Approximate Optimization Algorithm
• Experimental Comparison of Two Quantum Computing Architectures
• Simulating chemistry using quantum computers
• Efficient Toffoli Gates Using Qudits
• Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
• Universal stabilization of a parametrically coupled qubit
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
• Tensor Networks in a Nutshell
• Quantum Circuit Placement
• Asymptotic Improvements to Quantum Circuits via Qutrits
• Classical Simulation of Quantum Supremacy Circuits
• Efficient preparation and detection of microwave dressed-state qubits and qutrits with trapped ions
• Generalized Toffoli gates using qudit catalysis
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Time-efficient implementation of quantum search with qudits
• Factoring with n+2 clean qubits and n-1 dirty qubits
• Quantum CISC Compilation by Optimal Control and Scalable Assembly of Complex Instruction Sets beyond Two-Qubit Gates
• Characterization of qutrit channels in terms of their covariance and symmetry properties