TY - GEN
T1 - Optimized surface code communication in superconducting quantum computers
AU - Javadi-Abhari, Ali
AU - Gokhale, Pranav
AU - Holmes, Adam
AU - Franklin, Diana
AU - Brown, Kenneth R.
AU - Martonosi, Margaret
AU - Chong, Frederic T.
N1 - Funding Information:
This work was funded in part by Los Alamos National Laboratory and the U.S. Department of Defense under subcontract 431682, by NSF PHY grant 1660686, and by a research gift from Intel Corporation.
PY - 2017/10/14
Y1 - 2017/10/14
N2 - Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [30, 73], and several-hundred-qubit machines are around the corner. Machines of this scale have the capacity to demonstrate quantum supremacy, the tipping point where QC is faster than the fastest classical alternative for a particular problem. Because error correction techniques will be central to QC and will be the most expensive component of quantum computation, choosing the lowest-overhead error correction scheme is critical to overall QC success. This paper evaluates two established quantum error correction codes - planar and double-defect surface codes - using a set of compilation, scheduling and network simulation tools. In considering scalable methods for optimizing both codes, we do so in the context of a full microarchitectural and compiler analysis. Contrary to previous predictions, we find that the simpler planar codes are sometimes more favorable for implementation on superconducting quantum computers, especially under conditions of high communication congestion.
AB - Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [30, 73], and several-hundred-qubit machines are around the corner. Machines of this scale have the capacity to demonstrate quantum supremacy, the tipping point where QC is faster than the fastest classical alternative for a particular problem. Because error correction techniques will be central to QC and will be the most expensive component of quantum computation, choosing the lowest-overhead error correction scheme is critical to overall QC success. This paper evaluates two established quantum error correction codes - planar and double-defect surface codes - using a set of compilation, scheduling and network simulation tools. In considering scalable methods for optimizing both codes, we do so in the context of a full microarchitectural and compiler analysis. Contrary to previous predictions, we find that the simpler planar codes are sometimes more favorable for implementation on superconducting quantum computers, especially under conditions of high communication congestion.
KW - Design-space exploration
KW - ECC
KW - Quantum computing
UR - http://www.scopus.com/inward/record.url?scp=85034038837&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85034038837&partnerID=8YFLogxK
U2 - 10.1145/3123939.3123949
DO - 10.1145/3123939.3123949
M3 - Conference contribution
AN - SCOPUS:85034038837
T3 - Proceedings of the Annual International Symposium on Microarchitecture, MICRO
SP - 692
EP - 705
BT - MICRO 2017 - 50th Annual IEEE/ACM International Symposium on Microarchitecture Proceedings
PB - IEEE Computer Society
T2 - 50th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2017
Y2 - 14 October 2017 through 18 October 2017
ER -