Challenges and Opportunities of Near-Term Quantum Computing Systems

被引:98
作者
Corcoles, Antonio D. [1 ]
Kandala, Abhinav [1 ]
Javadi-Abhari, Ali [1 ]
McClure, Douglas T. [1 ]
Cross, Andrew W. [1 ]
Temme, Kristan [1 ]
Nation, Paul D. [1 ]
Steffen, Matthias [1 ]
Gambetta, Jay M. [1 ]
机构
[1] IBM Thomas J Watson Res Ctr, Int Business Machines, Yorktown Hts, NY 10598 USA
关键词
Qubit; Logic gates; Fault tolerance; Fault tolerant systems; Error analysis; Interference; Quantum computing; quantum systems; superconducting qubits; CIRCUITS; DECOHERENCE; COMPUTATION; ALGORITHMS;
D O I
10.1109/JPROC.2019.2954005
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The concept of quantum computing has inspired a whole new generation of scientists, including physicists, engineers, and computer scientists, to fundamentally change the landscape of information technology. With experimental demonstrations stretching back more than two decades, the quantum computing community has achieved a major milestone over the past few years: the ability to build systems that are stretching the limits of what can be classically simulated, and which enable cloud-based research for a wide range of scientists, thus increasing the pool of talent exploring early quantum systems. While such noisy near-term quantum computing systems fall far short of the requirements for fault-tolerant systems, they provide unique test beds for exploring the opportunities for quantum applications. Here, we highlight an IBM-specific perspective of the facets associated with these systems, including quantum software, cloud access, benchmarking quantum systems, error correction and mitigation in such systems, understanding the complexity of quantum circuits, and how early quantum applications can run on near-term quantum computers.
引用
收藏
页码:1338 / 1352
页数:15
相关论文
共 142 条
[1]   Improved simulation of stabilizer circuits [J].
Aaronson, S ;
Gottesman, D .
PHYSICAL REVIEW A, 2004, 70 (05) :052328-1
[2]  
Aaronson S, 2015, ACM S THEORY COMPUT, P307, DOI [10.1137/15M1050902, 10.1145/2746539.2746547]
[3]  
Aharonov D., 1997, PROC ACM S THEORY CO, P176, DOI DOI 10.1145/258533.258579
[4]  
Aleksandrowicz G., 2019, TECH REP, DOI [10.5281/zenodo.2562111, DOI 10.5281/ZEN0D0.2562111]
[5]   On the controlled-NOT complexity of controlled-NOT-phase circuits [J].
Amy, Matthew ;
Azimzadeh, Parsiad ;
Mosca, Michele .
QUANTUM SCIENCE AND TECHNOLOGY, 2019, 4 (01)
[6]   Verified Compilation of Space-Efficient Reversible Circuits [J].
Amy, Matthew ;
Roetteler, Martin ;
Svore, Krysta M. .
COMPUTER AIDED VERIFICATION (CAV 2017), PT II, 2017, 10427 :3-21
[7]   Polynomial-Time T-Depth Optimization of Clifford plus T Circuits Via Matroid Partitioning [J].
Amy, Matthew ;
Maslov, Dmitri ;
Mosca, Michele .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2014, 33 (10) :1476-1489
[8]   A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits [J].
Amy, Matthew ;
Maslov, Dmitri ;
Mosca, Michele ;
Roetteler, Martin .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (06) :818-830
[9]  
[Anonymous], 2017, QISK TERR
[10]  
[Anonymous], 1910, T R SOC LOND A, DOI DOI 10.1098/RSTA.1911.0009