Correlated Decoding of Logical Algorithms with Transversal Gates

被引:0
|
作者
Cain, Madelyn [1 ]
Zhao, Chen [1 ,2 ]
Zhou, Hengyun [1 ,2 ]
Meister, Nadine [1 ]
Ataides, J. Pablo Bonilla [1 ]
Jaffe, Arthur [1 ]
Bluvstein, Dolev [1 ]
Lukin, Mikhail D. [1 ]
机构
[1] Department of Physics, Harvard University, Cambridge, Massachusetts 02138, United States
[2] QuEra Computing Inc., Boston, Massachusetts 02135, United States
关键词
Quantum error correction is believed to be essential for scalable quantum computation; but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation of logical qubits using transversal gates [Bluvstein et al; Nature; (London); 626; 58; (2024)NATUAS0028-083610.1038/s41586-023-06927-3; we show that the performance of logical algorithms can be substantially improved by decoding the qubits jointly to account for error propagation during transversal entangling gates. We find that such correlated decoding improves the performance of both Clifford and non-Clifford transversal entangling gates; and explore two decoders offering different computational runtimes and accuracies. In particular; by leveraging the deterministic propagation of stabilizer measurement errors; we find that correlated decoding enables the number of noisy syndrome extraction rounds between gates to be reduced from O(d) to O(1) in transversal Clifford circuits; where d is the code distance. We verify numerically that this approach substantially reduces the space-time cost of deep logical Clifford circuits. These results demonstrate that correlated decoding provides a major advantage in early fault-tolerant computation; as realized in recent experiments; and further indicate it has considerable potential to reduce the space-time cost in large-scale logical algorithms. © 2024 American Physical Society;
D O I
10.1103/PhysRevLett.133.240602
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] SENSITIVITY ANALYSIS OF TRANSVERSAL RLS ALGORITHMS WITH CORRELATED INPUTS
    ARDALAN, SH
    ADALI, T
    [J]. 1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 1744 - 1747
  • [2] On the Logical Computational Complexity Analysis of Turbo Decoding Algorithms for the LTE Standards
    Beeharry, Y.
    Fowdur, T. P.
    Soyjaudah, K. M. S.
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2021, 118 (02) : 1591 - 1619
  • [3] On the Logical Computational Complexity Analysis of Turbo Decoding Algorithms for the LTE Standards
    Y. Beeharry
    T. P. Fowdur
    K. M. S. Soyjaudah
    [J]. Wireless Personal Communications, 2021, 118 : 1591 - 1619
  • [4] Analysing correlated noise on the surface code using adaptive decoding algorithms
    Nickerson, Naomi H.
    Brown, Benjamin J.
    [J]. QUANTUM, 2019, 3
  • [5] Logical gates in actin monomer
    Adamatzky, Andrew
    [J]. SCIENTIFIC REPORTS, 2017, 7
  • [6] Logical gates in actin monomer
    Andrew Adamatzky
    [J]. Scientific Reports, 7
  • [7] The logical gates from biphotons
    Asikritova Yu.A.
    Balatsky I.D.
    Gorbachev V.N.
    [J]. Physics of Particles and Nuclei Letters, 2007, 4 (2) : 162 - 164
  • [8] Single tests for logical gates
    Popkov, Kirill A.
    [J]. DISCRETE MATHEMATICS AND APPLICATIONS, 2015, 25 (06): : 367 - 382
  • [9] On plant roots logical gates
    Adamatzky, Andrew
    Sirakoulis, Georgios Ch.
    Martinez, Genaro J.
    Baluska, Frantisek
    Mancuso, Stefano
    [J]. BIOSYSTEMS, 2017, 156 : 40 - 45
  • [10] CLASSIFICATION OF TRANSVERSAL GATES IN QUBIT STABILIZER CODES
    Anderson, Jonas T.
    Jochym-O'Connor, Tomas
    [J]. QUANTUM INFORMATION & COMPUTATION, 2016, 16 (9-10) : 771 - 802