Resource-Efficient Quantum Computing by Breaking Abstractions
Yunong Shi, Pranav Gokhale, Prakash Murali, Jonathan M. Baker, Casey, Duckering, Yongshan Ding, Natalie C. Brown, Christopher Chamberland, Ali, Javadi Abhari, Andrew W. Cross, David I. Schuster, Kenneth R. Brown, Margaret, Martonosi, Frederic T. Chong

TL;DR
This paper reviews how breaking traditional layered abstractions in quantum computing software and hardware can lead to more resource-efficient systems, potentially accelerating quantum application development.
Contribution
It highlights recent approaches that challenge standard abstractions in quantum computing, proposing hardware-aware optimizations and error correction schemes for improved efficiency.
Findings
Hardware-aware compilation optimizations break the quantum ISA abstraction.
Error-correction schemes that break the qubit abstraction.
Discussion of future directions for resource-efficient quantum computing.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
