Low-overhead quantum computing with the color code

被引:0
|
作者
Thomsen, Felix [1 ]
Kesselring, Markus S. [2 ]
Bartlett, Stephen D. [1 ]
Brown, Benjamin J. [1 ]
机构
[1] Univ Sydney, Ctr Engn Quantum Syst, Sch Phys, Sydney, NSW 2006, Australia
[2] Free Univ Berlin, Dahlem Ctr Complex Quantum Syst, D-14195 Berlin, Germany
来源
PHYSICAL REVIEW RESEARCH | 2024年 / 6卷 / 04期
基金
澳大利亚研究理事会;
关键词
DEFINITE QUADRATIC-FORMS; COOLING RATE; CRYSTALLIZATION; DIFFRACTION; SYSTEMS; SHAPE; HEAR;
D O I
10.1103/PhysRevResearch.6.043125
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an approach based on the color code can lead to considerable reductions in the resource overheads compared with conventional methods, while remaining compatible with a two-dimensional layout. We propose a lattice surgery scheme that exploits the rich structure of the color-code phase to perform arbitrary pairs of commuting logical Pauli measurements in parallel while keeping the space cost low. Compared to lattice surgery schemes based on the surface code with the same code distance, and assuming the same amount of time is needed to complete a round of syndrome measurements, our approach yields about a 3x improvement in the space-time overhead, obtained from a combination of a 1.5x improvement in spatial overhead together with a 2x speedup due to the parallelization of commuting logical measurements. Even when taking into account the color code's lower error threshold using current decoders, the overhead is reduced by 10% at a physical error rate of 10-3 and by 50% at 10-4.
引用
收藏
页数:12
相关论文
共 50 条
  • [21] Low-Overhead Architecture for Security Tag
    Shioya, Ryota
    Kim, Daewung
    Horio, Kazuo
    Goshima, Masahiro
    Sakai, Shuichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (01): : 69 - 78
  • [22] Low-overhead scheduling of nested parallelism
    Hummel, S.F.
    Schonberg, E.
    1600, (35): : 5 - 6
  • [23] Low-overhead architecture for security tag
    Shioya, Ryota
    Kim, Daewung
    Horio, Kazuo
    Goshima, Masahiro
    Sakai, Shuichi
    IEEE 15TH PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING, PROCEEDINGS, 2009, : 135 - 142
  • [24] EFD: An Efficient Low-Overhead Scheduler
    Chen, Jinbang
    Heusse, Martin
    Urvoy-Keller, Guillaume
    NETWORKING 2011, PT II, 2011, 6641 : 150 - 163
  • [25] On the Generation of Binary functions with Low-Overhead
    Voyiatzis, I.
    Efstathiou, C.
    2017 12TH IEEE INTERNATIONAL CONFERENCE ON DESIGN & TECHNOLOGY OF INTEGRATED SYSTEMS IN NANOSCALE ERA (DTIS 2017), 2017,
  • [26] Low-Overhead Accrual Failure Detector
    Ren, Xiao
    Dong, Jian
    Liu, Hongwei
    Li, Yang
    Yang, Xiaozong
    SENSORS, 2012, 12 (05): : 5815 - 5823
  • [27] Low-Overhead Vlrtualization of Mobile Platforms
    Heiser, Gernot
    PROCEEDINGS OF THE PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON COMPILERS, ARCHITECTURES AND SYNTHESIS FOR EMBEDDED SYSTEMS (CASES '11), 2011, : 3 - 3
  • [28] LoGV: Low-overhead GPGPU Virtualization
    Gottschlag, Mathias
    Hillenbrand, Marius
    Kehne, Jens
    Stoess, Jan
    Bellosa, Frank
    2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC), 2013, : 1721 - 1726
  • [29] LOW-OVERHEAD SCHEDULING OF NESTED PARALLELISM
    HUMMEL, SF
    SCHONBERG, E
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1991, 35 (5-6) : 743 - 765
  • [30] High-threshold and low-overhead fault-tolerant quantum memory
    Bravyi, Sergey
    Cross, Andrew W.
    Gambetta, Jay M.
    Maslov, Dmitri
    Rall, Patrick
    Yoder, Theodore J.
    NATURE, 2024, 627 (8005)