A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
Entanglement purification on quantum networks
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
PSM protocol combines progressive swapping from both path ends to the middle, claiming higher link probability than standard PS with imperfect memories, reasonable fidelity, and lower resource use than parallel protocols.
citing papers explorer
-
Distributed Realization of Color Codes for Quantum Error Correction
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
-
An efficient Progressive Swapping to the Middle distribution protocol adapted to imperfect quantum memories in quantum networks
PSM protocol combines progressive swapping from both path ends to the middle, claiming higher link probability than standard PS with imperfect memories, reasonable fidelity, and lower resource use than parallel protocols.