Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
Yu Shi, Ashlesha Patil, Saikat Guha

TL;DR
This paper introduces advanced entanglement distillation protocols and efficient fault-tolerant encoders that improve quantum communication and computing by reducing circuit complexity and enhancing error correction capabilities.
Contribution
It develops high-rate n-to-(n-1) entanglement distillation protocols, a constant-depth stabilizer code decoder, and a fault-tolerant encoding scheme for surface codes.
Findings
Higher-rate entanglement distillation protocols with error correction
A constant-depth decoder for stabilizer codes
Feasible fault-tolerant encoding with surface codes
Abstract
Entanglement is essential for quantum information processing, but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement distillation protocol to higher-rate n-to-(n-1) protocols that can correct any single-qubit errors. These protocols are evaluated through numerical simulations focusing on fidelity and yield. We also outline a method to adapt any classical error-correcting code for entanglement distillation, where the code can correct both bit-flip and phase-flip errors by incorporating Hadamard gates. (2) We propose a constant-depth decoder for stabilizer codes that transforms logical states into physical ones using single-qubit measurements. This decoder is applied to entanglement distillation protocols, reducing circuit depth and enabling protocols derived from…
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
TopicsEvolutionary Algorithms and Applications · Neural Networks and Applications · Quantum Computing Algorithms and Architecture
