Resource-Efficient Quantum Computing by Breaking Abstractions

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. C...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Shi, Yunong, Gokhale, Pranav, Prakash Murali, Baker, Jonathan M, Casey Duckering, Ding, Yongshan, Brown, Natalie C, Chamberland, Christopher, Ali Javadi Abhari, Cross, Andrew W, Schuster, David I, Brown, Kenneth R, Martonosi, Margaret, Chong, Frederic T
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 30.10.2020
Subjects
Computer Science - Systems and Control
Error correction
Physics - Quantum Physics
Quantum computers
Quantum computing
Qubits (quantum computing)
Software
Software engineering
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.2011.00028