Skip to content
DraconiticResearch
Search Sources API
197,761 studies31 sourcesUpdated 19 min ago
PreprintarXiv licencearXiv

Connection of surface code patches based on entanglement distillation without postselection

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.

Related

  1. Universal Entanglement Distillation
    Salvatore Tirone, Francesco Anna Mele, Vittorio Giovannetti +1
    arXivPreprintCC BY 4.0Full textGeneral mathematicsQuantum physics & quantum informationarXiv
  2. Correlated Catalysis Removes the Strong Converse for Entanglement Distillation
    Piotr Masajada, Aby Philip, Alexander Streltsov
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Universal distillation of quantum entanglement
    Ryuji Takagi, Kaito Watanabe, Takaya Matsuura +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. On PPT entanglement distillation
    Ludovico Lami
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testing
    Matthew Can, Mark M. Wilde
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
BibTeX
@misc{mishima2026connection,
  title = {{Connection of surface code patches based on entanglement distillation without postselection}},
  author = {Moeto Mishima and Toshihiko Sasaki and Yasunari Suzuki and Koji Azuma and Masato Koashi},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.06260},
  eprint = {2611.06260},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.06260},
}
RIS
TY  - UNPB
TI  - Connection of surface code patches based on entanglement distillation without postselection
AU  - Moeto Mishima
AU  - Toshihiko Sasaki
AU  - Yasunari Suzuki
AU  - Koji Azuma
AU  - Masato Koashi
PY  - 2026
DA  - 2026/11/04
PB  - arXiv
DO  - 10.48550/arxiv.2611.06260
UR  - https://arxiv.org/abs/2611.06260
AB  - 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.
ER  -