Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit

Published 14 Sep 2022 in quant-ph, cs.IT, and math.IT | (2209.06673v2)

Abstract: This paper explores a new approach to fault-tolerant quantum computing (FTQC), relying on quantum polar codes. We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit, which we refer to as Q1\mathcal{Q}_1 codes. First, we show that a subfamily of Q1\mathcal{Q}_1 codes is equivalent to the well-known family of Shor codes. Moreover, we show that Q1\mathcal{Q}_1 codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of Q1\mathcal{Q}_1 code states. We give a recursive procedure to prepare a Q1\mathcal{Q}_1 code state, based on two-qubit Pauli measurements only. The procedure is not by itself fault-tolerant, however, the measurement operations therein provide redundant classical bits, which can be advantageously used for error detection. Fault-tolerance is then achieved by combining the proposed recursive procedure with an error detection method. Finally, we consider the fault-tolerant error correction of Q1\mathcal{Q}_1 codes. We use Steane error correction, which incorporates the proposed fault-tolerant code state preparation procedure. We provide numerical estimates of the logical error rates for Q1\mathcal{Q}_1 and Shor codes of length $16$ and $64$ qubits, assuming a circuit-level depolarizing noise model. Remarkably, the Q1\mathcal{Q}_1 code of length $64$ qubits achieves a logical error rate very close to 10−610^{-6} for the physical error rate p=10−3p = 10^{-3}, therefore, demonstrating the potential of the proposed polar codes based approach to FTQC.

Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.