Resource-Efficient Quantum Computing by Breaking Abstractions

被引:22
|
作者
Shi, Yunong [1 ]
Gokhale, Pranav [2 ]
Murali, Prakash [3 ]
Baker, Jonathan M. [2 ]
Duckering, Casey [2 ]
Ding, Yongshan [2 ]
Brown, Natalie C. [4 ]
Chamberland, Christopher [5 ,6 ]
Javadi-Abhari, Ali [7 ]
Cross, Andrew W. [7 ]
Schuster, David, I [1 ]
Brown, Kenneth R. [4 ]
Martonosi, Margaret [3 ]
Chong, Frederic T. [2 ]
机构
[1] Univ Chicago, Dept Phys, Chicago, IL 60637 USA
[2] Univ Chicago, Dept Comp Sci, Chicago, IL 60637 USA
[3] Princeton Univ, Dept Comp Sci, Princeton, NJ 08544 USA
[4] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27708 USA
[5] AWS Ctr Quantum Comp, Pasadena, CA 91125 USA
[6] CALTECH, Inst Quantum Informat & Matter, Pasadena, CA 91125 USA
[7] IBM Thomas J Watson Res Ctr, Ossining, NY 10598 USA
基金
美国国家科学基金会;
关键词
Qubit; Logic gates; Hardware; Ions; Optimization; Computer architecture; Quantum computing (QC); software design; system analysis and design;
D O I
10.1109/JPROC.2020.2994765
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1353 / 1370
页数:18
相关论文
共 50 条
  • [1] Resource-efficient verification of quantum computing using Serfling's bound
    Takeuchi, Yuki
    Mantri, Atul
    Morimae, Tomoyuki
    Mizutani, Akihiro
    Fitzsimons, Joseph F.
    NPJ QUANTUM INFORMATION, 2019, 5 (1)
  • [2] Resource-efficient verification of quantum computing using Serfling’s bound
    Yuki Takeuchi
    Atul Mantri
    Tomoyuki Morimae
    Akihiro Mizutani
    Joseph F. Fitzsimons
    npj Quantum Information, 5
  • [3] Resource-Efficient Computing in Wearable Systems
    Pedram, Mahdi
    Rofouei, Mahsan
    Fraternali, Francesco
    Ashari, Zhila Esna
    Ghasemzadeh, Hassan
    2019 IEEE INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP 2019), 2019, : 150 - 155
  • [4] A Resource-Efficient Design for a Reversible Floating Point Adder in Quantum Computing
    Trung Duc Nguyen
    Van Meter, Rodney
    ACM JOURNAL ON EMERGING TECHNOLOGIES IN COMPUTING SYSTEMS, 2014, 11 (02)
  • [5] Quantum Semantic Communications for Resource-Efficient Quantum Networking
    Chehimi, Mahdi
    Chaccour, Christina
    Thomas, Christo Kurisummoottil
    Saad, Walid
    IEEE COMMUNICATIONS LETTERS, 2024, 28 (04) : 803 - 807
  • [6] Resource-efficient quantum algorithm for protein folding
    Anton Robert
    Panagiotis Kl. Barkoutsos
    Stefan Woerner
    Ivano Tavernelli
    npj Quantum Information, 7
  • [7] Resource-efficient quantum algorithm for protein folding
    Robert, Anton
    Barkoutsos, Panagiotis Kl.
    Woerner, Stefan
    Tavernelli, Ivano
    NPJ QUANTUM INFORMATION, 2021, 7 (01)
  • [8] Resource-efficient quantum principal component analysis
    Wang, Youle
    Luo, Yu
    QUANTUM SCIENCE AND TECHNOLOGY, 2024, 9 (03):
  • [9] A resource-efficient quantum convolutional neural network
    Song, Yanqi
    Li, Jing
    Wu, Yusen
    Qin, Sujuan
    Wen, Qiaoyan
    Gao, Fei
    FRONTIERS IN PHYSICS, 2024, 12
  • [10] Resource-efficient linear optical quantum computation
    Browne, DE
    Rudolph, T
    PHYSICAL REVIEW LETTERS, 2005, 95 (01)