Connection of surface code patches based on entanglement distillation without postselection
Moeto Mishima, Toshihiko Sasaki, Yasunari Suzuki, Koji Azuma, Masato Koashi
Abstract
Distributed quantum computing is a promising approach for overcoming the scalability limitations of fault-tolerant quantum computing. Entanglement distillation, a process that extracts higher-fidelity entangled states from noisy ones, plays a key role in distributed quantum computing. However, simple distillation protocols typically rely on postselection, which poses practical challenges for implementation. Here, we propose a scheme for distributed surface-code quantum computing that benefits from entanglement distillation even without postselection. Numerical simulations show that the logical error rates in the proposed scheme are lower than those in the setting without distillation. Additionally, we demonstrate that the logical error rates can be suppressed further by exploiting the asymmetry between spacelike and timelike errors in the surface code. The proposed scheme offers a practical and simple approach to distributed quantum computing with surface codes.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado