Detecting Errors in a Quantum Network with Pauli Checks
Abstract
We apply the quantum error detection scheme Pauli check sandwiching (PCS) to quantum networks by turning it into a distributed multiparty protocol. PCS provides protection on the targeted qubits and generally requires less resource overhead than standard quantum error correction and detection codes. We provide analytical equations for the final fidelity and postselection rate for different PCS checks. We also introduce a recursive version of PCS that generates a family of distance 2 quantum codes that are locally equivalent to Calderbank-Shor-Steane (CSS) codes. Our analytical results are benchmarked against the Bennet-Brassard-Popescu-Schumacher-Smolin-Wooters (BBPSSW) protocol in comparable scenarios. We also perform simulations with noisy gates for entanglement swapping and attain fidelity improvements. Lastly, we discuss various setups and graph state properties of PCS.
Cite
@article{arxiv.2405.15236,
title = {Detecting Errors in a Quantum Network with Pauli Checks},
author = {Alvin Gonzales and Daniel Dilley and Bikun Li and Liang Jiang and Zain H. Saleem},
journal= {arXiv preprint arXiv:2405.15236},
year = {2025}
}
Comments
Comments are welcome!