  We apply the quantum error detection scheme Pauli check sandwiching (PCS) to
quantum networks by turning it into a distributed multiparty protocol. PCS is a
distance 1 code and requires less resource overhead than standard quantum error
correction and detection methods. We provide analytical equations for the final
fidelity and postselection rate. We also introduce a recursive version of PCS
for entanglement purification that only scales polynomially in the resources
required as a function of the number of recursions. The recursive PCS scheme
generates a family of distance 2 quantum codes. Our analytical results are
benchmarked against BBPSSW in comparable scenarios. We also perform simulations
with noisy gates for entanglement swapping and attain substantial fidelity
improvements. Lastly, we discuss various setups and graph state properties of
PCS.
