Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit
Ashutosh Goswami, Mehdi Mhalla, Valentin Savin

TL;DR
This paper introduces a fault-tolerant quantum computing approach using quantum polar codes, demonstrating their advantages over Shor codes and providing a recursive, measurement-based preparation method with promising error rate performance.
Contribution
It presents a new fault-tolerant quantum code construction based on quantum polar codes, with a recursive preparation method and error correction strategy, outperforming traditional Shor codes.
Findings
Quantum polar codes outperform Shor codes of same length.
Recursive preparation method uses only two-qubit Pauli measurements.
Achieved logical error rate close to 10^{-6} at physical error rate 10^{-3}.
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 codes. First, we show that a subfamily of codes is equivalent to the well-known family of Shor codes. Moreover, we show that codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of code states. We give a recursive procedure to prepare a 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advancements in Semiconductor Devices and Circuit Design · Quantum-Dot Cellular Automata
