Quantum Brain
← Back to papers

Resource-Efficient Quantum Computing by Breaking Abstractions

Yunong Shi, P. Gokhale, Prakash Murali, Jonathan M. Baker, Casey Duckering, Yongshan Ding, N. C. Brown, C. Chamberland, Ali Javadi-Abhari, Andrew W. Cross, D. Schuster, K. Brown, M. Martonosi, F. Chong·June 15, 2020·DOI: 10.1109/JPROC.2020.2994765
Computer SciencePhysicsEngineering

AI Breakdown

Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.

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 (QC) 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 QC 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.

Related Research

Quantum Intelligence

Ask about quantum research, companies, or market developments.